Pairing-Based Identification Schemes

First Page		Document Content
Date: 2008-06-06 19:27:43 Public-key cryptography Finite fields BLS Computational Diffie–Hellman assumption Diffie–Hellman problem Decisional Diffie–Hellman assumption Diffie–Hellman key exchange Zero-knowledge proof Digital signature Cryptography Computational hardness assumptions Cryptographic protocols		Pairing-Based Identification Schemes Add to Reading List Source URL: theory.stanford.edu Download Document from Source Website File Size: 286,10 KB Share Document on Facebook

	A Framework for Universally Composable Diffie-Hellman Key Exchange Ralf K¨usters and Daniel Rausch University of Stuttgart Stuttgart, Germany Email: {ralf.kuesters, daniel.rausch}@informatik.uni-stuttgart.de DocID: 1xUdu - View Document
	Efficient algorithms for supersingular isogeny Diffie-Hellman Craig Costello Joint work with Patrick Longa and Michael Naehrig Diffie-Hellman key exchange (circa 1976) DocID: 1uXO8 - View Document
	Applicazioni del logaritmo discreto alla crittografia. Diffie-Hellman-Merkle key exchange su ZZ∗p . Il signor Rossi e il signor Bianchi vogliono condividere un numero segreto senza inviarselo. Si accordano su un primo DocID: 1qhge - View Document
	Number Theory, Discrete Logs, Diffie–Hellman key exchange CARPA Radu February 14, 2013 1 DocID: 1n8iv - View Document
	Contact: Jim OrmondCRYPTOGRAPHY PIONEERS RECEIVE ACM A.M. TURING AWARD DocID: 1miTr - View Document