Theory of Cryptography

DOI10.1007/B106171MaRDI QIDQ5711642zbMATH OpenOpenAlexFDO

Authors Daniele Micciancio, Saurabh Panjwani

Publication date 7 December 2005

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

Full work available at URL https://doi.org/10.1007/b106171

zbMATH Keywords

soundness theoremformal methods for security protocolsadaptive adversariesSymbolic encryption

Mathematics Subject Classification ID

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

Recommendations

• Tackling Adaptive Corruptions in Multicast Encryption Protocols
• Security proof with dishonest keys
• Computational soundness of coinductive symbolic security under active attacks
• Universally composable symbolic security analysis
• A survey of symbolic methods in computational analysis of cryptographic systems

Cited in

(20)

• Handling adaptive compromise for practical encryption schemes
• Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption
• A survey of symbolic methods in computational analysis of cryptographic systems
• Degrees of security: protocol guarantees in the face of compromising adversaries
• Logics for reasoning about cryptographic constructions
• Security proof with dishonest keys
• Universally composable symbolic security analysis
• Explicit randomness is not necessary when modeling probabilistic encryption
• Towards symbolic encryption schemes
• Adaptive Witness Encryption and Asymmetric Password-Based Cryptography
• Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption
• Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings
• Theory of Cryptography
• Tackling Adaptive Corruptions in Multicast Encryption Protocols
• Soundness of Formal Encryption in the Presence of Key-Cycles
• Computationally Sound Symbolic Analysis of Probabilistic Protocols with Ideal Setups
• Computational soundness of coinductive symbolic security under active attacks
• The RSA group is pseudo-free
• Sound and complete computational interpretation of symbolic hashes in the standard model
• Moving the bar on computationally sound exclusive-or

This page was built for publication: Theory of Cryptography

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