Theory of Cryptography

DOI10.1007/b106171zbMath1079.68555OpenAlexW4251449056WikidataQ59379672 ScholiaQ59379672MaRDI QIDQ5711642

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

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

Related Items

Universally composable symbolic security analysis ⋮ Sound and complete computational interpretation of symbolic hashes in the standard model ⋮ A survey of symbolic methods in computational analysis of cryptographic systems ⋮ Logics for reasoning about cryptographic constructions ⋮ The RSA group is pseudo-free ⋮ Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption ⋮ Soundness of Formal Encryption in the Presence of Key-Cycles