Concurrent Zero-Knowledge: With Additional Background by Oded Goldreich

✍ Scribed by Alon Rosen

Publisher: Springer
Year: 2006
Tongue: English
Leaves: 189
Edition: 1
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

Protocols that remain zero-knowledge when many instances are executed concurrently are called concurrent zero-knowledge, and this book is devoted to their study. The book presents constructions of concurrent zero-knowledge protocols, along with proofs of security. It also shows why "traditional" proof techniques (i.e., black-box simulation) are not suitable for establishing the concurrent zero-knowledge property of "message-efficient" protocols.

✦ Table of Contents

Cover
......Page 1
Foreword......Page 4
Acknowledgements......Page 6
TOC
......Page 8
1 A Brief Introduction to Zero-Knowledge (by Oded Goldreich)......Page 11
2 Introduction to Concurrent Zero-Knowledge......Page 35
3
Preliminaries......Page 49
4
cZK Proof Systems for NP......Page 58
5
cZK in Logarithmically Many Rounds......Page 75
6
A Simple Lower Bound......Page 108
7
Black-Box cZK Requires Logarithmically
Many Rounds......Page 118
8
Conclusions and Open Problems......Page 167
9
A Brief Account of Other Developments
(by Oded Goldreich)......Page 170
References......Page 184

📜 SIMILAR VOLUMES

Concurrent Zero Knowledge: (with Additio

📁 Concurrent Zero Knowledge: (with Additional Background by Oded Goldreich)

✍ Alon Rosen 📂 Library 📅 1980 🏛 NY 🌐 English

Zero-knowledge proofs are fascinating and extremely useful constructs. Their fascinating nature is due to their seemingly contradictory definition; zero-knowledge proofs are convincing and yet yield nothing beyond the validity of the assertion being proved. Their applicability in the domain of crypt

Concurrent Zero-Knowledge: With Addition

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

✍ Alon Rosen 📂 Library 📅 2006 🏛 Springer 🌐 English

<span>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 c

Tutorials on the Foundations of Cryptogr

📁 Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich

✍ Yehuda Lindell (eds.) 📂 Library 📅 2017 🏛 Springer International Publishing 🌐 English

<p>This is a graduate textbook of advanced tutorials on the theory of cryptography and computational complexity. In particular, the chapters explain aspects of garbled circuits, public-key cryptography, pseudorandom functions, one-way functions, homomorphic encryption, the simulation proof technique

Tutorials on the Foundations of Cryptogr

📁 Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich

✍ Yehuda Lindell (eds.) 📂 Library 📅 2017 🏛 Springer International Publishing 🌐 English

<p><p>This is a graduate textbook of advanced tutorials on the theory of cryptography and computational complexity. In particular, the chapters explain aspects of garbled circuits, public-key cryptography, pseudorandom functions, one-way functions, homomorphic encryption, the simulation proof techni

Haese Background Knowledge

📁 Haese Background Knowledge

✍ Haese Mathematics 📂 Library 📅 2012 🏛 Haese & Harris Publications 🌐 English

This contains material that is assumed knowledge for the course. It does not include all assumed knowledge, as other necessary work is revised within other materials.

CONCUR 2004 -- Concurrency Theory

📁 CONCUR 2004 -- Concurrency Theory

✍ Gardner P., Yoshida N. 📂 Library 📅 2005 🌐 English

This book constitutes the refereed proceedings of the 15th International Conference on Concurrency Theory, CONCUR 2004, held in London, UK in August/September 2004.The 29 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 134 submissions. Among the