Theory of Cryptography
From MaRDI portal
Publication:5898365
DOI10.1007/11681878zbMath1112.94025OpenAlexW3149533473WikidataQ57254512 ScholiaQ57254512MaRDI QIDQ5898365
Publication date: 12 February 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11681878
Related Items (20)
Modular verification of protocol equivalence in the presence of randomness ⋮ Reconciling non-malleability with homomorphic encryption ⋮ (Public) verifiability for composable protocols without adaptivity or zero-knowledge ⋮ The IITM model: a simple and expressive model for universal composability ⋮ Joint state composition theorems for public-key encryption and digital signature functionalities with local computation ⋮ The reactive simulatability (RSIM) framework for asynchronous systems ⋮ Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings ⋮ 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 ⋮ Cryptographic Protocol Composition via the Authentication Tests ⋮ On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography ⋮ Computationally sound implementations of equational theories against passive adversaries ⋮ Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols ⋮ Computationally Sound Symbolic Analysis of Probabilistic Protocols with Ideal Setups ⋮ Universally Composable Security Analysis of TLS ⋮ Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos ⋮ Limits of the BRSIM/UC Soundness of Dolev-Yao Models with Hashes ⋮ Limits of the Cryptographic Realization of Dolev-Yao-Style XOR ⋮ Soundness of Formal Encryption in the Presence of Key-Cycles
Uses Software
This page was built for publication: Theory of Cryptography
