000			03436nam a22005175i 4500
001			978-3-540-32939-8
003			DE-He213
005			20160614135408.0
007			cr nn 008mamaa
008			100301s2006 gw | s |||| 0|eng d
020			_a9783540329398 _9978-3-540-32939-8
024	7		_a10.1007/3-540-32939-0 _2doi
049			_aAlfaisal Main Library
050		4	_aQA76.6-76.66
072		7	_aUM _2bicssc
072		7	_aCOM051000 _2bisacsh
082	0	4	_a005.11 _223
100	1		_aRosen, Alon. _eauthor.
245	1	0	_aConcurrent Zero-Knowledge _h[electronic resource] : _bWith Additional Background by Oded Goldreich / _cby Alon Rosen.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2006.
300			_aXIV, 184 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aInformation Security and Cryptography, Texts and Monographs, _x1619-7100
505	0		_aA 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			_aZero-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	_aComputer science.
650		0	_aComputer programming.
650		0	_aData structures (Computer science).
650		0	_aComputers.
650	1	4	_aComputer Science.
650	2	4	_aProgramming Techniques.
650	2	4	_aData Structures, Cryptology and Information Theory.
650	2	4	_aTheory of Computation.
655		7	_aElectronic books. _2local
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540329381
830		0	_aInformation Security and Cryptography, Texts and Monographs, _x1619-7100
856	4	0	_uhttp://ezproxy.alfaisal.edu/login?url=http://dx.doi.org/10.1007/3-540-32939-0
912			_aZDB-2-SCS
942			_2lcc _cEBOOKS
999			_c248162 _d248162