Ralf Küsters

According to our database1, Ralf Küsters authored at least 124 papers between 1997 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
A Framework for Universally Composable Diffie-Hellman Key Exchange.
IACR Cryptology ePrint Archive, 2017

The Web SSO Standard OpenID Connect: In-Depth Formal Security Analysis and Security Guidelines.
CoRR, 2017

Cryptographic Security Analysis of E-voting Systems: Achievements, Misconceptions, and Limitations.
Proceedings of the Electronic Voting - Second International Joint Conference, 2017

A Framework for Universally Composable Diffie-Hellman Key Exchange.
Proceedings of the 2017 IEEE Symposium on Security and Privacy, 2017

The Web SSO Standard OpenID Connect: In-depth Formal Security Analysis and Security Guidelines.
Proceedings of the 30th IEEE Computer Security Foundations Symposium, 2017

2016
sElect: A Lightweight Verifiable Remote Voting System.
IACR Cryptology ePrint Archive, 2016

Verifiability Notions for E-Voting Protocols.
IACR Cryptology ePrint Archive, 2016

Universal Composition with Responsive Environments.
IACR Cryptology ePrint Archive, 2016

A Comprehensive Formal Security Analysis of OAuth 2.0.
CoRR, 2016

SoK: Verifiability Notions for E-Voting Protocols.
Proceedings of the IEEE Symposium on Security and Privacy, 2016

Security Analysis of Re-Encryption RPC Mix Nets.
Proceedings of the IEEE European Symposium on Security and Privacy, 2016

sElect: A Lightweight Verifiable Remote Voting System.
Proceedings of the IEEE 29th Computer Security Foundations Symposium, 2016

A Comprehensive Formal Security Analysis of OAuth 2.0.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

Universal Composition with Responsive Environments.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015
A Hybrid Approach for Proving Noninterference of Java Programs.
IACR Cryptology ePrint Archive, 2015

Security Analysis of Re-Encryption RPC Mix Nets.
IACR Cryptology ePrint Archive, 2015

SPRESSO: A Secure, Privacy-Respecting Single Sign-On System for the Web.
CoRR, 2015

Analyzing the BrowserID SSO System with Primary Identity Providers Using an Expressive Model of the Web.
Proceedings of the Computer Security - ESORICS 2015, 2015

A Hybrid Approach for Proving Noninterference of Java Programs.
Proceedings of the IEEE 28th Computer Security Foundations Symposium, 2015

SPRESSO: A Secure, Privacy-Respecting Single Sign-On System for the Web.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014
E-Voting Systems.
Proceedings of the Software Systems Safety, 2014

Security in e-voting.
it - Information Technology, 2014

Formal Analysis of Chaumian Mix Nets with Randomized Partial Checking.
IACR Cryptology ePrint Archive, 2014

Extending and Applying a Framework for the Cryptographic Verification of Java Programs.
IACR Cryptology ePrint Archive, 2014

Analyzing the BrowserID SSO System with Primary Identity Providers Using an Expressive Model of the Web.
CoRR, 2014

An Expressive Model for the Web Infrastructure: Definition and Application to the BrowserID SSO System.
CoRR, 2014

Formal Analysis of Chaumian Mix Nets with Randomized Partial Checking.
Proceedings of the 2014 IEEE Symposium on Security and Privacy, 2014

An Expressive Model for the Web Infrastructure: Definition and Application to the Browser ID SSO System.
Proceedings of the 2014 IEEE Symposium on Security and Privacy, 2014

Extending and Applying a Framework for the Cryptographic Verification of Java Programs.
Proceedings of the Principles of Security and Trust - Third International Conference, 2014

2013
The IITM Model: a Simple and Expressive Model for Universal Composability.
IACR Cryptology ePrint Archive, 2013

2012
A game-based definition of coercion resistance and its applications.
Journal of Computer Security, 2012

Clash Attacks on the Verifiability of E-Voting Systems.
IACR Cryptology ePrint Archive, 2012

A Framework for the Cryptographic Verification of Java-like Programs.
IACR Cryptology ePrint Archive, 2012

Clash Attacks on the Verifiability of E-Voting Systems.
Proceedings of the IEEE Symposium on Security and Privacy, 2012

A Framework for the Cryptographic Verification of Java-Like Programs.
Proceedings of the 25th IEEE Computer Security Foundations Symposium, 2012

2011
Reducing Protocol Analysis with XOR to the XOR-Free Case in the Horn Theory Based Approach.
J. Autom. Reasoning, 2011

Verifiability, Privacy, and Coercion-Resistance: New Insights from a Case Study.
IACR Cryptology ePrint Archive, 2011

Composition Theorems Without Pre-Established Session Identifiers.
IACR Cryptology ePrint Archive, 2011

Security and Rewriting (Dagstuhl Seminar 11332).
Dagstuhl Reports, 2011

What's in an Attribute? Consequences for the Least Common Subsumer
CoRR, 2011

Verifiability, Privacy, and Coercion-Resistance: New Insights from a Case Study.
Proceedings of the 32nd IEEE Symposium on Security and Privacy, 2011

Ideal Key Derivation and Encryption in Simulation-Based Security.
Proceedings of the Topics in Cryptology - CT-RSA 2011, 2011

Composition theorems without pre-established session identifiers.
Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

Moderne Kryptographie - Eine Einführung.
Vieweg + Teubner, ISBN: 978-3-519-00509-4, 2011

2010
Deciding strategy properties of contract-signing protocols.
ACM Trans. Comput. Log., 2010

Proving Coercion-Resistance of Scantegrity II.
IACR Cryptology ePrint Archive, 2010

Accountability: Definition and Relationship to Verifiability.
IACR Cryptology ePrint Archive, 2010

Ideal Key Derivation and Encryption in Simulation-based Security.
IACR Cryptology ePrint Archive, 2010

A Formal Definition of Online Abuse-Freeness.
Proceedings of the Security and Privacy in Communication Networks, 2010

Proving Coercion-Resistance of Scantegrity II.
Proceedings of the Information and Communications Security - 12th International Conference, 2010

A Game-Based Definition of Coercion-Resistance and Its Applications.
Proceedings of the 23rd IEEE Computer Security Foundations Symposium, 2010

Accountability: definition and relationship to verifiability.
Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010

2009
A Game-Based Definition of Coercion-Resistance and its Applications.
IACR Cryptology ePrint Archive, 2009

Computational Soundness for Key Exchange Protocols with Symmetric Encryption.
IACR Cryptology ePrint Archive, 2009

Universally Composable Symmetric Encryption.
IACR Cryptology ePrint Archive, 2009

An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols
CoRR, 2009

Improving and Simplifying a Variant of Prêt à Voter.
Proceedings of the E-Voting and Identity, Second International Conference, 2009

An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols.
Proceedings of the 30th IEEE Symposium on Security and Privacy (S&P 2009), 2009

Universally Composable Symmetric Encryption.
Proceedings of the 22nd IEEE Computer Security Foundations Symposium, 2009

Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation.
Proceedings of the 22nd IEEE Computer Security Foundations Symposium, 2009

Computational soundness for key exchange protocols with symmetric encryption.
Proceedings of the 2009 ACM Conference on Computer and Communications Security, 2009

2008
Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption.
ACM Trans. Comput. Log., 2008

On the Relationships between Notions of Simulation-Based Security.
J. Cryptology, 2008

Conditional reactive simulatability.
Int. J. Inf. Sec., 2008

Joint workshop on foundations of computer security and automated reasoning for security protocol analysis (FCS-ARSPA '06).
Inf. Comput., 2008

Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation.
IACR Cryptology ePrint Archive, 2008

Reducing Protocol Analysis with XOR to the XOR-free Case in the Horn Theory Based Approach
CoRR, 2008

Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation.
Proceedings of the 21st IEEE Computer Security Foundations Symposium, 2008

Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach.
Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008

2007
Transducer-based analysis of cryptographic protocols.
Inf. Comput., 2007

A Cryptographic Model for Branching Time Security Properties - the Case of Contract Signing Protocols.
IACR Cryptology ePrint Archive, 2007

On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography.
IACR Cryptology ePrint Archive, 2007

On the Automatic Analysis of Recursive Security Protocols with XOR.
Proceedings of the STACS 2007, 2007

Infinite State AMC-Model Checking for Cryptographic Protocols.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

A Cryptographic Model for Branching Time Security Properties - The Case of Contract Signing Protocols.
Proceedings of the Computer Security, 2007

Selecting theories and nonce generation for recursive protocols.
Proceedings of the 2007 ACM workshop on Formal methods in security engineering, 2007

2006
Simulation-Based Security with Inexhaustible Interactive Turing Machines.
IACR Cryptology ePrint Archive, 2006

On the Relationships Between Notions of Simulation-Based Security.
IACR Cryptology ePrint Archive, 2006

Computationally Sound Symbolic Secrecy in the Presence of Hash Functions.
IACR Cryptology ePrint Archive, 2006

Conditional Reactive Simulatability.
IACR Cryptology ePrint Archive, 2006

Implementing a Unification Algorithm for Protocol Analysis with XOR
CoRR, 2006

A Dolev-Yao-Based Definition of Abuse-Free Protocols.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Computationally Sound Symbolic Secrecy in the Presence of Hash Functions.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Conditional Reactive Simulatability.
Proceedings of the Computer Security, 2006

Simulation-Based Security with Inexhaustible Interactive Turing Machines.
Proceedings of the 19th IEEE Computer Security Foundations Workshop, 2006

2005
An NP decision procedure for protocol insecurity with XOR.
Theor. Comput. Sci., 2005

Structural Subsumption and Least Common Subsumers in a Description Logic with Existential and Number Restrictions.
Studia Logica, 2005

On the decidability of cryptographic protocols with open-ended data structures.
Int. J. Inf. Sec., 2005

Deciding the Security of Protocols with Commuting Public Key Encryption.
Electr. Notes Theor. Comput. Sci., 2005

On the Relationships Between Notions of Simulation-Based Security.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Deciding Properties of Contract-Signing Protocols.
Proceedings of the STACS 2005, 2005

Constraint Solving for Contract-Signing Protocols.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004
Automata-Based Analysis of Recursive Cryptographic Protocols.
Proceedings of the STACS 2004, 2004

2003
Extensions of Non-standard Inferences to Descriptions Logics with Transitive Roles.
Proceedings of the Logic for Programming, 2003

An NP Decision Procedure for Protocol Insecurity with XOR.
Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

Extensions to Description Logics.
Proceedings of the Description Logic Handbook: Theory, Implementation, and Applications, 2003

Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions.
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002
Approximating most specific concepts in description logics with existential restrictions.
AI Commun., 2002

Approximation and Difference in Description Logics.
Proceedings of the Eights International Conference on Principles and Knowledge Representation and Reasoning (KR-02), 2002

Deciding the First Level of the µ-Calculus Alternation Hierarchy.
Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

Approximating ALCN-Concept Descriptions.
Proceedings of the 2002 International Workshop on Description Logics (DL2002), 2002

Unification in a Description Logic with Inconsistency and Transitive Closure of Roles.
Proceedings of the 2002 International Workshop on Description Logics (DL2002), 2002

On the Decidability of Cryptographic Protocols with Open-Ended Data Structures.
Proceedings of the CONCUR 2002, 2002

2001
What's in an Attribute? Consequences for the Least Common Subsumer.
J. Artif. Intell. Res., 2001

Unification in a Description Logic with Transitive Closure of Roles.
Proceedings of the Logic for Programming, 2001

Approximating Most Specific Concepts in Description Logics with Existential Restrictions.
Proceedings of the KI 2001: Advances in Artificial Intelligence, 2001

Computing Least Common Subsumers in ALEN.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

Matching under Side Conditions in Description Logics.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

Unification in a Description Logic with Transitive Closure of Roles.
Proceedings of the Working Notes of the 2001 International Description Logics Workshop (DL-2001), 2001

Memoryless Determinacy of Parity Games.
Proceedings of the Automata, 2001

Non-Standard Inferences in Description Logics
Lecture Notes in Computer Science 2100, Springer, ISBN: 3-540-42397-4, 2001

2000
Rewriting Concepts Using Terminologies.
Proceedings of the KR 2000, 2000

Matching Concept Descriptions with Existential Restrictions.
Proceedings of the KR 2000, 2000

What's not in a name: Some Properties of a Purely Structural Approach to Integrating Large DL Knowledge Bases.
Proceedings of the 2000 International Workshop on Description Logics (DL2000), 2000

1999
Matching in Description Logics.
J. Log. Comput., 1999

Computing Least Common Subsumers in Description Logics with Existential Restrictions.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

Matching in Description Logics with Existential Restrictions.
Proceedings of the 1999 International Workshop on Description Logics (DL'99), Linköping, Sweden, July 30, 1999

1998
Characterizing the Semantics of Terminological Cycles in ALN Using Finite Automata.
Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), 1998

Computing the Least Common Subsumer and the Most Specific Concept in the Presence of Cyclic ALN-Concept Descriptions.
Proceedings of the KI-98: Advances in Artificial Intelligence, 1998

Structural Subsumption Considered from an Automata-Theoretic Point of View.
Proceedings of the 1998 International Workshop on Description Logics (DL'98), IRST, Povo, 1998

Least Common Subsumer Computation w.r.t. cyclic ALN-Terminologies.
Proceedings of the 1998 International Workshop on Description Logics (DL'98), IRST, Povo, 1998

1997
Characterizing the semantics of terminological cycles with the help of finite automata.
Proceedings of the 1997 International Workshop on Description Logics, 1997


  Loading...