Pairing-Based Cryptography - Pairing 2007: First International Conference, Pairing 2007, Tokyo, Japan, July 2-4, 2007, Proceedings

ISBN-13: 9783540734888 / Angielski / Miękka / 2007 / 410 str.

Tatsuaki Okamoto

Opis

Pairing-based cryptography is at the very leading edge of the current wave in computer cryptography. That makes this book all the more relevant, being as it is the refereed proceedings of the First International Conference on Pairing-Based Cryptography, Pairing 2007, held in Tokyo, Japan in 2007. The 18 revised full papers presented together were carefully reviewed and selected from 86 submissions. The papers are organized in topical sections including those on applications, and certificateless public key encryption.

Spis treści

Invited Talk I.- Bilinear Groups of Composite Order.- Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System.- Practical Time Capsule Signatures in the Standard Model from Bilinear Maps.- Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys.- Certificateless Public Key Encryption in the Selective-ID Security Model (Without Random Oracles).- General and Efficient Certificateless Public Key Encryption Constructions.- Invited Talk II.- Hyperelliptic Pairings.- Zeta Function and Cryptographic Exponent of Supersingular Curves of Genus 2.- Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians.- Invited Talk III.- Implementing Cryptographic Pairings over Barreto-Naehrig Curves.- Instruction Set Extensions for Pairing-Based Cryptography.- The Importance of the Final Exponentiation in Pairings When Considering Fault Attacks.- Protocol I.- Proxy Re-encryption Systems for Identity-Based Encryption.- Fair Blind Signatures Revisited.- Invited Talk IV.- Supersingular Elliptic Curves in Cryptography.- On the Minimal Embedding Field.- Remarks on Cheon’s Algorithms for Pairing-Related Problems.- Invited Talk V.- On Pairing Inversion Problems.- The Tate Pairing Via Elliptic Nets.- Eta Pairing Computation on General Divisors over Hyperelliptic Curves y 2?=?x 7???x ±1.- Protocol II.- Provably Secure Pairing-Based Convertible Undeniable Signature with Short Signature Length.- Identity-Based Encryption: How to Decrypt Multiple Ciphertexts Using a Single Decryption Key.