Sciweavers

273 search results - page 46 / 55
» Modular Security Proofs for Key Agreement Protocols
Sort
View

Publication
545views
14 years 4 months ago
Reid et al.'s Distance Bounding Protocol and Mafia Fraud Attacks over Noisy Channels
Distance bounding protocols are an effective countermeasure against relay attacks including distance fraud, mafia fraud and terrorist fraud attacks. Reid et al. proposed the first ...
A. Mitrokotsa, C. Dimitrakakis, P. Peris-Lopez, J....
ESORICS
2003
Springer
14 years 21 days ago
Symmetric Authentication within a Simulatable Cryptographic Library
Abstract. Proofs of security protocols typically employ simple abstractions of cryptographic operations, so that large parts of such proofs pendent of cryptographic details. The ty...
Michael Backes, Birgit Pfitzmann, Michael Waidner
EUROCRYPT
2006
Springer
13 years 11 months ago
Composition Implies Adaptive Security in Minicrypt
To prove that a secure key-agreement protocol exists one must at least show P = NP. Moreover any proof that the sequential composition of two non-adaptively secure pseudorandom fun...
Krzysztof Pietrzak
CCS
2007
ACM
14 years 1 months ago
Alpaca: extensible authorization for distributed services
Traditional Public Key Infrastructures (PKI) have not lived up to their promise because there are too many ways to define PKIs, too many cryptographic primitives to build them wi...
Chris Lesniewski-Laas, Bryan Ford, Jacob Strauss, ...
CSFW
2010
IEEE
13 years 11 months ago
Impossibility Results for Secret Establishment
—Security protocol design is a creative discipline where the solution space depends on the problem to be solved and the cryptographic operators available. In this paper, we exami...
Benedikt Schmidt, Patrick Schaller, David A. Basin