menu
{ "item_title" : "Bringing Zero-Knowledge Proofs of Knowledge to Practice", "item_author" : [" Stephan Krenn "], "item_description" : "A zero-knowledge proof of knowledge allows one party to convince another party that it knows a secret piece of information without revealing anything about it. Such protocols are important building blocks for many interesting higher-level cryptographic applications, such as e-voting and e-cash systems, digital signature and identification schemes, or anonymous credential systems. Unfortunately, their high computational costs, as well as long and error-prone implementation cycles, are major hurdles on their way to real-world usage. This thesis contributes to overcoming these restrictions. On the practical side, we introduce a compiler which automatically translates natural specifications of zero-knowledge proofs into concrete implementations. In addition, it generates formal proofs that the generated protocols are indeed sound. On the theoretical side, we analyze inherent efficiency limitations of igma-protocols, proving the optimality of currently known protocols. Finally, we consider zero-knowledge proofs in the Universal Composability framework. By enabling UC-compliant proofs of existence for the first time, we are able to decrease the computational complexity of many practically relevant UC-secure zero-knowledge protocols to an acceptable level.", "item_img_path" : "https://covers3.booksamillion.com/covers/bam/3/83/253/217/383253217X_b.jpg", "price_data" : { "retail_price" : "54.00", "online_price" : "54.00", "our_price" : "54.00", "club_price" : "54.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Bringing Zero-Knowledge Proofs of Knowledge to Practice|Stephan Krenn

Bringing Zero-Knowledge Proofs of Knowledge to Practice

local_shippingShip to Me
Earliest ship date: June 12, 2026
FREE Shipping for Club Members help

Overview

A zero-knowledge proof of knowledge allows one party to convince another party that it knows a secret piece of information without revealing anything about it. Such protocols are important building blocks for many interesting higher-level cryptographic applications, such as e-voting and e-cash systems, digital signature and identification schemes, or anonymous credential systems. Unfortunately, their high computational costs, as well as long and error-prone implementation cycles, are major hurdles on their way to real-world usage. This thesis contributes to overcoming these restrictions. On the practical side, we introduce a compiler which automatically translates natural specifications of zero-knowledge proofs into concrete implementations. In addition, it generates formal proofs that the generated protocols are indeed sound. On the theoretical side, we analyze inherent efficiency limitations of igma-protocols, proving the optimality of currently known protocols. Finally, we consider zero-knowledge proofs in the Universal Composability framework. By enabling UC-compliant proofs of existence for the first time, we are able to decrease the computational complexity of many practically relevant UC-secure zero-knowledge protocols to an acceptable level.

This item is Non-Returnable

Details

  • ISBN-13: 9783832532178
  • ISBN-10: 383253217X
  • Publisher: Logos Verlag Berlin
  • Publish Date: September 2012
  • Dimensions: 8.04 x 5.68 x 0.48 inches
  • Shipping Weight: 1.05 pounds
  • Page Count: 170

Related Categories

You May Also Like...

    1

BAM Customer Reviews