Advances in Cryptology - CRYPTO 2003

DOI10.1007/b11817zbMath1122.94376OpenAlexW2480001466WikidataQ56235047 ScholiaQ56235047MaRDI QIDQ5428140

Omer Horvitz, Virgil Gligor

Publication date: 28 November 2007

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

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

zbMATH Keywords

CryptographyCompletenessAuthenticationEncryptionFormal ReasoningWeak Key Authenticity

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Universally composable symbolic security analysis ⋮ Formal Abstractions for Attested Execution Secure Processors ⋮ A survey of symbolic methods in computational analysis of cryptographic systems ⋮ Computationally Sound Symbolic Analysis of Probabilistic Protocols with Ideal Setups ⋮ Soundness of Formal Encryption in the Presence of Key-Cycles

This page was built for publication: Advances in Cryptology - CRYPTO 2003