Semantic security for the McEliece cryptosystem without random oracles
From MaRDI portal
Publication:1009060
DOI10.1007/S10623-008-9175-9zbMATH Open1196.94062DBLPjournals/dcc/NojimaIKM08OpenAlexW2137648527WikidataQ59383161 ScholiaQ59383161MaRDI QIDQ1009060FDOQ1009060
Authors: Ryo Nojima, Kazukuni Kobara, Kirill E. Morozov, Hideki 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
Recommendations
- scientific article; zbMATH DE number 1618037
- On the construction of a semantically secure modification of the McEliece cryptosystem
- Semantic security and key-privacy with random split of St-Gen codes
- On the one-wayness against chosen-plaintext attacks of the Loidreau's modified McEliece PKC
- Enhanced public key security for the McEliece cryptosystem
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- Probabilistic encryption
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Secure integration of asymmetric and symmetric encryption schemes
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the inherent intractability of certain coding problems (Corresp.)
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Foundations of Cryptography
- Title not available (Why is that?)
- Title not available (Why is that?)
- Noise-tolerant learning, the parity problem, and the statistical query model
- Title not available (Why is that?)
- Title not available (Why is that?)
- Identity-based identification and signature schemes using error correcting codes
- On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
- Title not available (Why is that?)
- An efficient pseudo-random generator provably as secure as syndrome decoding
- A Summary of McEliece-Type Cryptosystems and their Security
- Parallel and Concurrent Security of the HB and HB + Protocols
- Is code equivalence easy to decide?
Cited In (30)
- Amount of key information contained in plain and encrypted text sets of the symmetric randomized McEliece cryptosystem
- On two modifications of the McEliece PKE and the CFS signature scheme
- Title not available (Why is that?)
- Weaknesses in two RFID authentication protocols
- Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
- Differential power analysis of a McEliece cryptosystem
- On the Key-Privacy Issue of McEliece Public-Key Encryption
- Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Oblivious Transfer Based on the McEliece Assumptions
- Title not available (Why is that?)
- Group encryption: full dynamicity, message filtering and code-based instantiation
- A rank metric code-based group signature scheme
- LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding
- Semantic security and key-privacy with random split of St-Gen codes
- CCA secure \textit{a posteriori} openable encryption in the standard model
- On the construction of a semantically secure modification of the McEliece cryptosystem
- A new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channels
- On IND-CCA1 security of randomized McEliece encryption in the standard model
- Short code-based one-out-of-many proofs and applications
- On the one-wayness against chosen-plaintext attacks of the Loidreau's modified McEliece PKC
- Code-based public-key cryptosystems and their applications
- Strongly secure authenticated key exchange from factoring, codes, and lattices
- On the Berger-Loidreau cryptosystem on the tensor product of codes
- How to backdoor (classic) McEliece and how to guard against backdoors
- A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
- DAGS: key encapsulation using dyadic GS codes
- Using low-density parity-check codes to improve the McEliece cryptosystem
- IND-CCA2 secure McEliece-type modification in the standard model
- Code-based secret handshake scheme, revisited
Uses Software
This page was built for publication: Semantic security for the McEliece cryptosystem without random oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009060)
