Improvement of Ma ni ke ta l .

First Page		Document Content
Date: 2005-12-09 05:56:33 Computational hardness assumptions Diffie–Hellman key exchange Diffie–Hellman problem Weil pairing ID-based encryption Password authentication protocol Public-key cryptography Boneh/Franklin scheme Cryptography Cryptographic protocols Finite fields		Improvement of Ma ni ke ta l . Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 416,50 KB Share Document on Facebook

	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 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 DocID: 19VV4 - View Document
	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 DocID: 19MI6 - View Document