Computational soundness, co-induction, and encryption cycles

DOI10.1007/978-3-642-13190-5_19MaRDI QIDQ3563845zbMATH OpenOpenAlexFDO

Authors Daniele Micciancio

Publication date 1 June 2010

Published in Advances in Cryptology – EUROCRYPT 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13190-5_19

zbMATH Keywords

co-inductioncomputational soundnessencryption cyclesformal methods for securitygreatest fixed pointssymbolic encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Computational soundness of coinductive symbolic security under active attacks
• Soundness of Formal Encryption in the Presence of Key-Cycles
• Computational soundness of indistinguishability properties without computable parsing
• Moving the bar on computationally sound exclusive-or
• Security proof with dishonest keys

Cited in

(4)

• Computational soundness of coinductive symbolic security under active attacks
• Soundness of Formal Encryption in the Presence of Key-Cycles
• SoK: learning with errors, circular security, and fully homomorphic encryption
• Circular insecure encryption: from long cycles to short cycles

This page was built for publication: Computational soundness, co-induction, and encryption cycles

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