The following pages link to Ralf Küsters (Q196898):
Displaying 38 items.
- Reducing protocol analysis with XOR to the XOR-free case in the Horn theory based approach (Q540685) (← links)
- An NP decision procedure for protocol insecurity with XOR (Q557799) (← links)
- Structural subsumption and least common subsumers in a description logic with existential and number restrictions (Q817690) (← links)
- On the relationships between notions of simulation-based security (Q1021241) (← links)
- A tutorial-style introduction to \(\mathsf{DY}^{\star}\) (Q2154012) (← links)
- Embedding the UC model into the IITM model (Q2170048) (← links)
- iUC: flexible universal composability made simple (Q2178853) (← 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)
- Transducer-based analysis of cryptographic protocols (Q2464141) (← links)
- Deciding the security of protocols with commuting public key encryption (Q2848035) (← links)
- Deciding strategy properties of contract-signing protocols (Q2946605) (← links)
- Universal Composition with Responsive Environments (Q2953797) (← links)
- Unification in a Description Logic with Transitive Closure of Roles (Q2996164) (← links)
- Ideal Key Derivation and Encryption in Simulation-Based Security (Q3073705) (← links)
- Moderne Kryptographie (Q3090068) (← links)
- (Q3408134) (← links)
- On the Automatic Analysis of Recursive Security Protocols with XOR (Q3590969) (← links)
- A Dolev-Yao-Based Definition of Abuse-Free Protocols (Q3591450) (← links)
- Matching in description logics (Q4260088) (← links)
- Memoryless Determinacy of Parity Games (Q4412829) (← links)
- (Q4415259) (← links)
- (Q4484508) (← links)
- (Q4781955) (← links)
- (Q4797451) (← links)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191511) (← links)
- Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption (Q5277813) (← links)
- Computer Science Logic (Q5292632) (← links)
- STACS 2004 (Q5309716) (← links)
- Computationally Sound Symbolic Secrecy in the Presence of Hash Functions (Q5385984) (← links)
- On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography (Q5458826) (← links)
- (Q5477943) (← links)
- STACS 2005 (Q5710671) (← links)
- Theory of Cryptography (Q5711659) (← links)
- Conditional Reactive Simulatability (Q5862529) (← links)
- CONCUR 2005 – Concurrency Theory (Q5897486) (← links)
- Non-standard inferences in description logics (Q5940719) (← links)
- Fully tally-hiding verifiable E-voting for real-world elections with seat-allocations (Q6550623) (← links)
