The following pages link to Theory of Cryptography (Q5898365):
Displaying 25 items.
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols (Q511946) (← links)
- A survey of symbolic methods in computational analysis of cryptographic systems (Q540683) (← links)
- Computationally sound implementations of equational theories against passive adversaries (Q1013091) (← links)
- Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings (Q1761600) (← links)
- Modular verification of protocol equivalence in the presence of randomness (Q2167715) (← links)
- The IITM model: a simple and expressive model for universal composability (Q2210435) (← links)
- Joint state composition theorems for public-key encryption and digital signature functionalities with local computation (Q2210436) (← links)
- Symbolic analysis of identity-based protocols (Q2303367) (← links)
- Reconciling non-malleability with homomorphic encryption (Q2408582) (← links)
- Universally composable symbolic security analysis (Q2429708) (← links)
- The reactive simulatability (RSIM) framework for asynchronous systems (Q2464139) (← links)
- OAEP Is Secure under Key-Dependent Messages (Q3600394) (← links)
- Cryptographic Protocol Composition via the Authentication Tests (Q3617737) (← links)
- Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols (Q3631369) (← links)
- Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages (Q4916015) (← links)
- Automating Computational Proofs for Public-Key-Based Key Exchange (Q4933211) (← links)
- Universally Composable Symbolic Analysis for Two-Party Protocols Based on Homomorphic Encryption (Q5418723) (← links)
- On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography (Q5458826) (← links)
- Computationally Sound Symbolic Analysis of Probabilistic Protocols with Ideal Setups (Q5505468) (← links)
- Universally Composable Security Analysis of TLS (Q5505479) (← links)
- Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos (Q5862527) (← links)
- Limits of the BRSIM/UC Soundness of Dolev-Yao Models with Hashes (Q5862528) (← links)
- Limits of the Cryptographic Realization of Dolev-Yao-Style XOR (Q5862666) (← links)
- Soundness of Formal Encryption in the Presence of Key-Cycles (Q5862672) (← links)
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge (Q6173120) (← links)
