Efficient constructions of deterministic encryption from hybrid encryption and code-based PKE

DOI10.1007/978-3-642-02181-7_17MaRDI QIDQ3656823zbMATH OpenOpenAlexFDO

Authors Yang Cui, Kirill E. Morozov, Kazukuni Kobara, Hideki Imai

Publication date 14 January 2010

Published in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02181-7_17

zbMATH Keywords

searchable encryptiondatabase securitydeterministic encryptionhybrid encryptioncode-based encryption

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
• Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
• Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
• A generic construction of CCA-secure deterministic encryption
• Incremental deterministic public-key encryption

Cited in

(5)

• Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
• A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
• A generic construction of CCA-secure deterministic encryption
• Generic constructions of integrated PKE and PEKS
• Achieving Chosen Ciphertext Security from Detectable Public Key Encryption Efficiently via Hybrid Encryption

This page was built for publication: Efficient constructions of deterministic encryption from hybrid encryption and code-based PKE

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3656823)