Concurrent Zero-Knowledge With Additional Background by Oded Goldreich /
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 cryptog...
Κύριος συγγραφέας: | |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2006.
|
Σειρά: | Information Security and Cryptography, Texts and Monographs,
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 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).