Ralf Küsters

Tim Würtele

IACR Cryptol. ePrint Arch., 2024

PrivatEyes: Appearance-based Gaze Estimation Using Federated Secure Multi-Party Computation.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Convolutions in Overdrive: Maliciously Secure Convolutions for MPC.

[BibT_eX]

[DOI]

Proc. Priv. Enhancing Technol., July, 2023

Fully Tally-Hiding Verifiable E-Voting for Real-World Elections with Seat-Allocations.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

The Grant Negotiation and Authorization Protocol: Attacking, Fixing, and Verifying an Emerging Standard.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Multipars: Reduced-Communication MPC over Z2k.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Overdrive LowGear 2.0: Reduced-Bandwidth MPC without Sacrifice.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Accountable Bulletin Boards: Definition and Provably Secure Implementation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Layered Symbolic Security Analysis in DY$^\star$.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Layered Symbolic Security Analysis in $\textsf {DY}^\star $.

[BibT_eX]

[DOI]

Proceedings of the Computer Security - ESORICS 2023, 2023

Overdrive LowGear 2.0: Reduced-Bandwidth MPC without Sacrifice.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security, 2023

2022

Publicly Accountable Robust Multi-Party Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Arithmetic Tuples for MPC.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Embedding the UC Model into the IITM Model.

[BibT_eX]

[DOI]

Céline Chevalier

IACR Cryptol. ePrint Arch., 2022

Kryvos: Publicly Tally-Hiding Verifiable E-Voting.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

AUC: Accountable Universal Composability.

[BibT_eX]

[DOI]

Mike Graf

IACR Cryptol. ePrint Arch., 2022

Recent Developments in the Context of Online Elections and Digital Polls in Germany.

[BibT_eX]

[DOI]

Proceedings of the Sicherheit, 2022

Federated Learning for Appearance-based Gaze Estimation in the Wild.

[BibT_eX]

[DOI]

Proceedings of The 1st Gaze Meets ML workshop, 2022

Intelligent Methods for Test and Reliability.

[BibT_eX]

[DOI]

Proceedings of the 2022 Design, Automation & Test in Europe Conference & Exhibition, 2022

2021

Extending the Tally-Hiding Ordinos System: Implementations for Borda, Hare-Niemeyer, Condorcet, and Instant-Runoff Voting.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

A Security Framework for Distributed Ledgers.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

A Formal Security Analysis of the W3C Web Payment APIs: Attacks and Verification.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

An In-Depth Symbolic Security Analysis of the ACME Standard.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

DY*: A Modular Symbolic Verification Framework for Executable Cryptographic Protocol Code.

[BibT_eX]

[DOI]

Proceedings of the IEEE European Symposium on Security and Privacy, 2021

A Tutorial-Style Introduction to DY*.

[BibT_eX]

[DOI]

Proceedings of the Protocols, Strands, and Logic, 2021

2020

Joint State Composition Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation.

[BibT_eX]

[DOI]

J. Cryptol., 2020

The IITM Model: A Simple and Expressive Model for Universal Composability.

[BibT_eX]

[DOI]

J. Cryptol., 2020

Accountability in a Permissioned Blockchain: Formal Analysis of Hyperledger Fabric.

[BibT_eX]

[DOI]

Mike Simon

IACR Cryptol. ePrint Arch., 2020

Ordinos: A Verifiable Tally-Hiding E-Voting System.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

2019

iUC: Flexible Universal Composability Made Simple.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Practical Yet Composably Secure Cryptographic Protocols (Dagstuhl Seminar 19042).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2019

An Extensive Formal Security Analysis of the OpenID Financial-Grade API.

[BibT_eX]

[DOI]

Pedram Hosseyni

Proceedings of the 2019 IEEE Symposium on Security and Privacy, 2019

2017

A Framework for Universally Composable Diffie-Hellman Key Exchange.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Cryptographic Security Analysis of E-voting Systems: Achievements, Misconceptions, and Limitations.

[BibT_eX]

[DOI]

Johannes Müller

Proceedings of the Electronic Voting - Second International Joint Conference, 2017

The Web SSO Standard OpenID Connect: In-depth Formal Security Analysis and Security Guidelines.

[BibT_eX]

[DOI]

Proceedings of the 30th IEEE Computer Security Foundations Symposium, 2017

2016

sElect: A Lightweight Verifiable Remote Voting System.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Verifiability Notions for E-Voting Protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Universal Composition with Responsive Environments.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

SoK: Verifiability Notions for E-Voting Protocols.

[BibT_eX]

[DOI]

Proceedings of the IEEE Symposium on Security and Privacy, 2016

A Comprehensive Formal Security Analysis of OAuth 2.0.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015

A Hybrid Approach for Proving Noninterference of Java Programs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Security Analysis of Re-Encryption RPC Mix Nets.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

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

[BibT_eX]

[DOI]

Proceedings of the Computer Security - ESORICS 2015, 2015

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

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014

E-Voting Systems.

[BibT_eX]

[DOI]

Proceedings of the Software Systems Safety, 2014

Security in e-voting.

[BibT_eX]

[DOI]

it Inf. Technol., 2014

Formal Analysis of Chaumian Mix Nets with Randomized Partial Checking.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Extending and Applying a Framework for the Cryptographic Verification of Java Programs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

An Expressive Model for the Web Infrastructure: Definition and Application to the Browser ID SSO System.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Symposium on Security and Privacy, 2014

2013

The IITM Model: a Simple and Expressive Model for Universal Composability.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

2012

Clash Attacks on the Verifiability of E-Voting Systems.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

A Framework for the Cryptographic Verification of Java-like Programs.

[BibT_eX]

[DOI]

Juergen Graf

IACR Cryptol. ePrint Arch., 2012

2011

Reducing Protocol Analysis with XOR to the XOR-Free Case in the Horn Theory Based Approach.

[BibT_eX]

[DOI]

J. Autom. Reason., 2011

Verifiability, Privacy, and Coercion-Resistance: New Insights from a Case Study.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Composition Theorems Without Pre-Established Session Identifiers.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Security and Rewriting (Dagstuhl Seminar 11332).

[BibT_eX]

[DOI]

Hubert Comon-Lundh

Catherine Meadows

Dagstuhl Reports, 2011

Moderne Kryptographie - Eine Einführung.

[BibT_eX]

Vieweg + Teubner, ISBN: 978-3-519-00509-4, 2011

2010

Deciding strategy properties of contract-signing protocols.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2010

Proving Coercion-Resistance of Scantegrity II.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Accountability: Definition and Relationship to Verifiability.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Ideal Key Derivation and Encryption in Simulation-based Security.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

A Formal Definition of Online Abuse-Freeness.

[BibT_eX]

[DOI]

Henning Schnoor

Proceedings of the Security and Privacy in Communication Networks, 2010

2009

A Game-Based Definition of Coercion-Resistance and its Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Computational Soundness for Key Exchange Protocols with Symmetric Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Universally Composable Symmetric Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Improving and Simplifying a Variant of Prêt à Voter.

[BibT_eX]

[DOI]

Proceedings of the E-Voting and Identity, Second International Conference, 2009

An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols.

[BibT_eX]

[DOI]

Proceedings of the 30th IEEE Symposium on Security and Privacy (SP 2009), 2009

Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation.

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE Computer Security Foundations Symposium, 2009

2008

Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2008

On the Relationships between Notions of Simulation-Based Security.

[BibT_eX]

[DOI]

J. Cryptol., 2008

Conditional reactive simulatability.

[BibT_eX]

[DOI]

Int. J. Inf. Sec., 2008

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

[BibT_eX]

[DOI]

Inf. Comput., 2008

Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

2007

Transducer-based analysis of cryptographic protocols.

[BibT_eX]

[DOI]

Inf. Comput., 2007

A Cryptographic Model for Branching Time Security Properties - the Case of Contract Signing Protocols.

[BibT_eX]

[DOI]

Véronique Cortier

Bogdan Warinschi

IACR Cryptol. ePrint Arch., 2007

On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography.

[BibT_eX]

[DOI]

Michael Backes

Markus Dürmuth

IACR Cryptol. ePrint Arch., 2007

On the Automatic Analysis of Recursive Security Protocols with XOR.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

Infinite State AMC-Model Checking for Cryptographic Protocols.

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Selecting theories and nonce generation for recursive protocols.

[BibT_eX]

[DOI]

Klaas Ole Kürtz

Proceedings of the 2007 ACM workshop on Formal methods in security engineering, 2007

2006

Simulation-Based Security with Inexhaustible Interactive Turing Machines.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2006

Computationally Sound Symbolic Secrecy in the Presence of Hash Functions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2006

Implementing a Unification Algorithm for Protocol Analysis with XOR

[BibT_eX]

[DOI]

Mathieu Turuani

CoRR, 2006

A Dolev-Yao-Based Definition of Abuse-Free Protocols.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

An NP decision procedure for protocol insecurity with XOR.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Structural Subsumption and Least Common Subsumers in a Description Logic with Existential and Number Restrictions.

[BibT_eX]

[DOI]

Stud Logica, 2005

On the decidability of cryptographic protocols with open-ended data structures.

[BibT_eX]

[DOI]

Int. J. Inf. Sec., 2005

Deciding Properties of Contract-Signing Protocols.

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

Constraint Solving for Contract-Signing Protocols.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004

Deciding the Security of Protocols with Commuting Public Key Encryption.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Automated Reasoning for Security Protocol Analysis, 2004

Automata-Based Analysis of Recursive Cryptographic Protocols.

[BibT_eX]

[DOI]

Proceedings of the STACS 2004, 2004

2003

Extensions of Non-standard Inferences to Descriptions Logics with Transitive Roles.

[BibT_eX]

[DOI]

Anni-Yasmin Turhan

Proceedings of the Logic for Programming, 2003

Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents.

[BibT_eX]

[DOI]

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

Extensions to Description Logics.

[BibT_eX]

Frank Wolter

Proceedings of the Description Logic Handbook: Theory, Implementation, and Applications, 2003

Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002

Approximating most specific concepts in description logics with existential restrictions.

[BibT_eX]

[DOI]

AI Commun., 2002

Approximation and Difference in Description Logics.

[BibT_eX]

Anni-Yasmin Turhan

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.

[BibT_eX]

[DOI]

Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

Approximating ALCN-Concept Descriptions.

[BibT_eX]

[DOI]

Anni-Yasmin Turhan

Proceedings of the 2002 International Workshop on Description Logics (DL2002), 2002

Unification in a Description Logic with Inconsistency and Transitive Closure of Roles.

[BibT_eX]

[DOI]

Proceedings of the 2002 International Workshop on Description Logics (DL2002), 2002

2001

What's in an Attribute? Consequences for the Least Common Subsumer.

[BibT_eX]

[DOI]

Alexander Borgida

J. Artif. Intell. Res., 2001

Unification in a Description Logic with Transitive Closure of Roles.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2001

Computing Least Common Subsumers in ALEN.

[BibT_eX]

Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

Matching under Side Conditions in Description Logics.

[BibT_eX]

Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

Memoryless Determinacy of Parity Games.

[BibT_eX]

[DOI]

Proceedings of the Automata, 2001

Non-Standard Inferences in Description Logics

[BibT_eX]

[DOI]

Lecture Notes in Computer Science 2100, Springer, ISBN: 3-540-42397-4, 2001

2000

Rewriting Concepts Using Terminologies.

[BibT_eX]

Proceedings of the KR 2000, 2000

Matching Concept Descriptions with Existential Restrictions.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Alexander Borgida

Proceedings of the 2000 International Workshop on Description Logics (DL2000), 2000

1999

Matching in Description Logics.

[BibT_eX]

[DOI]

Alexander Borgida

Deborah L. McGuinness

J. Log. Comput., 1999

Computing Least Common Subsumers in Description Logics with Existential Restrictions.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

Matching in Description Logics with Existential Restrictions.

[BibT_eX]

[DOI]

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.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Proceedings of the KI-98: Advances in Artificial Intelligence, 1998

Structural Subsumption Considered from an Automata-Theoretic Point of View.

[BibT_eX]

[DOI]

Proceedings of the 1998 International Workshop on Description Logics (DL'98), IRST, Povo, 1998

Least Common Subsumer Computation w.r.t. cyclic ALN-Terminologies.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]