#### Filter Results:

- Full text PDF available (84)

#### Publication Year

1997

2017

- This year (3)
- Last 5 years (25)
- Last 10 years (51)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani
- Theor. Comput. Sci.
- 2003

We provide a method for deciding the insecurity of cryptographic protocols in presence of the standard Dolev-Yao intruder (with a finite number of sessions) extended with so-called oracle rules, i.e., deduction rules that satisfy certain conditions. As an instance of this general framework, we obtain that protocol insecurity is in NP for an intruder that… (More)

- Franz Baader, Ralf Küsters, Ralf Molitor
- IJCAI
- 1999

Computing the least common subsunier (les) is an inference task that can be used to support, the "bot tom-up" construction of knowledge bases for KR systems based on description logics. Previous work on how to compute the lcs has concentrated on description logics that allow for universal value restrictions, but not for existential restrictions. The main… (More)

- Ralf Küsters
- Lecture Notes in Computer Science
- 2001

- Ralf Küsters, Tomasz Truderung, Andreas Vogt
- 2012 IEEE Symposium on Security and Privacy
- 2012

Verifiability is a central property of modern e-voting systems. Intuitively, verifiability means that voters can check that their votes were actually counted and that the published result of the election is correct, even if the voting machines/authorities are (partially) untrusted. In this paper, we raise awareness of a simple attack, which we call a clash… (More)

- Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani
- FSTTCS
- 2003

We present an NP decision procedure for the formal analysis of protocols in presence of modular exponentiation with products allowed in exponents. The number of factors that may appear in products is unlimited. We illustrate that our model is powerful enough to uncover known attacks on the A-GDH.2 protocol suite.

- Franz Baader, Ralf Küsters, Ralf Molitor
- KR
- 2000

The problem of rewriting a concept given a terminology can informally be stated as follows: given a terminology T (i.e., a set of concept deenitions) and a concept description C that does not contain concept names deened in T , can this description be rewritten into a \related better" description E by using (some of) the names deened in T ? In this paper,… (More)

- Ralf Küsters, Tomasz Truderung, Andreas Vogt
- IACR Cryptology ePrint Archive
- 2010

Many cryptographic tasks and protocols, such as non-repudiation, contract-signing, voting, auction, identity-based encryption, and certain forms of secure multi-party computation, involve the use of (semi-)trusted parties, such as notaries and authorities. It is crucial that such parties can be held accountable in case they misbehave as this is a strong… (More)

- Ralf Küsters, Ralf Molitor
- AI Commun.
- 2001

- Achim Walter, H-J Spies, Stefan Terjung, Ralf Küsters, Norbert Kirchgeßner, Ulrich Schurr
- Journal of experimental botany
- 2002

A newly developed technique based on image sequence analysis allows automatic and precise quantification of the dynamics of the growth velocity of the root tip, the distribution of expansion growth rates along the entire growth zone and the oscillation frequencies of the root tip during growth without the need of artificial landmarks. These three major… (More)