Sciweavers

1777 search results - page 59 / 356
» Programming Cryptographic Protocols
Sort
View
CSFW
2002
IEEE
14 years 1 months ago
Polynomial Fairness and Liveness
Important properties of many protocols are liveness or availability, i.e., that something good happens now and then. In asynchronous scenarios these properties obviously depend on...
Michael Backes, Birgit Pfitzmann, Michael Steiner,...
IANDC
2008
150views more  IANDC 2008»
13 years 8 months ago
Hierarchical combination of intruder theories
Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weakn...
Yannick Chevalier, Michaël Rusinowitch
IANDC
2007
126views more  IANDC 2007»
13 years 8 months ago
Alternating two-way AC-tree automata
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryp...
Kumar Neeraj Verma, Jean Goubault-Larrecq
ESORICS
2005
Springer
14 years 2 months ago
Quantifying Probabilistic Information Flow in Computational Reactive Systems
Information flow and non-interference are well-established techniques for expressing both integrity and privacy properties. Because of the enormous potential to transmit informati...
Michael Backes
PST
2008
13 years 10 months ago
Unlinkable Communication
In this paper we present a protocol for unlinkable communication, i.e. where an attacker cannot map the sender and receiver node of a communication. Existing anonymity protocols e...
Volker Fusenig, Eugen Staab, Uli Sorger, Thomas En...