Secure and anonymous hybrid encryption from coding theory

DOI10.1007/978-3-642-38616-9_12zbMATH Open1306.94085OpenAlexW2130572351MaRDI QIDQ4928596FDOQ4928596

Edoardo Persichetti

Publication date: 14 June 2013

Published in: Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38616-9_12

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cited In (10)

• Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
• Efficient Implementation of Hybrid Encryption from Coding Theory
• Some (in)sufficient conditions for secure hybrid encryption
• A General Cipher for Individual Data Anonymization
• Anonymous, robust post-quantum public key encryption
• Post-Quantum Cryptography: State of the Art
• A code-based hybrid signcryption scheme
• Title not available (Why is that?)
• A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting
• DAGS: key encapsulation using dyadic GS codes

   Recommendations

• A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting 👍 👎
• CCA2 key-privacy for code-based encryption in the standard model 👍 👎
• Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model 👍 👎
• Efficient Implementation of Hybrid Encryption from Coding Theory 👍 👎
• An Efficient IND-CCA2 Secure Variant of the Niederreiter Encryption Scheme in the Standard Model 👍 👎

This page was built for publication: Secure and anonymous hybrid encryption from coding theory

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