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.
Author(s): Kristin Lauter, Peter L. Montgomery, Michael Naehrig (auth.), Marc Joye, Atsuko Miyaji, Akira Otsuka (eds.)
Series: Lecture Notes in Computer Science 6487 : Security and Cryptology
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010
Language: English
Pages: 467
Tags: Data Encryption; Discrete Mathematics in Computer Science; Coding and Information Theory; Computer Communication Networks; Algorithm Analysis and Problem Complexity; Systems and Data Security
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 -
