Pairing-Based Cryptography - Pairing 2010: 4th International Conference, Yamanaka Hot Spring, Japan, December 13-15, 2010, Proceedings (Lecture Notes in Computer Science (6487))

Annotation This book constitutes the refereed proceedings of the 4th International Conference on Pairing-Based Cryptography, Pairing 2010, held in Yamanaka Hot Spring, Japan, in December 2010. The 25 full papers presented were carefully reviewed and selected from 64 submissions. The contributions are organized in topical sections on: efficient software implementation; digital signatures; cryptographic protocols; key agreement; applications - code generation, time-released encryption, and cloud computing; point encoding and pairing-friendly curves; ID-based encryption schemes; and efficient hardware, FPGAs, and algorithms Front Matter....Pages - An Analysis of Affine Coordinates for Pairing Computation....Pages 1-20 High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves....Pages 21-39 Some Security Topics with Possible Applications for Pairing-Based Cryptography....Pages 40-40 A New Construction of Designated Confirmer Signature and Its Application to Optimistic Fair Exchange....Pages 41-61 Anonymizable Signature and Its Construction from Pairings....Pages 62-77 Identification of Multiple Invalid Pairing-Based Signatures in Constrained Batches....Pages 78-95 Oblivious Transfer with Access Control : Realizing Disjunction without Duplication....Pages 96-115 Increased Resilience in Threshold Cryptography: Sharing a Secret with Devices That Cannot Store Shares....Pages 116-135 Shorter Verifier-Local Revocation Group Signature with Backward Unlinkability....Pages 136-146 Strongly Secure Two-Pass Attribute-Based Authenticated Key Exchange....Pages 147-166 Constructing Certificateless Encryption and ID-Based Encryption from ID-Based Key Agreement....Pages 167-186 Ephemeral Key Leakage Resilient and Efficient ID-AKEs That Can Share Identities, Private and Master Keys....Pages 187-205 Pairing-Based Non-interactive Zero-Knowledge Proofs....Pages 206-206 Designing a Code Generator for Pairing Based Cryptographic Functions....Pages 207-224 Efficient Generic Constructions of Timed-Release Encryption with Pre-open Capability....Pages 225-245 Optimal Authenticated Data Structures with Multilinear Forms....Pages 246-264 Deterministic Encoding and Hashing to Odd Hyperelliptic Curves....Pages 265-277 Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time....Pages 278-297 A New Method for Constructing Pairing-Friendly Abelian Surfaces....Pages 298-311 Generating More Kawazoe-Takahashi Genus 2 Pairing-Friendly Hyperelliptic Curves....Pages 312-326 New Identity-Based Proxy Re-encryption Schemes to Prevent Collusion Attacks....Pages 327-346 Fully Secure Anonymous HIBE and Secret-Key Anonymous IBE with Short Ciphertexts....Pages 347-366 Chosen-Ciphertext Secure Identity-Based Encryption from Computational Bilinear Diffie-Hellman....Pages 367-376 A Survey of Local and Global Pairings on Elliptic Curves and Abelian Varieties....Pages 377-396 Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves....Pages 397-416 A Variant of Miller’s Formula and Algorithm....Pages 417-434 Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree....Pages 435-449 High Speed Flexible Pairing Cryptoprocessor on FPGA Platform....Pages 450-466 Back Matter....Pages - The4thInternationalConferenceonPairing-BasedCryptography(Pairing2010) was held in Yamanaka Hot Spring, Japan, during December 13-15, 2010. It was jointly co-organized by the National Institute of Advanced Industrial Science and Technology (AIST), Japan, and the Japan Advanced Institute of Science and Technology (JAIST). The goal of Pairing 2010 was to bring together leading researchersand pr- titioners from academia and industry, all concerned with problems related to pairing-based cryptography. We hope that this conference enhanced com- nication among specialists from various research areas and promoted creative interdisciplinary collaboration. Theconferencereceived64submissionsfrom17countries,outofwhich25- pers from 13 countries were accepted for publication in these proceedings. At least three Program Committee (PC) members reviewed each submitted paper, while submissions co-authored by a PC member were submitted to the more stringent evaluation of ?ve PC members. In addition to the PC members, many externalreviewersjoinedthereviewprocessintheirparticularareasofexpertise. We were fortunate to have this energetic team of experts, and are deeply gra- ful to all of them for their hard work, which included a very active discussion phase. The paper submission, review and discussion processes were e?ectively and e?ciently made possible by the Web-based system iChair. Furthermore,theconferencefeaturedthreeinvitedspeakers:JensGrothfrom University College London, Joseph H. Silverman from Brown University, and Gene Tsudik from University of California at Irvine, whose lectures on cutti- edge research areas-- “Pairing-Based Non-interactive Zero-Knowledge Proofs,” “A Survey of Local and Global Pairings on Elliptic Curves and Abelian Va- eties,” and “Some Security Topics with Possible Applications for Pairing-Based Cryptography,” respectively-- contributed in a signi?cant part to the richness of the program