000			05523nam a22006615i 4500
001			978-3-642-11799-2
003			DE-He213
005			20240730201939.0
007			cr nn 008mamaa
008			100715s2010 gw | s |||| 0|eng d
020			_a9783642117992 _9978-3-642-11799-2
024	7		_a10.1007/978-3-642-11799-2 _2doi
050		4	_aQA268
072		7	_aGPJ _2bicssc
072		7	_aURY _2bicssc
072		7	_aCOM083000 _2bisacsh
072		7	_aGPJ _2thema
072		7	_aURY _2thema
082	0	4	_a005.824 _223
245	1	0	_aTheory of Cryptography _h[electronic resource] : _b7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9-11, 2010, Proceedings / _cedited by Daniele Micciancio.
250			_a1st ed. 2010.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2010.
300			_a607 p. 55 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aSecurity and Cryptology, _x2946-1863 ; _v5978
505	0		_aParallel Repetition -- An Efficient Parallel Repetition Theorem -- Parallel Repetition Theorems for Interactive Arguments -- Almost Optimal Bounds for Direct Product Threshold Theorem -- Obfuscation -- On Symmetric Encryption and Point Obfuscation -- Obfuscation of Hyperplane Membership -- Invited Talk -- Secure Computation and Its Diverse Applications -- Multiparty Computation -- On Complete Primitives for Fairness -- On the Necessary and Sufficient Assumptions for UC Computation -- From Passive to Covert Security at Low Cost -- CCA Security -- A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems -- Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs -- Threshold Cryptography and Secret Sharing -- Efficient, Robust and Constant-Round Distributed RSA Key Generation -- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems -- Ideal Hierarchical Secret Sharing Schemes -- Symmetric Cryptography -- A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch -- On Related-Secret Pseudorandomness -- A Domain Extender for the Ideal Cipher -- Delayed-Key Message Authentication for Streams -- Key-Leakage and Tamper-Resistance -- Founding Cryptography on Tamper-Proof Hardware Tokens -- Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens -- Leakage-Resilient Signatures -- Public-Key Encryption Schemes with Auxiliary Inputs -- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum -- Rationality and Privacy -- Rationality in the Full-Information Model -- Efficient Rational Secret Sharing in Standard Communication Networks -- Bounds on the Sample Complexity for Private Learning and Private Data Release -- Public-Key Encryption -- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts -- Robust Encryption -- Invited Talk -- Privacy-Enhancing Cryptography: From Theory into Practice -- Zero-Knowledge -- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs -- Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model -- Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge -- Efficiency Limitations for ?-Protocols for Group Homomorphisms -- Composition of Zero-Knowledge Proofs with Efficient Provers -- Private Coins versus Public Coins in Zero-Knowledge Proof Systems.
520			_aThis book constitutes the refereed proceedings of the Seventh Theory of Cryptography Conference, TCC 2010, held in Zurich, Switzerland, February 9-11, 2010. The 33 revised full papers presented together with two invited talks were carefully reviewed and selected from 100 submissions.The papers are organized in topical sections on parallel repetition, obfuscation, multiparty computation, CCA security, threshold cryptography and secret sharing, symmetric cryptography, key-leakage and tamper-resistance, rationality and privacy, public-key encryption, and zero-knowledge.
650		0	_aCryptography. _91973
650		0	_aData encryption (Computer science). _99168
650		0	_aComputer networks . _931572
650		0	_aCoding theory. _94154
650		0	_aInformation theory. _914256
650		0	_aData protection. _97245
650		0	_aComputer science _xMathematics. _93866
650		0	_aAlgorithms. _93390
650	1	4	_aCryptology. _931769
650	2	4	_aComputer Communication Networks. _9169419
650	2	4	_aCoding and Information Theory. _9169420
650	2	4	_aData and Information Security. _931990
650	2	4	_aMathematical Applications in Computer Science. _931683
650	2	4	_aAlgorithms. _93390
700	1		_aMicciancio, Daniele. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9169421
710	2		_aSpringerLink (Online service) _9169422
773	0		_tSpringer Nature eBook
776	0	8	_iPrinted edition: _z9783642117985
776	0	8	_iPrinted edition: _z9783642118005
830		0	_aSecurity and Cryptology, _x2946-1863 ; _v5978 _9169423
856	4	0	_uhttps://doi.org/10.1007/978-3-642-11799-2
912			_aZDB-2-SCS
912			_aZDB-2-SXCS
912			_aZDB-2-LNC
942			_cELN
999			_c96793 _d96793