Pairing-Based Cryptography – Pairing 2007 First International Conference, Tokyo, Japan, July 2-4, 2007. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Takagi, Tsuyoshi (Επιμελητής έκδοσης), Okamoto, Tatsuaki (Επιμελητής έκδοσης), Okamoto, Eiji (Επιμελητής έκδοσης), Okamoto, Takeshi (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.
• Σειρά: Lecture Notes in Computer Science, 4575
• Θέματα: Computer science.; Data encryption (Computer science).; Coding theory.; Algorithms.; Computer science > Mathematics.; Computer Science.; Coding and Information Theory.; Data Encryption.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Symbolic and Algebraic Manipulation.

 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.