Programming Languages and Systems
From MaRDI portal
Publication:5316562
DOI10.1007/b107380zbMath1108.68454OpenAlexW4232919104MaRDI QIDQ5316562
Bogdan Warinschi, Véronique Cortier
Publication date: 13 September 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b107380
Related Items
Universally composable symbolic security analysis ⋮ A survey of symbolic methods in computational analysis of cryptographic systems ⋮ Automating Computational Proofs for Public-Key-Based Key Exchange ⋮ OAEP Is Secure under Key-Dependent Messages ⋮ On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography ⋮ Computationally sound implementations of equational theories against passive adversaries ⋮ Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption ⋮ Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos ⋮ Soundness of Formal Encryption in the Presence of Key-Cycles ⋮ Explicit Randomness is not Necessary when Modeling Probabilistic Encryption ⋮ Computational Soundness of Symbolic Analysis for Protocols Using Hash Functions
Uses Software
