Central Library

Normal view MARC view ISBD view

Pairing-Based Cryptography - Pairing 2007 [electronic resource] : First International Conference, Pairing 2007, Tokyo, Japan, July 2-4, 2007, Proceedings / edited by Tsuyoshi Takagi, Tatsuaki Okamoto, Eiji Okamoto, Takeshi Okamoto.

Contributor(s): Takagi, Tsuyoshi [editor.] | Okamoto, Tatsuaki [editor.] | Okamoto, Eiji [editor.] | Okamoto, Takeshi [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Security and Cryptology: 4575Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007Edition: 1st ed. 2007.Description: XIII, 410 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540734895.Subject(s): Coding theory | Information theory | Cryptography | Data encryption (Computer science) | Algorithms | Computer science -- Mathematics | Discrete mathematics | Coding and Information Theory | Cryptology | Algorithms | Discrete Mathematics in Computer Science | Symbolic and Algebraic ManipulationAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 003.54 Online resources: Click here to access online
Contents:
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.
In: Springer Nature eBook
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.