Pairing-Based Cryptographic Protocols : A Survey Ratna Dutta, Rana Barua and Palash Sarkar Cryptology Research Group Stat-Math and Applied Statistics Unit 203, B. T. Road, Kolkata India[removed]

First Page		Document Content
Date: 2004-06-24 08:19:14 Digital signature Diffie–Hellman problem Signcryption Group signature Blind signature ID-based encryption RSA Pairing Diffie–Hellman key exchange Cryptography BLS Decisional Diffie–Hellman assumption		Pairing-Based Cryptographic Protocols : A Survey Ratna Dutta, Rana Barua and Palash Sarkar Cryptology Research Group Stat-Math and Applied Statistics Unit 203, B. T. Road, Kolkata India[removed] Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 281,48 KB Share Document on Facebook

	On the Size of Pairing-based Non-interactive Arguments? Jens Groth?? University College London, UK Abstract. Non-interactive arguments enable a prover to convince a verifier that a statement is true. R DocID: 1xVKy - View Document
	A New Family of Pairing-Friendly Elliptic Curves Michael Scott and Aurore Guillevic MIRACL.com Université de Lorraine, CNRS, Inria, LORIA, Nancy, France WAIFI 2018, Bergen, Norway, June 14–16 DocID: 1xVbz - View Document
	Challenges with Assessing the Impact of NFS Advances on the Security of Pairing-based Cryptography Alfred Menezes1 , Palash Sarkar2 , and Shashank Singh3 1 Department of Combinatorics & Optimization, University of Water DocID: 1xTm4 - View Document
	A New Family of Pairing-Friendly elliptic curves Michael Scott1 and Aurore Guillevic2 1 2 DocID: 1xTit - View Document
	PDF Document DocID: 1xPJG - View Document