Concept
Chosen-ciphertext attack
Related publications (76)
Attacks 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 ...
EPFL2022Efficient 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 PRESS2022Analysis of the BIKE post-quantum cryptographic protocols and the Legendre pseudorandom function
The field of post-quantum cryptography studies cryptographic systems that are secure against an adversary in possession of a quantum computer. In 2017, the National Institute of Standards and Technology (NIST) initiated a process to standardize quantum-res ...
EPFL2020Reenactment and Intangible Heritage Strategies for Embodiment and Transmission in Museums
Sarah Irene Brutton Kenderdine
This article is focused on the interplay of different forms of intangibility (living heritage and reenactment heritage) and the way technologically enabled practices might reshape the role and transformation of intangible cultural heritage (ICH) in museums ...
CENTRUM STUDIE DOCUMENTATIE2020Misuse Attacks on Post-quantum Cryptosystems
Serge Vaudenay, Loïs Evan Huguenin-Dumittan, Abdullah Talayhan, Fatma Betül Durak, Ciprian Baetu
Many post-quantum cryptosystems which have been proposed in the National Institute of Standards and Technology (NISI) standardization process follow the same meta-algorithm, but in different algebras or different encoding methods. They usually propose two ...
SPRINGER INTERNATIONAL PUBLISHING AG2019Cryptanalysis of ForkAES
Forkciphers are a new kind of primitive proposed recently by Andreeva et al. for efficient encryption and authentication of small messages. They fork the middle state of a cipher and encrypt it twice under two smaller independent permutations. Thus, forkci ...
2019Can Caesar Beat Galois?
The Competition for Authenticated Encryption: Security, Applicability and Robustness (CAESAR) has as its official goal to “identify a portfolio of authenticated ciphers that offer advantages over [the Galois-Counter Mode with AES]” and are suitable for wid ...
2018Provably 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 ...
EPFL2018Breaking the FF3 Format Preserving Encryption
Serge Vaudenay, Fatma Betül Durak
The NIST standard FF3 scheme (also known as BPS scheme) is a tweakable block cipher based on a 8-round Feistel Network. We break it with a practical attack. Our attack exploits the bad domain separation in FF3 design. The attack works with chosen plaintext ...
2017Multicloud Resource Allocation
Nowadays our daily life is not only powered by water, electricity, gas and telephony but by "cloud" as well. Big cloud vendors such as Amazon, Microsoft and Google have built large-scale centralized data centers to achieve economies of scale, on-demand res ...
EPFL2017