A Study of Statistical Zero-Knowledge Proofs (Information Security and Cryptography)
8 Angebote vergleichen
| Preise | 2012 | 2013 | 2014 | 2015 | 2019 |
|---|---|---|---|---|---|
| Schnitt | € 54,63 | € 109,45 | € 277,20 | € 277,20 | € 52,90 |
| Nachfrage |
1
A Study of Statistical Zero-Knowledge Proofs (2000)
DE HC NWISBN: 9783540713739 bzw. 3540713735, in Deutsch, Springer Shop, gebundenes Buch, neu.
Lieferung aus: Japan, Lagernd, zzgl. Versandkosten.
Zero-knowledge interactive proofs play a central role in the design and study of cryptographic protocols and are rich objects for complexity-theoretic study. Statistical zero-knowledge (SZK) proofs achieve strong information-theoretic "security", and can provide a clean test bed for the study of more general notions that incorporate computational security. This monograph is a revised and extended version of the author's PhD thesis, the winning thesis of the 2000 ACM Doctoral Dissertation Competition. It is a comprehensive investigation of statistical zero-knowledge (SZK) proofs. It begins by showing that SZK has two natural complete problems, and then uses these complete problems to address a wide variety of fundamental questions about SZK. It also includes a chapter that surveys recent developments in the area, in particular how the results and techniques of this thesis have been extended to computational zero-knowledge proofs and arguments. The presentation offers clarity and intuition, assuming only a basic background in computational complexity and cryptography, and thus the book can bring a graduate student or a researcher in a related area up to date on this topic. At the same time, it includes clear statements of numerous open problems and research directions, which are likely to interest experts in the area. Hard cover.
Zero-knowledge interactive proofs play a central role in the design and study of cryptographic protocols and are rich objects for complexity-theoretic study. Statistical zero-knowledge (SZK) proofs achieve strong information-theoretic "security", and can provide a clean test bed for the study of more general notions that incorporate computational security. This monograph is a revised and extended version of the author's PhD thesis, the winning thesis of the 2000 ACM Doctoral Dissertation Competition. It is a comprehensive investigation of statistical zero-knowledge (SZK) proofs. It begins by showing that SZK has two natural complete problems, and then uses these complete problems to address a wide variety of fundamental questions about SZK. It also includes a chapter that surveys recent developments in the area, in particular how the results and techniques of this thesis have been extended to computational zero-knowledge proofs and arguments. The presentation offers clarity and intuition, assuming only a basic background in computational complexity and cryptography, and thus the book can bring a graduate student or a researcher in a related area up to date on this topic. At the same time, it includes clear statements of numerous open problems and research directions, which are likely to interest experts in the area. Hard cover.
2
A Study of Statistical Zero-Knowledge Proofs
~DE NWISBN: 9783540713739 bzw. 3540713735, vermutlich in Deutsch, neu.
Lieferung aus: Schweiz, zzgl. Versandkosten.
Zero-knowledge interactive proofs play a central role in the design and study of cryptographic protocols and are rich objects for complexity-theoretic study. Statistical zero-knowledge (SZK) proofs achieve strong information-theoretic \''''security\'''', and can provide a clean test bed for the study of more general notions that incorporate computational security. This monograph is a revised and extended version of the author's PhD thesis, the winning thesis of the 2000 ACM Doctoral Dissertation Competition. It is a comprehensive investigation of statistical zero-knowledge (SZK) proofs. It begins by showing that SZK has two natural complete problems, and then uses these complete problems to address a wide variety of fundamental questions about SZK. It also includes a chapter that surveys recent developments in the area, in particular how the results and techniques of this thesis have been extended to computational zero-knowledge proofs and arguments. The presentation offers clarity and intuition, assuming only a ba 2012, 190 Seiten, Maße: 19,3 x 23,5 cm, Gebunden, Englisch.
Zero-knowledge interactive proofs play a central role in the design and study of cryptographic protocols and are rich objects for complexity-theoretic study. Statistical zero-knowledge (SZK) proofs achieve strong information-theoretic \''''security\'''', and can provide a clean test bed for the study of more general notions that incorporate computational security. This monograph is a revised and extended version of the author's PhD thesis, the winning thesis of the 2000 ACM Doctoral Dissertation Competition. It is a comprehensive investigation of statistical zero-knowledge (SZK) proofs. It begins by showing that SZK has two natural complete problems, and then uses these complete problems to address a wide variety of fundamental questions about SZK. It also includes a chapter that surveys recent developments in the area, in particular how the results and techniques of this thesis have been extended to computational zero-knowledge proofs and arguments. The presentation offers clarity and intuition, assuming only a ba 2012, 190 Seiten, Maße: 19,3 x 23,5 cm, Gebunden, Englisch.
3
A Study of Statistical Zero-Knowledge Proofs
~EN NWISBN: 9783540713739 bzw. 3540713735, vermutlich in Englisch, Springer-Verlag New York, LLC, Springer-Verlag New York, LLC, Springer-Verlag New York, LLC, neu.
Lieferung aus: Vereinigte Staaten von Amerika, zzgl. Versandkosten, Free Shipping on eligible orders over $25.
Zero-knowledge interactive proofs play a central role in the design and study of cryptographic prools and are rich objects for complexity-theoretic study. Statistical zero-knowledge (SZK) proofs achieve strong information-theoretic "security", and can provide a clean test bed for the study of more general notions that incorporate computational security. This monograph is a revised and extended version of the author's PhD thesis, the winning thesis of the 2000 ACM Doctoral Dissertation Competition. It is a comprehensive investigation of statistical zero-knowledge (SZK) proofs. It begins by showing that SZK has two natural complete problems, and then uses these complete problems to address a wide variety of fundamental questions about SZK. It also includes a chapter that surveys recent developments in the area, in particular how the results and techniques of this thesis have been extended to computational zero-knowledge proofs and arguments.The presentation offers clarity and intuition, assuming only a basic background in computational complexity and cryptography, and thus the book can bring a graduate student or a researcher in a related area up to date on this topic. At the same time, it includes clear statements of numerous open problems and research directions, which are likely to interest experts in the area.
Zero-knowledge interactive proofs play a central role in the design and study of cryptographic prools and are rich objects for complexity-theoretic study. Statistical zero-knowledge (SZK) proofs achieve strong information-theoretic "security", and can provide a clean test bed for the study of more general notions that incorporate computational security. This monograph is a revised and extended version of the author's PhD thesis, the winning thesis of the 2000 ACM Doctoral Dissertation Competition. It is a comprehensive investigation of statistical zero-knowledge (SZK) proofs. It begins by showing that SZK has two natural complete problems, and then uses these complete problems to address a wide variety of fundamental questions about SZK. It also includes a chapter that surveys recent developments in the area, in particular how the results and techniques of this thesis have been extended to computational zero-knowledge proofs and arguments.The presentation offers clarity and intuition, assuming only a basic background in computational complexity and cryptography, and thus the book can bring a graduate student or a researcher in a related area up to date on this topic. At the same time, it includes clear statements of numerous open problems and research directions, which are likely to interest experts in the area.
4
A Study of Statistical Zero-Knowledge Proofs (2019)
DE HC NWISBN: 9783540713739 bzw. 3540713735, in Deutsch, Springer, gebundenes Buch, neu.
Lieferung aus: Österreich, zzgl. Versandkosten.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
6
A Study of Statistical Zero-Knowledge Proofs (Information Security and Cryptography)
EN HC NWISBN: 9783540713739 bzw. 3540713735, in Englisch, 190 Seiten, 2014. Ausgabe, Springer, gebundenes Buch, neu.
Lieferung aus: Vereinigtes Königreich Großbritannien und Nordirland, Usually dispatched within 1 to 3 weeks.
Von Händler/Antiquariat, Amazon.co.uk.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Von Händler/Antiquariat, Amazon.co.uk.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Lade…