Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
From MaRDI portal
Recommendations
- Efficient constructions of deterministic encryption from hybrid encryption and code-based PKE
- Efficient implementation of hybrid encryption from coding theory
- Secure and anonymous hybrid encryption from coding theory
- Efficient chosen ciphertext secure key encapsulation mechanism in standard model over ideal lattices
- CCA2 key-privacy for code-based encryption in the standard model
- Secure hybrid encryption in the standard model from hard learning problems
- A provable secure multivariate encryption scheme in standard model
- Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
- Efficient Certificate-Based Encryption in the Standard Model
- Resisting randomness subversion: fast deterministic and hedged public-key encryption in the standard model
Cites work
- A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
- A Distinguisher for High-Rate McEliece Cryptosystems
- A New Randomness Extraction Paradigm for Hybrid Encryption
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
- A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order
- Advances in cryptology -- CRYPTO 2007. 27th annual international cryptology conference, Santa Barbara, CA, USA, August 19--23, 2007. Proceedings
- Advances in cryptology -- CRYPTO 2008. 28th annual international cryptology conference, Santa Barbara, CA, USA, August 17--21, 2008. Proceedings
- Advances in Cryptology – CRYPTO 2004
- Algebraic cryptanalysis of McEliece variants with compact keys
- An Efficient IND-CCA2 Secure Variant of the Niederreiter Encryption Scheme in the Standard Model
- Attacking and Defending the McEliece Cryptosystem
- Broadcast attacks against code-based schemes
- Chosen-Ciphertext Security via Correlated Products
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Deterministic and Efficiently Searchable Encryption
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Efficient constructions of deterministic encryption from hybrid encryption and code-based PKE
- Efficient lattice (H)IBE in the standard model
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- scientific article; zbMATH DE number 799789 (Why is no real title available?)
- Lossy trapdoor functions and their applications
- More constructions of lossy and correlation-secure trapdoor functions
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Secure and anonymous hybrid encryption from coding theory
- Secure Hybrid Encryption from Weakened Key Encapsulation
- Secure integration of asymmetric and symmetric encryption schemes
- Security bounds for the design of code-based cryptosystems
- Semantic security for the McEliece cryptosystem without random oracles
- The algebraic decoding of Goppa codes
- The random oracle methodology, revisited.
- Using hash functions as a hedge against chosen ciphertext attack
Cited in
(9)- CCA2 key-privacy for code-based encryption in the standard model
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
- Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
- Efficient constructions of deterministic encryption from hybrid encryption and code-based PKE
- Secure and anonymous hybrid encryption from coding theory
- Efficient chosen ciphertext secure key encapsulation mechanism in standard model over ideal lattices
- Efficient Encryption From Random Quasi-Cyclic Codes
- Efficient implementation of hybrid encryption from coding theory
- A code-based hybrid signcryption scheme
This page was built for publication: Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3195263)
