Pairing-Based Cryptography - Pairing 2009

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.- Protocols.- Strongly Secure Certificateless Key Agreement.- Universally Composable Adaptive Priced Oblivious Transfer.- Conjunctive Broadcast and Attribute-Based Encryption.