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
  • Used
  • Good
  • Hardback
Used - Good

Description

Springer. hardcover. Good. 6.2x0.6x9.3. Buy with confidence. Excellent Customer Service & Return policy.
Ask the seller a question Add to wish list
A$130.84
Free Delivery to USA
Standard delivery: 7 to 10 days
More delivery options
Dropship order
Ships from Ausvora INC (Connecticut, United States)

Details

About Ausvora INC Connecticut, United States

Biblio member since 2025

We are a U.S.-based online bookstore specializing in quality used books at affordable prices. With over 1 million books in stock, we serve readers, resellers, libraries, and institutions across the United States and internationally.

Terms of Sale:

Fast & Reliable Shipping All orders ship within 1–2 business days. Domestic shipping across the U.S. via USPS or UPS. International shipping available to most countries. 🔁 30-Day Hassle-Free Returns If the book isn't as described, we'll make it right. Enjoy a full 30-day return window with no questions asked.

Browse books from Ausvora INC

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

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.
tracking-