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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Da: ISD LLC, Bristol, CT, U.S.A.
paperback. Condizione: New. Codice articolo 369081
Quantità: 2 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 45932504-n
Quantità: 2 disponibili
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condizione: new. Paperback. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9783832532178
Quantità: 1 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 45932504
Quantità: 2 disponibili
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condizione: New. 2012. Paperback. . . . . . Codice articolo V9783832532178
Quantità: 2 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Paperback. Condizione: Brand New. 170 pages. 8.27x5.71x0.40 inches. In Stock. Codice articolo 383253217X
Quantità: 1 disponibili
Da: Kennys Bookstore, Olney, MD, U.S.A.
Condizione: New. 2012. Paperback. . . . . . Books ship from the US and Ireland. Codice articolo V9783832532178
Quantità: 2 disponibili
Da: AussieBookSeller, Truganina, VIC, Australia
Paperback. Condizione: new. Paperback. 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Codice articolo 9783832532178
Quantità: 1 disponibili