Pairing-Based Cryptography - Pairing 2008: Second International Conference, Egham, UK, September 1-3, 2008, Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $1.99
Usually ships in 1-2 business days
(Save 98%)
Other sellers (Paperback)
  • All (13) from $1.99   
  • New (8) from $1.99   
  • Used (5) from $1.99   


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.

Read More Show Less

Product Details

Table of Contents

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.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)