Nicht aus der Schweiz? Besuchen Sie lehmanns.de

Pairing-Based Cryptography -- Pairing 2012

5th International Conference, Cologne, Germany, May 16-18, 2012, Revised Selected Papers

Michel Abdalla, Tanja Lange (Herausgeber)

Buch | Softcover
XVI, 333 Seiten
2013 | 2013
Springer Berlin (Verlag)
978-3-642-36333-7 (ISBN)
CHF 79,95 inkl. MwSt
This book constitutes the refereed proceedings of the 5th International Conference on Pairing-Based Cryptography, Pairing 2012, held in Cologne, Germany, in May 2012.
The 17 full papers for presentation at the academic track and 3 full papers for presentation at the industrial track were carefully reviewed and selected from 49 submissions. These papers are presented together with 6 invited talks. The contributions are organized in topical sections on: algorithms for pairing computation, security models for encryption, functional encryption, implementations in hardware and software, industry track, properties of pairings, and signature schemes and applications.

On Efficient Pairings on Elliptic Curves over Extension Fields.- Factor-4 and 6 (De)Compression for Values of Pairings Using Trace Maps.- An Improved Twisted Ate Pairing over KSS Curves with k = 18.- Controlled Joining on Encrypted Relational Database.- Stronger Security Model for Public-Key Encryption with Equality Test.- Forward-Secure Hierarchical Predicate Encryption.- Fully Secure Hidden Vector Encryption.- Shorter IBE and Signatures via Asymmetric Pairings.- Core Based Architecture to Speed Up Optimal Ate Pairing on FPGA Platform.- Faster Pairing Coprocessor Architecture.- Implementing Pairings at the 192-Bit Security Level.- Improved Broadcast Encryption Scheme with Constant-Size Ciphertext.- Affine Pairings on ARM.- On the Implementation of a Pairing-Based Cryptographic Protocol in a Constrained Device.-The Tate-Lichtenbaum Pairing on a Hyperelliptic Curve via Hyperelliptic Nets.- Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions.- Tate Pairing Computation on Jacobi's Elliptic Curves.- Group Signatures with Message-Dependent Opening.- Short Pairing-Efficient Threshold-Attribute-Based Signature.- Divisible E-Cash in the Standard Model.

Erscheint lt. Verlag 3.2.2013
Reihe/Serie Lecture Notes in Computer Science
Security and Cryptology
Zusatzinfo XVI, 333 p. 18 illus.
Verlagsort Berlin
Sprache englisch
Maße 155 x 235 mm
Gewicht 532 g
Themenwelt Informatik Theorie / Studium Kryptologie
Schlagworte Algorithm analysis and problem complexity • asymmetric pairings • cryptography • FPGA • public-key encryption • secure encryption
ISBN-10 3-642-36333-4 / 3642363334
ISBN-13 978-3-642-36333-7 / 9783642363337
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich