Cantitate/Preț
Produs

Pairing-Based Cryptography - Pairing 2007: First International Conference, Pairing 2007, Tokyo, Japan, July 2-4, 2007, Proceedings: Lecture Notes in Computer Science, cartea 4575

Editat de Tsuyoshi Takagi, Tatsuaki Okamoto, Eiji Okamoto, Takeshi Okamoto
en Limba Engleză Paperback – 21 iun 2007

Din seria Lecture Notes in Computer Science

Preț: 37967 lei

Nou

Puncte Express: 570

Preț estimativ în valută:
7266 7666$ 6055£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540734888
ISBN-10: 3540734880
Pagini: 424
Ilustrații: XIII, 410 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.57 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Security and Cryptology

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.