Pages that link to "Item:Q1601823"
From MaRDI portal
The following pages link to Reconciling two views of cryptography (The computational soundness of formal encryption) (Q1601823):
Displaying 28 items.
- Cryptographic transformations of non-Shannon sources of information (Q466350) (← links)
- A survey of symbolic methods in computational analysis of cryptographic systems (Q540683) (← links)
- A computational interpretation of Dolev-Yao adversaries (Q557888) (← links)
- A game-theoretic framework for specification and verification of cryptographic protocols (Q607405) (← links)
- To know or not to know: Epistemic approaches to security protocol verification (Q625717) (← links)
- On the semantics of Alice \& Bob specifications of security protocols (Q860900) (← links)
- Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography (Q953531) (← links)
- Analyzing security protocols using time-bounded task-PIOAs (Q1020557) (← links)
- New models and methods for estimating the cryptographic strength of information security systems (Q1699416) (← links)
- An omniscience-free temporal logic of knowledge for verifying authentication protocols (Q1734134) (← links)
- Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings (Q1761600) (← links)
- The design and evolution of OCB (Q1983331) (← links)
- Formalisation of Bayesian concealment (Q2044153) (← links)
- The RSA group is pseudo-free (Q2267366) (← links)
- Universally composable symbolic security analysis (Q2429708) (← links)
- Sound and complete computational interpretation of symbolic hashes in the standard model (Q2481980) (← links)
- Logics for reasoning about cryptographic constructions (Q2490263) (← links)
- Probabilistic Functions and Cryptographic Oracles in Higher Order Logic (Q2802495) (← links)
- Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later (Q2945721) (← links)
- Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol (Q3178248) (← links)
- (Q3384076) (← links)
- Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols (Q3631369) (← links)
- Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption (Q3631375) (← links)
- The Layered Games Framework for Specifications and Analysis of Security Protocols (Q5445502) (← links)
- Towards Key-Dependent Message Security in the Standard Model (Q5458588) (← links)
- Formal Abstractions for Attested Execution Secure Processors (Q5738880) (← links)
- Soundness of Formal Encryption in the Presence of Key-Cycles (Q5862672) (← links)
- Measure Transformer Semantics for Bayesian Machine Learning (Q5892490) (← links)