loading...
Secret Handshakes from Pairing-Based Key Agreements
Berkeley, CA May 11-May 14
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SECPRI.2003.11993362003 IEEE Symposium on Security and P ...
 This Article 
 
PDF
HTML
IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dirk Balfanz, Palo Alto Research Center
Glenn Durfee, Palo Alto Research Center
Narendar Shankar, University of Maryland
Diana Smetters, Palo Alto Research Center
Jessica Staddon, Palo Alto Research Center
Hao-Chi Wong, Palo Alto Research Center
Consider a CIA agent who wants to authenticate herself to a server, but does not want to reveal her CIA credentials unless the server is a genuine CIA outlet. Consider also that the CIA server does not want to reveal its CIA credentials to anyone but CIA agents - not even to other CIA servers.
In this paper we first show how pairing-based cryptography can be used to implement such secret handshakes. We then propose a formal definition for secure secret handshakes, and prove that our pairing-based schemes are secure under the Bilinear Diffie-Hellman assumption. Our protocols support role-based group membership authentication, traceability, indistinguishability to eavesdroppers, unbounded collusion resistance, and forward repudiability.
Our secret-handshake scheme can be implemented as a TLS cipher suite. We report on the performance of our preliminary Java implementation.
Citation:
Dirk Balfanz, Glenn Durfee, Narendar Shankar, Diana Smetters, Jessica Staddon, Hao-Chi Wong, "Secret Handshakes from Pairing-Based Key Agreements," sp, pp.180, 2003 IEEE Symposium on Security and Privacy, 2003
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions