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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : ISD LLC, Bristol, CT, Etats-Unis
paperback. Etat : New. N° de réf. du vendeur 369081
Quantité disponible : 2 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 45932504-n
Quantité disponible : 2 disponible(s)
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Paperback. Etat : 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. N° de réf. du vendeur 9783832532178
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 45932504
Quantité disponible : 2 disponible(s)
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Etat : New. 2012. Paperback. . . . . . N° de réf. du vendeur V9783832532178
Quantité disponible : 2 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 170 pages. 8.27x5.71x0.40 inches. In Stock. N° de réf. du vendeur 383253217X
Quantité disponible : 1 disponible(s)
Vendeur : Kennys Bookstore, Olney, MD, Etats-Unis
Etat : New. 2012. Paperback. . . . . . Books ship from the US and Ireland. N° de réf. du vendeur V9783832532178
Quantité disponible : 2 disponible(s)
Vendeur : AussieBookSeller, Truganina, VIC, Australie
Paperback. Etat : 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. N° de réf. du vendeur 9783832532178
Quantité disponible : 1 disponible(s)