Detail page

Knowledge Web

Person

Ralf Küsters (1972-)

Informatiker

Name	Ralf Küsters
Time	1972- (Date of birth and death)
Place	Deutschland
Gender	männlich
Academic degree	Prof. Dr.
Profession	Informatiker (characteristic profession)
Related	Universität Stuttgart (2017-) Universität Trier (2007-2017)
Topic	Personen zu Informatik, Datenverarbeitung
Further information	Dissertation RWTH Aachen 2000, Habilitation Christian-Albrechts-Universität Kiel 2005
Source	https://sec.uni-stuttgart.de/people/kuesters
Record type	Person
GND-Identifier	1028953577
Record ID	1028953577
Involved in show all Mechanized modeling and security proofs for web protocols Composable accountability for distributed ledgers Differential privacy for sequential and directional data Formal security analysis of the OpenID FAPI 2.0 Security Profile with FAPI 2.0 Message Signing, FAPI-CIBA, Dynamic Client Registration and Management : technical report Layered symbolic security analysis in DY* The Grant Negotiation and Authorization Protocol : attacking, fixing, and verifying an emerging standard Verifiable tally-hiding remote electronic voting Approximation and Difference in Description Logics Characterizing the semantics of terminological cycles in ALN using finite automata Computing Least Common Subsumer in Description Logics with Existential Restrictions Computing Least Common Subsumers in ALEN Computing Most Specific Concepts in Description Logics with Existential Restrictions Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions Foundations of non-standard inferences for DLs with transitive roles Improved usability of differential privacy in machine learning : techniques for quantifying the privacy-accuracy trade-off Matching Concept Descriptions with Existential Restrictions Matching Concept Descriptions with Existential Restrictions Revisited Matching under Side Conditions in Description Logics Revised Version of LTCS-Report 99-12: Rewriting Concepts Using Terminologies - Revisited Rewriting Concepts Using Terminologies - Revisited Structural Subsumption Considered from an Automata-Theoretic Point of View Unification in a Description Logic with Transitive Closure of Roles The IITM Model: A Simple and Expressive Model for Universal Composability Joint State Composition Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation Joint state composition theorems for public-key encryption and digital signature functionalities with local computation The IITM model : a simple and expressive model for universal composability Principles of Security and Trust : 7th International Conference, POST 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings Security in e-voting Moderne Kryptographie : eine Einführung A Dolev-Yao-based Definition of Abuse-free Protocols On the decidability of cryptographic protocols with open-ended data structures A Constraint-Based Algorithm for Contract-Signing Protocols Automata-based Analysis of Recursive Cryptographic Protocols Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents Tree Transducer-based Analysis of Cryptographic Protocols Deciding the First Level of the [my]-calculus Alternation Hierarchy On the decidability of cryptographic group protocols On the Decidability of Cryptographic Group Protocols On the decidability of cryptographic protocols with open-ended data structures On the Decidability of Cryptographic Protocols with Open-ended Data Structures Non-standard inferences in description logics Non-standard inferences in description logics

Please note

The beta version does not yet contain all functions and information of the DNB portal catalogue. If you are missing information or want to order a medium, please visit the page in the DNB portal catalogue via the following link:

Katalog der Deutschen Nationalbibliothek

Ralf Küsters (1972-)

Mechanized modeling and security proofs for web protocols

Composable accountability for distributed ledgers

Differential privacy for sequential and directional data

Formal security analysis of the OpenID FAPI 2.0 Security Profile with FAPI 2.0 Message Signing, FAPI-CIBA, Dynamic Client Registration and Management : technical report

Layered symbolic security analysis in DY*

The Grant Negotiation and Authorization Protocol : attacking, fixing, and verifying an emerging standard

Verifiable tally-hiding remote electronic voting

Approximation and Difference in Description Logics

Characterizing the semantics of terminological cycles in ALN using finite automata

Computing Least Common Subsumer in Description Logics with Existential Restrictions

Computing Least Common Subsumers in ALEN

Computing Most Specific Concepts in Description Logics with Existential Restrictions

Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions

Foundations of non-standard inferences for DLs with transitive roles

Improved usability of differential privacy in machine learning : techniques for quantifying the privacy-accuracy trade-off

Matching Concept Descriptions with Existential Restrictions

Matching Concept Descriptions with Existential Restrictions Revisited

Matching under Side Conditions in Description Logics

Revised Version of LTCS-Report 99-12: Rewriting Concepts Using Terminologies - Revisited

Rewriting Concepts Using Terminologies - Revisited

Structural Subsumption Considered from an Automata-Theoretic Point of View

Unification in a Description Logic with Transitive Closure of Roles

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

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

Joint state composition theorems for public-key encryption and digital signature functionalities with local computation

The IITM model : a simple and expressive model for universal composability

Principles of Security and Trust : 7th International Conference, POST 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings

Security in e-voting

Moderne Kryptographie : eine Einführung

A Dolev-Yao-based Definition of Abuse-free Protocols

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

A Constraint-Based Algorithm for Contract-Signing Protocols

Automata-based Analysis of Recursive Cryptographic Protocols

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

Tree Transducer-based Analysis of Cryptographic Protocols

Deciding the First Level of the [my]-calculus Alternation Hierarchy

On the decidability of cryptographic group protocols

On the Decidability of Cryptographic Group Protocols

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

On the Decidability of Cryptographic Protocols with Open-ended Data Structures

Non-standard inferences in description logics

Non-standard inferences in description logics