Semantic security for the McEliece cryptosystem without random oracles

DOI10.1007/s10623-008-9175-9zbMath1196.94062OpenAlexW2137648527WikidataQ59383161 ScholiaQ59383161MaRDI QIDQ1009060

Ryo Nojima, Kirill Morozov, Kazukuni Kobara, Hiroshi Imai

Publication date: 31 March 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-008-9175-9

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items

CCA secure \textit{a posteriori} openable encryption in the standard model ⋮ Semantic Security and Key-Privacy with Random Split of St-Gen Codes ⋮ IND-CCA2 secure McEliece-type modification in the standard model ⋮ Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model ⋮ A rank metric code-based group signature scheme ⋮ Using low-density parity-check codes to improve the McEliece cryptosystem ⋮ Weaknesses in Two RFID Authentication Protocols ⋮ How to backdoor (classic) McEliece and how to guard against backdoors ⋮ A new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channels ⋮ Amount of key information contained in plain and encrypted text sets of the symmetric randomized McEliece cryptosystem ⋮ On the Key-Privacy Issue of McEliece Public-Key Encryption ⋮ Strongly secure authenticated key exchange from factoring, codes, and lattices ⋮ ON THE CONSTRUCTION OF A SEMANTICALLY SECURE MODIFICATION OF THE MCELIECE CRYPTOSYSTEM ⋮ DAGS: key encapsulation using dyadic GS codes ⋮ Code-Based Public-Key Cryptosystems and Their Applications ⋮ Differential Power Analysis of a McEliece Cryptosystem ⋮ LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding ⋮ A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model ⋮ On the Berger - Loidreau Cryptosystem on the Tensor Product of Codes ⋮ Group encryption: full dynamicity, message filtering and code-based instantiation ⋮ Oblivious Transfer Based on the McEliece Assumptions

Uses Software

• McEliece

Cites Work

• Probabilistic encryption
• An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
• Parallel and Concurrent Security of the HB and HB +  Protocols
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A probabilistic algorithm for computing minimum weights of large error-correcting codes
• On the inherent intractability of certain coding problems (Corresp.)
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
• Foundations of Cryptography
• Is code equivalence easy to decide?
• A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• Weak keys in the McEliece public-key cryptosystem
• A Summary of McEliece-Type Cryptosystems and their Security
• Noise-tolerant learning, the parity problem, and the statistical query model
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item