Home > Computing and Information Technology > Computer security > Data encryption > Pairing-Based Cryptography - Pairing 2010: 4th International Conference, Yamanaka Hot Spring, Japan, December 13-15, 2010, Proceedings(6487 Lecture Notes in Computer Science)
Pairing-Based Cryptography - Pairing 2010: 4th International Conference, Yamanaka Hot Spring, Japan, December 13-15, 2010, Proceedings(6487 Lecture Notes in Computer Science)

Pairing-Based Cryptography - Pairing 2010: 4th International Conference, Yamanaka Hot Spring, Japan, December 13-15, 2010, Proceedings(6487 Lecture Notes in Computer Science)

          
5
4
3
2
1

International Edition


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

The4thInternationalConferenceonPairing-BasedCryptography(Pairing2010) was held in Yamanaka Hot Spring, Japan, during December 13-15, 2010. It was jointly co-organized by the National Institute of Advanced Industrial Science and Technology (AIST), Japan, and the Japan Advanced Institute of Science and Technology (JAIST). The goal of Pairing 2010 was to bring together leading researchersand pr- titioners from academia and industry, all concerned with problems related to pairing-based cryptography. We hope that this conference enhanced com- nication among specialists from various research areas and promoted creative interdisciplinary collaboration. Theconferencereceived64submissionsfrom17countries,outofwhich25- pers from 13 countries were accepted for publication in these proceedings. At least three Program Committee (PC) members reviewed each submitted paper, while submissions co-authored by a PC member were submitted to the more stringent evaluation of ?ve PC members. In addition to the PC members, many externalreviewersjoinedthereviewprocessintheirparticularareasofexpertise. We were fortunate to have this energetic team of experts, and are deeply gra- ful to all of them for their hard work, which included a very active discussion phase. The paper submission, review and discussion processes were e?ectively and e?ciently made possible by the Web-based system iChair. Furthermore,theconferencefeaturedthreeinvitedspeakers:JensGrothfrom University College London, Joseph H. Silverman from Brown University, and Gene Tsudik from University of California at Irvine, whose lectures on cutti- edge research areas- "Pairing-Based Non-interactive Zero-Knowledge Proofs," "A Survey of Local and Global Pairings on Elliptic Curves and Abelian Va- eties," and "Some Security Topics with Possible Applications for Pairing-Based Cryptography," respectively- contributed in a signi?cant part to the richness of the program.

Table of Contents:
Efficient Software Implementation.- An Analysis of Affine Coordinates for Pairing Computation.- High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves.- Invited Talk 1.- Some Security Topics with Possible Applications for Pairing-Based Cryptography.- Digital Signatures.- A New Construction of Designated Confirmer Signature and Its Application to Optimistic Fair Exchange.- Anonymizable Signature and Its Construction from Pairings.- Identification of Multiple Invalid Pairing-Based Signatures in Constrained Batches.- Cryptographic Protocols.- Oblivious Transfer with Access Control : Realizing Disjunction without Duplication.- Increased Resilience in Threshold Cryptography: Sharing a Secret with Devices That Cannot Store Shares.- Shorter Verifier-Local Revocation Group Signature with Backward Unlinkability.- Key Agreement.- Strongly Secure Two-Pass Attribute-Based Authenticated Key Exchange.- Constructing Certificateless Encryption and ID-Based Encryption from ID-Based Key Agreement.- Ephemeral Key Leakage Resilient and Efficient ID-AKEs That Can Share Identities, Private and Master Keys.- Invited Talk 2.- Pairing-Based Non-interactive Zero-Knowledge Proofs.- Applications: Code Generation, Time-Released Encryption, Cloud Computing.- Designing a Code Generator for Pairing Based Cryptographic Functions.- Efficient Generic Constructions of Timed-Release Encryption with Pre-open Capability.- Optimal Authenticated Data Structures with Multilinear Forms.- Point Encoding and Pairing-Friendly Curves.- Deterministic Encoding and Hashing to Odd Hyperelliptic Curves.- Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time.- A New Method for Constructing Pairing-Friendly Abelian Surfaces.- Generating MoreKawazoe-Takahashi Genus 2 Pairing-Friendly Hyperelliptic Curves.- ID-Based Encryption Schemes.- New Identity-Based Proxy Re-encryption Schemes to Prevent Collusion Attacks.- Fully Secure Anonymous HIBE and Secret-Key Anonymous IBE with Short Ciphertexts.- Chosen-Ciphertext Secure Identity-Based Encryption from Computational Bilinear Diffie-Hellman.- Invited Talk 3.- A Survey of Local and Global Pairings on Elliptic Curves and Abelian Varieties.- Efficient Hardware, FPGAs, and Algorithms.- Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves.- A Variant of Miller’s Formula and Algorithm.- Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree.- High Speed Flexible Pairing Cryptoprocessor on FPGA Platform.


Best Sellers


Product Details
  • ISBN-13: 9783642174544
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Depth: 25
  • Language: English
  • Returnable: Y
  • Series Title: Security and Cryptology
  • Sub Title: 4th International Conference, Yamanaka Hot Spring, Japan, December 13-15, 2010, Proceedings
  • Width: 155 mm
  • ISBN-10: 364217454X
  • Publisher Date: 22 Nov 2010
  • Binding: Paperback
  • Height: 236 mm
  • No of Pages: 467
  • Series Title: 6487 Lecture Notes in Computer Science
  • Spine Width: 25 mm
  • Weight: 702 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Pairing-Based Cryptography - Pairing 2010: 4th International Conference, Yamanaka Hot Spring, Japan, December 13-15, 2010, Proceedings(6487 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Pairing-Based Cryptography - Pairing 2010: 4th International Conference, Yamanaka Hot Spring, Japan, December 13-15, 2010, Proceedings(6487 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Pairing-Based Cryptography - Pairing 2010: 4th International Conference, Yamanaka Hot Spring, Japan, December 13-15, 2010, Proceedings(6487 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA