BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Concurrent Zero-Knowledge: With Additional Background by Oded Goldreich (Information Security and Cryptography)

Concurrent Zero-Knowledge: With Additional Background by Oded Goldreich (Information Security and Cryptography)

Concurrent Zero-Knowledge: With Additional Background by Oded Goldreich
Stock photo: cover may vary

Concurrent Zero-Knowledge: With Additional Background by Oded Goldreich (Information Security and Cryptography) Hardback - 2006

by Rosen, Alon

Add to wish list
  • New
  • Hardback
New

Description

Springer, 2006-08-21. 2006. hardcover. New. 6.14x0.50x9.21. Buy with confidence. Excellent Customer Service & Return policy.
Ask the seller a question Add to wish list
A$139.67
Free Delivery within USA
Standard delivery: 5 to 10 days
More delivery options
Dropship order
Ships from Ergodebooks (Texas, United States)
The BIBLIO Guarantee

Details

About Ergodebooks Texas, United States

Specialising in: Rare Books, Rare Dvd, Rare Video, Textbook
Biblio member since 2005

Our goal is to provide best customer service and good condition books for the lowest possible price. We are always honest about condition of book. We list book only by ISBN # and hence exact book is guaranteed.

Terms of Sale:

We have 30 day return policy.

Browse books from Ergodebooks

Reader reviews for Concurrent Zero-Knowledge: With Additional Background by Oded Goldreich (Information Security and Cryptography)

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

From the publisher

Zero-knowledge proofs are fascinating and extremely useful constructs. Their fascinating nature is due to their seemingly contradictory de?nition; ze- knowledge proofs are convincing and yet yield nothing beyond the validity of the assertion being proved. Their applicability in the domain of cryptography is vast; they are typically used to force malicious parties to behave according to a predetermined protocol. In addition to their direct applicability in cr- tography, zero-knowledge proofs serve as a good benchmark for the study of variousproblemsregardingcryptographicprotocols(e.g.,"securecomposition of protocols"). A fundamental question regarding zero-knowledge protocols refers to the preservation of security (i.e., of the zero-knowledge feature) when many - stances are executed concurrently, and in particular under a purely as- chronous model. The practical importance of this question, in the days of extensive Internet communication, seems clear. It turned out that this qu- tion is also very interesting from a theoretical point of view. In particular, this question served as a benchmark for the study of the security of concurrent executions of protocols and led to the development of techniques for coping with the problems that arise in that setting.

First line

Zero-knowledge proofs, introduced by Goldwasser, Micali and Rackoff [72], are fascinating and extremely useful constructs.

Please wait a moment while we load the requested page.

tracking-