Publication
On the Theory and Practice of Modern Secure Messaging
Publications associées (109)
On Quantum Secure Compressing Pseudorandom Functions
In this paper we characterize all 2n-bit-to-n-bit Pseudorandom Functions (PRFs) constructed with the minimum number of calls to n-bit-to-n-bit PRFs and arbitrary number of linear functions. First, we show that all two-round constructions are either classic ...
2023Analysis and Improvements of the Sender Keys Protocol for Group Messaging
Messaging between two parties and in the group setting has enjoyed widespread attention both in practice, and, more recently, from the cryptographic community. One of the main challenges in the area is constructing secure (end-to- end encrypted) and effici ...
2022Optimal Symmetric Ratcheting for Secure Communication
Serge Vaudenay, Andrea Felice Caforio, Daniel Patrick Collins, Hailun Yan
To mitigate state exposure threats to long-lived instant messaging sessions, ratcheting was introduced, which is used in practice in protocols like Signal. However, existing ratcheting protocols generally come with a high cost. Recently, Caforio et al. pro ...
OXFORD UNIV PRESS2022Attacks on some post-quantum cryptographic protocols: The case of the Legendre PRF and SIKE
Post-quantum cryptography is a branch of cryptography which deals with cryptographic algorithms whose hardness assumptions are not based on problems known to be solvable by a quantum computer, such as the RSA problem, factoring or discrete logarithms.This ...
EPFL2022PROFACTORY: Improving IoT Security via Formalized Protocol Customization
Mathias Josef Payer, Fei Wang, Duo Xu, Xiangyu Zhang
As IoT applications gain widespread adoption, it becomes important to design and implement IoT protocols with security. Existing research in protocol security reveals that the majority of disclosed protocol vulnerabilities are caused by incorrectly impleme ...
USENIX ASSOC2022Blockchain-based Practical Multi-agent Secure Comparison and its Application in Auctions
Boi Faltings, Sujit Prakash Gujar, Sankarshan Damle
AI applications find widespread use in a variety of domains. For further acceptance, mostly when multiple agents interact with the system, we must aim to preserve the privacy of participants information in such applications. Towards this, the Yao’s Million ...
ACM2022Moby: A Blackout-Resistant Anonymity Network for Mobile Devices
Bryan Alexander Ford, Antoine Rault, Amogh Pradeep, Hira Javaid
Internet blackouts are challenging environments for anonymity and censorship resistance. Existing popular anonymity networks (e.g., Freenet, I2P, Tor) rely on Internet connectivity to function, making them impracticable during such blackouts. In such a set ...
2022Efficient protocols for oblivious linear function evaluation from ring-LWE
An oblivious linear function evaluation protocol, or OLE, is a two-party protocol for the function f (x) = ax + b, where a sender inputs the field elements a, b, and a receiver inputs x and learns f (x). OLE can be used to build secret-shared multiplicatio ...
IOS PRESS2022Integrity and Metadata Protection in Data Retrieval
Secure retrieval of data requires integrity, confidentially, transparency, and metadata-privacy of the process. Existing protection mechanisms, however, provide only partially these properties: encryption schemes still expose cleartext metadata, protocols ...
EPFL2021Beyond Security and Efficiency: On-Demand Ratcheting with Security Awareness
Serge Vaudenay, Andrea Felice Caforio, Fatma Betül Durak
Secure asynchronous two-party communication applies ratcheting to strengthen privacy, in the presence of internal state exposures. Security with ratcheting is provided in two forms: forward security and post-compromise security. There have been several suc ...
2021