Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
From MaRDI portal
Publication:3195263
DOI10.1007/978-3-319-12160-4_31zbMath1445.94027OpenAlexW306849829MaRDI QIDQ3195263
C. Pandu Rangan, K. Preetha Mathew, Sachin Vasant
Publication date: 16 October 2015
Published in: Information Security and Cryptology -- ICISC 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-12160-4_31
standard modelsyndrome decodingdeterministic encryptioncode indistinguishabilityKEM-DEMNeiderreiter cryptosystem
Related Items (1)
Cites Work
- Advances in cryptology -- CRYPTO 2008. 28th annual international cryptology conference, Santa Barbara, CA, USA, August 17--21, 2008. Proceedings
- Semantic security for the McEliece cryptosystem without random oracles
- Advances in cryptology -- CRYPTO 2007. 27th annual international cryptology conference, Santa Barbara, CA, USA, August 19--23, 2007. Proceedings
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
- An Efficient IND-CCA2 Secure Variant of the Niederreiter Encryption Scheme in the Standard Model
- Broadcast Attacks against Code-Based Schemes
- The random oracle methodology, revisited
- Attacking and Defending the McEliece Cryptosystem
- Lossy trapdoor functions and their applications
- More Constructions of Lossy and Correlation-Secure Trapdoor Functions
- Algebraic Cryptanalysis of McEliece Variants with Compact Keys
- Efficient Lattice (H)IBE in the Standard Model
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Chosen-Ciphertext Security via Correlated Products
- Deterministic and Efficiently Searchable Encryption
- Secure Hybrid Encryption from Weakened Key Encapsulation
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
- A New Randomness Extraction Paradigm for Hybrid Encryption
- Security Bounds for the Design of Code-Based Cryptosystems
- Efficient Constructions of Deterministic Encryption from Hybrid Encryption and Code-Based PKE
- The algebraic decoding of Goppa codes
- A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Secure and Anonymous Hybrid Encryption from Coding Theory
- Secure integration of asymmetric and symmetric encryption schemes
- Advances in Cryptology – CRYPTO 2004
- A Distinguisher for High-Rate McEliece Cryptosystems
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
