|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
978-3-540-32939-8 |
003 |
DE-He213 |
005 |
20220113014350.0 |
007 |
cr nn 008mamaa |
008 |
100301s2006 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540329398
|9 978-3-540-32939-8
|
024 |
7 |
|
|a 10.1007/3-540-32939-0
|2 doi
|
050 |
|
4 |
|a QA76.6-76.66
|
072 |
|
7 |
|a UM
|2 bicssc
|
072 |
|
7 |
|a COM051000
|2 bisacsh
|
072 |
|
7 |
|a UM
|2 thema
|
082 |
0 |
4 |
|a 005.11
|2 23
|
100 |
1 |
|
|a Rosen, Alon.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
245 |
1 |
0 |
|a Concurrent Zero-Knowledge
|h [electronic resource] :
|b With Additional Background by Oded Goldreich /
|c by Alon Rosen.
|
250 |
|
|
|a 1st ed. 2006.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2006.
|
300 |
|
|
|a XIV, 184 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Information Security and Cryptography,
|x 2197-845X
|
505 |
0 |
|
|a 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).
|
520 |
|
|
|a 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.
|
650 |
|
0 |
|a Computer programming.
|
650 |
|
0 |
|a Data structures (Computer science).
|
650 |
|
0 |
|a Information theory.
|
650 |
|
0 |
|a Computer science.
|
650 |
1 |
4 |
|a Programming Techniques.
|
650 |
2 |
4 |
|a Data Structures and Information Theory.
|
650 |
2 |
4 |
|a Theory of Computation.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer Nature eBook
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642069499
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540821656
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540329381
|
830 |
|
0 |
|a Information Security and Cryptography,
|x 2197-845X
|
856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/3-540-32939-0
|z Texto Completo
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-SXCS
|
950 |
|
|
|a Computer Science (SpringerNature-11645)
|
950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|