A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
From MaRDI portal
Publication:3623048
DOI10.1007/978-3-642-00862-7_16zbMath1237.94060OpenAlexW1493476231MaRDI QIDQ3623048
Jörn Müller-Quade, Rafael Dowsley, Anderson C. A. Nascimento
Publication date: 29 April 2009
Published in: Topics in Cryptology – CT-RSA 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00862-7_16
Related Items (5)
Enhanced public key security for the McEliece cryptosystem ⋮ Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model ⋮ More constructions of lossy and correlation-secure trapdoor functions ⋮ Strongly secure authenticated key exchange from factoring, codes, and lattices ⋮ Code-Based Public-Key Cryptosystems and Their Applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semantic security for the McEliece cryptosystem without random oracles
- Probabilistic encryption
- Attacking and Defending the McEliece Cryptosystem
- Lossy trapdoor functions and their applications
- Parallel and Concurrent Security of the HB and HB + Protocols
- Secure Hybrid Encryption from Weakened Key Encapsulation
- On the inherent intractability of certain coding problems (Corresp.)
- 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
- Nonmalleable Cryptography
- Advances in Cryptology - EUROCRYPT 2004
- Chosen-Ciphertext Security via Correlated Products
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model