Secure and anonymous hybrid encryption from coding theory

DOI10.1007/978-3-642-38616-9_12MaRDI QIDQ4928596zbMATH OpenOpenAlexFDO

Authors 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)

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

Cited in

(11)

• Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
• Some (in)sufficient conditions for secure hybrid encryption
• Post-quantum cryptography: state of the art
• A General Cipher for Individual Data Anonymization
• Anonymous, robust post-quantum public key encryption
• Efficient implementation of hybrid encryption from coding theory
• CCA2 key-privacy for code-based encryption in the standard model
• A code-based hybrid signcryption scheme
• scientific article; zbMATH DE number 7639971 (Why is no real title available?)
• A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting
• DAGS: key encapsulation using dyadic GS codes

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)