Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
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 industrical 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 applictions.
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.