Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (Eds.)
2007, XIII, 410 p.
Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
The very latest research information in a hugely important field
Includes online files and updates
Pairing-based cryptography is at the very leading edge of the current wave in computer cryptography.
As anyone in the sector will know, this is a massively important field of endeavor, as computer crime becomes ever more sophisticated and companies providing goods on the internet are required to be ever more inventive in counteracting it.
All of which 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 with 2 abstracts and 3 full papers of invited talks were carefully reviewed and selected from 86 submissions.
The papers are organized in topical sections on applications, certificateless public key encryption, hyperelliptic curves, implementation, cryptographic protocols, cryptanalysis, and cryptographic algorithms.
This publication, of more than 400 pages, also includes online files along with regular updates.
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.