Optimal Symmetric Ratcheting for Secure Communication

Related publications (31)

About
Privacy
Disclaimer

Graph Chatbot

Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal

We propose a 2-round blind signature protocol based on the random oracle heuristic and the hardness of standard lattice problems (Ring/Module-SIS/LWE and NTRU) with a signature size of 22 KB. The protocol is round-optimal and has a transcript size that can ...

Assoc Computing Machinery2023

Multiparty Homomorphic Encryption: from Theory to Practice

Christian Vincent Mouchet

Multiparty homomorphic encryption (MHE) enables a group of parties to encrypt data in a way that (i) enables the evaluation of functions directly over its ciphertexts and (ii) enforces a joint cryptographic access-control over the underlying data. By exten ...

EPFL2023

On Quantum Secure Compressing Pseudorandom Functions

Ritam Bhaumik

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 ...

2023

On the (Im)possibility of Commitment over Gaussian Unfair Noisy Channels

Commitment is a key primitive which resides at the heart of several cryptographic protocols. Noisy channels can help realize information-theoretically secure commitment schemes; however, their imprecise statistical characterization can severely impair such ...

2023

Modelling and design of CMOS SPAD sensors for quantum random number generation

Pouyan Keshavarzian

Modern digital connectivity has necessitated the creation of robust methods for securely storing and transferring data. At the heart of all security infrastructure is the random number generator (RNG). While random numbers find use in a variety of applicat ...

EPFL2023

PROFACTORY: 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 ASSOC2022

Analysis and Improvements of the Sender Keys Protocol for Group Messaging

Daniel Patrick Collins

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 ...

2022

Attacks on some post-quantum cryptographic protocols: The case of the Legendre PRF and SIKE

Novak Kaluderovic

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 ...

EPFL2022

Moby: 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 ...

2022

Blockchain-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 ...

ACM2022

Page 3 of 4