Publication

Efficiently Making Secure Two-Party Computation Fair

Publications associées (29)

Security of Distance-Bounding: A Survey

Aslan Tchamkerten, Srdan Capkun, Serge Vaudenay, Gildas Avoine, Ioana Cristina Carlson, Martin Benjamin

Distance-bounding protocols allow a verifier to both authenticate a prover and evaluate whether the latter is located in his vicinity. These protocols are of particular interest in contactless systems, e.g. electronic payment or access control systems, whi ...

2018

Labeled PSI from Fully Homomorphic Encryption with Malicious Security

Zhicong Huang

Private Set Intersection (PSI) allows two parties, the sender and the receiver, to compute the intersection of their private sets without revealing extra information to each other. We are interested in the unbalanced PSI setting, where (1) the receiver's s ...

ASSOC COMPUTING MACHINERY2018

UnLynx: A Decentralized System for Privacy-Conscious Data Sharing

Jean-Pierre Hubaux, Patricia Egger, David Jules Froelicher, Christian Vincent Mouchet, Zhicong Huang, Jean Louis Raisaro, Bryan Alexander Ford, Joao André Gomes de Sá e Sousa

Current solutions for privacy-preserving data sharing among multiple parties either depend on a centralized authority that must be trusted and provides only weakest-link security (e.g., the entity that manages private/secret cryptographic keys), or leverag ...

De Gruyter2017

Scalable Bias-Resistant Distributed Randomness

Linus Gasser, Nicolas Gailly, Eleftherios Kokoris Kogias, Bryan Alexander Ford, Ismail Khoffi, Philipp Svetolik Jovanovic

Bias-resistant public randomness is a critical component in many (distributed) protocols. Existing solutions do not scale to hundreds or thousands of participants, as is needed in many decentralized systems. We propose two large-scale distributed protocols ...

IEEE2017

Cybersecurity Solutions for Active Power Distribution Networks

Teklemariam Tsegay Tesfay

An active distribution network (ADN) is an electrical-power distribution network that implements a real-time monitoring and control of the electrical resources and the grid. Effective monitoring and control is realised by deploying a large number of sensin ...

EPFL2017

Creating Secrets Out Of Packet Erasures

Christina Fragouli, Aikaterini Argyraki, Iris Safaka, László Czap

We present protocols for creating pairwise secrets between nodes in a wireless network, so that these secrets are secure from an eavesdropper, Eve, with unbounded computational and memory capabilities, but with limited network presence. We first present a ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Optimal Proximity Proofs

Serge Vaudenay

Provably secure distance-bounding is a rising subject, yet an unsettled one; indeed, very few distance-bounding protocols, with formal security proofs, have been proposed. In fact, so far only two protocols, namely SKI (by Boureanu et al.) and FO (by Fisch ...

Springer2015

Practical and Provably Secure Distance-Bounding

Serge Vaudenay, Aikaterini Mitrokotsa

From contactless payments to remote car unlocking, many applications are vulnerable to relay attacks. Distance bounding protocols are the main practical countermeasure against these attacks. In this paper, we present a formal analysis of SKI, which recentl ...

IOS Press2015

Optimal Proximity Proofs Revisited

Serge Vaudenay, Handan Kilinç Alper

Distance bounding protocols become important since wireless technologies become more and more common. Therefore, the security of the distance bounding protocol should be carefully analyzed. However, most of the protocols are not secure or their security is ...

Springer Verlag2015