Rosen | Concurrent Zero-Knowledge | Buch | 978-3-642-06949-9 | sack.de

Buch, Englisch, 184 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 312 g

Reihe: Information Security and Cryptography

Rosen

Concurrent Zero-Knowledge

With Additional Background by Oded Goldreich
1. Auflage. Softcover version of original hardcover Auflage 2006
ISBN: 978-3-642-06949-9
Verlag: Springer

With Additional Background by Oded Goldreich

Buch, Englisch, 184 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 312 g

Reihe: Information Security and Cryptography

ISBN: 978-3-642-06949-9
Verlag: Springer


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.

Rosen Concurrent Zero-Knowledge jetzt bestellen!

Zielgruppe


Research


Autoren/Hrsg.


Weitere Infos & Material


A Brief Introduction to Zero-Knowledge (by Oded Goldreich).- to Concurrent Zero-Knowledge.- Preliminaries.- c Proof Systems for.- c in Logarithmically Many Rounds.- A Simple Lower Bound.- Black-Box c Requires Logarithmically Many Rounds.- Conclusions and Open Problems.- A Brief Account of Other Developments (by Oded Goldreich).



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.