Identification Schemes from Key Encapsulation Mechanisms
We propose a generic way for deriving an identification (ID) scheme secure against concurrent man-in-the-middle attacks from a key encapsulation mechanism (KEM) secure against chosen ciphertext attacks on one-wayness (oneway-CCA). Then we give a concrete one-way-CCA secure KEM based on the Computational Diffie-Hellman (CDH) assumption.
ANADA, Hiroaki, ARITA, Seiko
openaire +1 more source
Roulette: A Diverse Family of Feasible Fault Attacks on Masked Kyber
At Indocrypt 2021, Hermelink, Pessl, and Pöppelmann presented a fault attack against Kyber in which a system of linear inequalities over the private key is generated and solved.
Jeroen Delvaux
doaj +3 more sources
Hybrid post-quantum Transport Layer Security formal analysis in Maude-NPA and its parallel version [PDF]
This article presents a security formal analysis of the hybrid post-quantum Transport Layer Security (TLS) protocol, a quantum-resistant version of the TLS protocol proposed by Amazon Web Services as a precaution in dealing with future attacks from ...
Duong Dinh Tran +3 more
doaj +2 more sources
Scabbard: a suite of efficient learning with rounding key-encapsulation mechanisms
In this paper, we introduce Scabbard, a suite of post-quantum keyencapsulation mechanisms. Our suite contains three different schemes Florete, Espada, and Sable based on the hardness of module- or ring-learning with rounding problem. In this work, we first show how the latest advancements on lattice-based cryptographycan be utilized to create new ...
Bermudo Mera, Jose Maria +3 more
openaire +5 more sources
Racing BIKE: Improved Polynomial Multiplication and Inversion in Hardware
BIKE is a Key Encapsulation Mechanism selected as an alternate candidate in NIST’s PQC standardization process, in which performance plays a significant role in the third round.
Jan Richter-Brockmann +3 more
doaj +1 more source
Stateful KEM: Towards Optimal Robust Combiner for Key Encapsulation Mechanism [PDF]
A $(1,n)$-robust combiner combines $n$ cryptography primitives to construct a new primitive of the same type, and guarantees that if any of the ingredient primitive is secure, then the resulting primitive is secure.
Ee-Chien Chang +4 more
core
Homomorphic-Policy Attribute-Based Key Encapsulation Mechanisms [PDF]
Attribute-Based Encryption (ABE) allows to target the recipients of a message according to a policy expressed as a predicate among some attributes. Ciphertext-policy ABE schemes can choose the policy at the encryption time.In this paper, we define a new property for ABE: homomorphic-policy.
Chotard, Jérémy +2 more
openaire +5 more sources
Analysis of the FO Transformation in the Lattice-Based Post-Quantum Algorithms
Newer variants of the Fujisaki–Okamoto transformation are used in most candidates of the third round of the NIST Post-Quantum Cryptography standardization call in the category of public key encryption schemes.
Miguel Ángel González de la Torre +2 more
doaj +1 more source
Intrinsically disordered CsoS2 acts as a general molecular thread for α-carboxysome shell assembly
Carboxysomes are a paradigm of self-assembling proteinaceous organelles found in nature, offering compartmentalisation of enzymes and pathways to enhance carbon fixation.
Tao Ni +10 more
doaj +1 more source
Comparison of security arguments of promising key encapsulation mechanisms
The study of key encapsulation mechanisms on algebraic lattices is one of the important directions in modern post-quantum cryptography, since many mechanisms are already either standardized (ANSI X.9.98, DSTU 8961:2019 "Skelya") or are promising candidates for standardization (CRYSTALS-Kyber, FrodoKEM).
Yu.I. Gorbenko, S.O. Kandii
openaire +3 more sources

