Theory of Cryptography

DOI10.1007/B106171zbMATH Open1079.68555OpenAlexW4251449056MaRDI QIDQ5711642FDOQ5711642

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

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

zbMATH Keywords

soundness theoremformal methods for security protocolsadaptive adversariesSymbolic encryption

Mathematics Subject Classification ID

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

Cited In (20)

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

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)