Reconciling two views of cryptography (The computational soundness of formal encryption)
From MaRDI portal
Publication:1601823
DOI10.1007/s00145-001-0014-7zbMath0994.68066OpenAlexW3031048092MaRDI QIDQ1601823
Publication date: 27 June 2002
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-001-0014-7
Related Items
Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol ⋮ On the semantics of Alice \& Bob specifications of security protocols ⋮ A game-theoretic framework for specification and verification of cryptographic protocols ⋮ Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later ⋮ KDM security for the Fujisaki-Okamoto transformations in the QROM ⋮ To know or not to know: Epistemic approaches to security protocol verification ⋮ Universally composable symbolic security analysis ⋮ New models and methods for estimating the cryptographic strength of information security systems ⋮ Unnamed Item ⋮ Cryptographic transformations of non-Shannon sources of information ⋮ An omniscience-free temporal logic of knowledge for verifying authentication protocols ⋮ The design and evolution of OCB ⋮ Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography ⋮ Sound and complete computational interpretation of symbolic hashes in the standard model ⋮ Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings ⋮ Formal Abstractions for Attested Execution Secure Processors ⋮ A survey of symbolic methods in computational analysis of cryptographic systems ⋮ Logics for reasoning about cryptographic constructions ⋮ The RSA group is pseudo-free ⋮ A computational interpretation of Dolev-Yao adversaries ⋮ The Layered Games Framework for Specifications and Analysis of Security Protocols ⋮ Probabilistic Functions and Cryptographic Oracles in Higher Order Logic ⋮ Measure Transformer Semantics for Bayesian Machine Learning ⋮ Towards Key-Dependent Message Security in the Standard Model ⋮ Formalisation of Bayesian concealment ⋮ Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols ⋮ Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption ⋮ Analyzing security protocols using time-bounded task-PIOAs ⋮ Soundness of Formal Encryption in the Presence of Key-Cycles
This page was built for publication: Reconciling two views of cryptography (The computational soundness of formal encryption)
