The following pages link to Steve Kremer (Q437023):
Displayed 36 items.
- Reducing equational theories for the decision of static equivalence (Q437026) (← links)
- Computing knowledge in security protocols under convergent equational theories (Q437033) (← links)
- A survey of symbolic methods in computational analysis of cryptographic systems (Q540683) (← links)
- Formal analysis of multiparty contract signing (Q861699) (← links)
- Juggling with pattern matching (Q864953) (← links)
- Computationally sound implementations of equational theories against passive adversaries (Q1013091) (← links)
- The Hitchhiker's guide to decidability and complexity of equivalence properties in security protocols (Q2037996) (← links)
- When are three voters enough for privacy properties? (Q2165487) (← links)
- Composition of password-based protocols (Q2248082) (← links)
- (Q2762894) (← links)
- Automated Verification of Equivalence Properties of Cryptographic Protocols (Q2892723) (← links)
- Security Protocols, Constraint Systems, and Group Theories (Q2908488) (← links)
- (Q2911625) (← links)
- (Q2920124) (← links)
- Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols (Q3304811) (← links)
- On Communication Models When Verifying Equivalence Properties (Q3304813) (← links)
- Proving Group Protocols Secure Against Eavesdroppers (Q3541693) (← links)
- Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster (Q3569110) (← links)
- Reducing Equational Theories for the Decision of Static Equivalence (Q3656844) (← links)
- (Q4413343) (← links)
- (Q4448415) (← links)
- (Q4788571) (← links)
- (Q4791273) (← links)
- Dynamic Tags for Security Protocols (Q4979449) (← links)
- Universal Equivalence and Majority of Probabilistic Programs over Finite Fields (Q5056363) (← links)
- Universal equivalence and majority of probabilistic programs over finite fields (Q5145628) (← links)
- Computing Knowledge in Security Protocols under Convergent Equational Theories (Q5191113) (← links)
- Automated Verification of Equivalence Properties of Cryptographic Protocols (Q5278194) (← links)
- Programming Languages and Systems (Q5316564) (← links)
- Practical Everlasting Privacy (Q5326751) (← links)
- Computationally Sound Symbolic Secrecy in the Presence of Hash Functions (Q5385984) (← links)
- Symbolic Bisimulation for the Applied Pi Calculus (Q5458829) (← links)
- From One Session to Many: Dynamic Tags for Security Protocols (Q5505548) (← links)
- Financial Cryptography and Data Security (Q5712254) (← links)
- Information Security and Cryptology - ICISC 2003 (Q5714150) (← links)
- Automata, Languages and Programming (Q5716816) (← links)