Concept
Sécurité inconditionnelle
Publications associées (67)
On Speed and Advantage : Results in Information Velocity and Monitoring Problems
Information theory has allowed us to determine the fundamental limit of various communication and algorithmic problems, e.g., the channel coding problem, the compression problem, and the hypothesis testing problem. In this work, we revisit the assumptions ...
EPFL2024On 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 ...
2023EOS: Efficient Private Delegation of zkSNARK Provers
Alessandro Chiesa, Yinuo Zhang
Succinct zero knowledge proofs (i.e. zkSNARKs) are powerful cryptographic tools that enable a prover to convince a verifier that a given statement is true without revealing any additional information. Their attractive privacy properties have led to much ac ...
Berkeley2023Private Message Franking with After Opening Privacy
Serge Vaudenay, Iraklis Leontiadis
Recently Grubbs et al. [GLR17] initiated the formal study of message franking protocols. This new type of service launched by Facebook, allows the receiver in a secure messaging application to verifiably report to a third party an abusive message some send ...
2023Multiparty Homomorphic Encryption: from Theory to Practice
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 extend ...
EPFL2023Secrecy by Design With Applications to Privacy and Compression
Secrecy by design is examined as an approach to information-theoretic secrecy. The main idea behind this approach is to design an information processing system from the ground up to be perfectly secure with respect to an explicit secrecy constraint. The pr ...
2021Towards Efficient LPN-Based Symmetric Encryption
Serge Vaudenay, Sonia Mihaela Bogos, Dario Korolija, Thomas Locher
Due to the rapidly growing number of devices that need to communicate securely, there is still significant interest in the development of efficient encryption schemes. It is important to maintain a portfolio of different constructions in order to enable a ...
Springer International Publishing2021Provably Secure Authenticated Encryption
Authenticated Encryption (AE) is a symmetric key cryptographic primitive that ensures confidentiality and authenticity of processed messages at the same time. The research
of AE as a primitive in its own right started in 2000.
The security goals of AE wer ...
EPFL2018Oblivious Dynamic Searchable Encryption on Distributed Cloud Systems
Dynamic Searchable Symmetric Encryption (DSSE) allows search/update operations over encrypted data via an encrypted index. However, DSSE has been shown to be vulnerable to statistical inference attacks, which can extract a significant amount of information ...
SPRINGER INTERNATIONAL PUBLISHING AG2018Secure numerical and logical multi party operations
We derive algorithms for efficient secure numerical and logical operations in the semi-honest model ensuring statistical or perfect security for secure multi-party computation (MPC). To derive our algorithms for trigonometric functions, we use basic mathem ...
Elsevier Science Bv2017