Küsters, Ralf, 1972-....
Küsters, Ralf
VIAF ID: 27310411 (Personal)
Permalink: http://viaf.org/viaf/27310411
Preferred Forms
- 200 _ | ‡a Küsters ‡b Ralf
-
- 100 1 _ ‡a Küsters, Ralf
-
-
-
- 100 1 _ ‡a Küsters, Ralf ‡d 1972-
- 100 1 _ ‡a Küsters, Ralf ‡d 1972-
- 100 1 _ ‡a Küsters, Ralf, ‡d 1972-....
- 100 1 _ ‡a Küsters, Ralf
- 100 1 _ ‡a Küsters, Ralf
-
-
4xx's: Alternate Name Forms (1)
5xx's: Related Names (4)
- 510 2 _ ‡a Heidelberg, Universiẗat
- 510 2 _ ‡a Universität Stuttgart ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a Universität Trier ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a Universität Trier
Works
Title | Sources |
---|---|
Characterizing the semantics of terminological cycles in ALN using finite automata | |
Composable accountability for distributed ledgers | |
Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions | |
A Constraint-Based Algorithm for Contract-Signing Protocols | |
Deciding the First Level of the [my]-calculus Alternation Hierarchy | |
Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents | |
Differential privacy for sequential and directional data | |
A Dolev-Yao-based Definition of Abuse-free Protocols | |
FMSE'05 : proceedings of the 2005 ACM Workshop on Formal Methods in Security Engineering : November 11, 2005, Fairfax, Virginia, USA : (co-located with CCS 2005) | |
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 | |
IITM model a simple and expressive model for universal composability | |
Improved usability of differential privacy in machine learning techniques for quantifying the privacy-accuracy trade-off | |
Joint state composition theorems for public-key encryption and digital signature functionalities with local computation | |
Matching Concept Descriptions with Existential Restrictions Revisited | |
Matching under Side Conditions in Description Logics | |
Moderne Kryptographie eine Einführung | |
Non-standard inferences in description logics | |
On the decidability of cryptographic protocols with open-ended data structures | |
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 | |
Progress in Cryptology - INDOCRYPT 2021 : 22nd International Conference on Cryptology in India, Jaipur, India, December 12-15, 2021 : proceedings | |
Rewriting Concepts Using Terminologies - Revisited | |
Structural Subsumption Considered from an Automata-Theoretic Point of View | |
Tree Transducer-based Analysis of Cryptographic Protocols | |
Unification in a Description Logic with Transitive Closure of Roles | |
Verifiable tally-hiding remote electronic voting | |
Vérification formelle des protocoles et des implementations cryptographiques. | |
Vote électronique : définitions et techniques d'analyse |