Sciweavers

177 search results - page 8 / 36
» Provably Secure Key Exchange: An Engineering Approach
Sort
View
PERVASIVE
2004
Springer
15 years 3 months ago
A Fault-Tolerant Key-Distribution Scheme for Securing Wireless Ad Hoc Networks
We propose a novel solution for securing wireless ad-hoc networks. Our goal is to provide secure key exchange in the presence of device failures and denial-of-service attacks. The ...
Arno Wacker, Timo Heiber, Holger Cermann, Pedro Jo...
DRM
2003
Springer
15 years 2 months ago
Breaking and repairing optimistic fair exchange from PODC 2003
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
Yevgeniy Dodis, Leonid Reyzin
FSTTCS
2003
Springer
15 years 2 months ago
A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol
We prove the Needham-Schroeder-Lowe public-key protocol secure under real, active cryptographic attacks including concurrent protocol runs. This proof is based on an abstract crypt...
Michael Backes, Birgit Pfitzmann
CCS
2005
ACM
15 years 3 months ago
Provable anonymity
This paper provides a formal framework for the analysis of information hiding properties of anonymous communication protocols in terms of epistemic logic. The key ingredient is ou...
Flavio D. Garcia, Ichiro Hasuo, Wolter Pieters, Pe...
ACSAC
2000
IEEE
15 years 2 months ago
A Novel Approach to On-Line Status Authentication of Public-Key Certificates
The widespread use of public networks, such as the Internet, for the exchange of sensitive data, like legally valid documents and business transactions, poses severe security cons...
Eugenio Faldella, Marco Prandini