The following pages link to Theory of Cryptography (Q5901769):
Displaying 31 items.
- A survey of symbolic methods in computational analysis of cryptographic systems (Q540683) (← links)
- A computational interpretation of Dolev-Yao adversaries (Q557888) (← links)
- Computationally sound implementations of equational theories against passive adversaries (Q1013091) (← links)
- Analyzing security protocols using time-bounded task-PIOAs (Q1020557) (← links)
- Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings (Q1761600) (← links)
- Moving the bar on computationally sound exclusive-or (Q2148759) (← links)
- The RSA group is pseudo-free (Q2267366) (← links)
- Universally composable symbolic security analysis (Q2429708) (← links)
- The reactive simulatability (RSIM) framework for asynchronous systems (Q2464139) (← links)
- Sound and complete computational interpretation of symbolic hashes in the standard model (Q2481980) (← links)
- Unifying simulatability definitions in cryptographic systems under different timing assumptions (Q2484407) (← links)
- Logics for reasoning about cryptographic constructions (Q2490263) (← links)
- Models for an adversary-centric protocol logic (Q2841218) (← links)
- Explicit randomness is not necessary when modeling probabilistic encryption (Q2866728) (← links)
- Computational soundness of symbolic analysis for protocols using hash functions (Q2866733) (← links)
- Ideal Key Derivation and Encryption in Simulation-Based Security (Q3073705) (← links)
- (Q3384076) (← links)
- OAEP Is Secure under Key-Dependent Messages (Q3600394) (← links)
- Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption (Q3631375) (← links)
- Automating Computational Proofs for Public-Key-Based Key Exchange (Q4933211) (← links)
- Programming Languages and Systems (Q5316563) (← links)
- Towards Key-Dependent Message Security in the Standard Model (Q5458588) (← links)
- On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography (Q5458826) (← links)
- Computationally Sound Symbolic Analysis of Probabilistic Protocols with Ideal Setups (Q5505468) (← links)
- Automata, Languages and Programming (Q5716816) (← links)
- Formal Abstractions for Attested Execution Secure Processors (Q5738880) (← links)
- A Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol (Q5862307) (← 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)
