Pairing-Based Cryptography - Pairing 2008
Editat de Steven Galbraith, Kenny Patersonen Limba Engleză Paperback – 25 aug 2008
Preț: 326.88 lei
Preț vechi: 408.60 lei
-20%
Puncte Express: 490
Carte tipărită la comandă
Livrare economică 28 iulie-11 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540855033
ISBN-10: 3540855033
Pagini: 392
Ilustrații: XI, 377 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.59 kg
Ediția:2008
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540855033
Pagini: 392
Ilustrații: XI, 377 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.59 kg
Ediția:2008
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Talks.- Pairings in Trusted Computing.- Pairing Lattices.- The Uber-Assumption Family.- Cryptography I.- Homomorphic Encryption and Signatures from Vector Decomposition.- Hidden-Vector Encryption with Groups of Prime Order.- Mathematics.- The Hidden Root Problem.- Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography.- Computing the Cassels Pairing on Kolyvagin Classes in the Shafarevich-Tate Group.- Constructing Pairing Friendly Curves.- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field.- Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials.- A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties.- Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2?=?x 5?+?ax.- Implementation of Pairings.- Integer Variable ?–Based Ate Pairing.- Pairing Computation on Twisted Edwards Form Elliptic Curves.- Exponentiation in Pairing-Friendly Groups Using Homomorphisms.- Generators for the ?-Torsion Subgroup of Jacobians of Genus Two Curves.- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms.- Pairings on Hyperelliptic Curves with a Real Model.- Hardware Implementation.- Faster Implementation of ? T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition.- A Comparison between Hardware Accelerators for the Modified Tate Pairing over and .- Cryptography II.- One-Round ID-Based Blind Signature Scheme without ROS Assumption.- Tracing Malicious Proxies in Proxy Re-encryption.- Security and Anonymity of Identity-Based Encryption with Multiple Trusted Authorities.
Textul de pe ultima copertă
This book constitutes the thoroughly refereed proceedings of the Second International Conference on Pairing-Based Cryptography, Pairing 2008, held in London, UK, in September 2008.
The 20 full papers, presented together with the contributions resulting from 3 invited talks, were carefully reviewed and selected from 50 submissions. The contents are organized in topical sections on cryptography, mathematics, constructing pairing-friendly curves, implementation of pairings, and hardware implementation.
The 20 full papers, presented together with the contributions resulting from 3 invited talks, were carefully reviewed and selected from 50 submissions. The contents are organized in topical sections on cryptography, mathematics, constructing pairing-friendly curves, implementation of pairings, and hardware implementation.