Pairing-Based Cryptography - Pairing 2009: Third International Conference Palo Alto, CA, USA, August 12-14, 2009 Proceedings

by Hovav Shacham (Editor), Brent Waters (Editor)

Overview

This book constitutes the refereed proceedings of the Third International Conference on Pairing-Based Cryptography, Pairing 2009, held in Palo Alto, CA, USA, in August 2009. The 16 full papers presented were carefully reviewed and selected from 38 submissions. The papers are organized in topical sections on signature security, curves, pairing computation, non-interactive zero-knowledge systems and applications, group signatures, and prools.

Product Details

ISBN-13:	9783642032974
Publisher:	Springer Berlin Heidelberg
Publication date:	08/27/2009
Series:	Lecture Notes in Computer Science , #5671
Edition description:	2009
Pages:	267
Product dimensions:	6.10(w) x 9.30(h) x 0.60(d)

Table of Contents

Signature Security.- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem.- Security of Verifiably Encrypted Signatures and a Construction without Random Oracles.- Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model.- Curves.- On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields.- Generating Pairing-Friendly Curves with the CM Equation of Degree 1.- Pairing Computation.- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves.- Faster Pairings on Special Weierstrass Curves.- Fast Hashing to G 2 on Pairing-Friendly Curves.- NIZKs and Applications.- Compact E-Cash and Simulatable VRFs Revisited.- Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures.- Group Signatures.- Identity Based Group Signatures from Hierarchical Identity-Based Encryption.- Forward-Secure Group Signatures from Pairings.- Efficient Traceable Signatures in the Standard Model.- Prools.- Strongly Secure Certificateless Key Agreement.- Universally Composable Adaptive Priced Oblivious Transfer.- Conjunctive Broadcast and Attribute-Based Encryption.