<--- Back to Details
First PageDocument Content
Diffie–Hellman problem / Key-agreement protocol / Public-key cryptography / Key exchange / Elliptic curve cryptography / ID-based encryption / Internet Key Exchange / Boneh/Franklin scheme / Elliptic curve Diffie–Hellman / Cryptographic protocols / Cryptography / Diffie–Hellman key exchange
Date: 2005-12-09 06:49:50
Diffie–Hellman problem
Key-agreement protocol
Public-key cryptography
Key exchange
Elliptic curve cryptography
ID-based encryption
Internet Key Exchange
Boneh/Franklin scheme
Elliptic curve Diffie–Hellman
Cryptographic protocols
Cryptography
Diffie–Hellman key exchange

Weaknesses of the Boyd-Mao Deniable Authenticated key Establishment for Internet Protocols Jue-Sam Chou1 , Yalin Chen 2 , Ming-De Yang 3 1 Department of Information Management, Nanhua University Chiayi 622 Taiwan, R.O.C

Add to Reading List

Source URL: eprint.iacr.org

Download Document from Source Website

File Size: 376,22 KB

Share Document on Facebook

Similar Documents

Boneh-Franklin Identity Based Encryption Revisited David Galindo Institute for Computing and Information Sciences Radboud University Nijmegen P.O.BoxGL, Nijmegen, The Netherlands.

Boneh-Franklin Identity Based Encryption Revisited David Galindo Institute for Computing and Information Sciences Radboud University Nijmegen P.O.BoxGL, Nijmegen, The Netherlands.

DocID: 1laI7 - View Document

Introduction Related Works Proposal Hashing Conclusion  How to Hash into Elliptic Curves Thomas Icart

Introduction Related Works Proposal Hashing Conclusion How to Hash into Elliptic Curves Thomas Icart

DocID: 1aDh6 - View Document

Pairing-Based Onion Routing with Improved Forward Secrecy ANIKET KATE, GREG M. ZAVERUCHA, and IAN GOLDBERG University of Waterloo  This article presents new protocols for onion routing anonymity networks. We define a pro

Pairing-Based Onion Routing with Improved Forward Secrecy ANIKET KATE, GREG M. ZAVERUCHA, and IAN GOLDBERG University of Waterloo This article presents new protocols for onion routing anonymity networks. We define a pro

DocID: 19VV4 - View Document

Verified Indifferentiable Hashing into Elliptic Curves Santiago Zanella B´eguelin1 Gilles Barthe2 , Benjamin Gr´egoire3 , Sylvain Heraud3 and Federico Olmedo2

Verified Indifferentiable Hashing into Elliptic Curves Santiago Zanella B´eguelin1 Gilles Barthe2 , Benjamin Gr´egoire3 , Sylvain Heraud3 and Federico Olmedo2

DocID: 19OIw - View Document

Verifiable Security of Boneh-Franklin Identity-Based Encryption Federico Olmedo Gilles Barthe Santiago Zanella Béguelin IMDEA Software Institute, Madrid, Spain

Verifiable Security of Boneh-Franklin Identity-Based Encryption Federico Olmedo Gilles Barthe Santiago Zanella Béguelin IMDEA Software Institute, Madrid, Spain

DocID: 19MI6 - View Document