Sound computational interpretation of formal encryption with composed keys

DOI10.1007/978-3-540-24691-6_5MaRDI QIDQ5714151zbMATH OpenOpenAlexFDO

Authors Peeter Laud, Ricardo Corin

Publication date 27 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b96249, https://research.utwente.nl/en/publications/893f8242-c9a2-456e-a61c-1862d7705b22

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Reconciling two views of cryptography (the computational soundness of formal encryption)
• Reconciling two views of cryptography (The computational soundness of formal encryption)
• Advances in Cryptology - CRYPTO 2003
• Soundness of Formal Encryption in the Presence of Key-Cycles
• Completing the picture: Soundness of formal encryption in the presence of active adversaries

Cited in

(10)

• Computationally sound implementations of equational theories against passive adversaries
• Reconciling two views of cryptography (The computational soundness of formal encryption)
• Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings
• Rate-1 key-dependent message security via reusable homomorphic extractor against correlated-source attacks
• Reconciling two views of cryptography (the computational soundness of formal encryption)
• A survey of symbolic methods in computational analysis of cryptographic systems
• Advances in Cryptology - CRYPTO 2003
• Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
• Formal eavesdropping and its computational interpretation
• Soundness of Formal Encryption in the Presence of Key-Cycles

This page was built for publication: Sound computational interpretation of formal encryption with composed keys

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