000			05594nam a22005535i 4500
001			978-3-642-14623-7
003			DE-He213
005			20140220084543.0
007			cr nn 008mamaa
008			100810s2010 gw | s |||| 0|eng d
020			_a9783642146237 _9978-3-642-14623-7
024	7		_a10.1007/978-3-642-14623-7 _2doi
050		4	_aQA76.9.A25
072		7	_aURY _2bicssc
072		7	_aCOM053000 _2bisacsh
082	0	4	_a005.82 _223
100	1		_aRabin, Tal. _eeditor.
245	1	0	_aAdvances in Cryptology – CRYPTO 2010 _h[electronic resource] : _b30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010. Proceedings / _cedited by Tal Rabin.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010.
300			_aXIV, 744p. 63 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aLecture Notes in Computer Science, _x0302-9743 ; _v6223
505	0		_aLeakage -- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability -- Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks -- Protecting Cryptographic Keys against Continual Leakage -- Securing Computation against Continuous Leakage -- Lattice -- An Efficient and Parallel Gaussian Sampler for Lattices -- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE -- Homomorphic Encryption -- Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness -- Additively Homomorphic Encryption with d-Operand Multiplications -- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits -- Theory and Applications -- Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography -- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption -- Structure-Preserving Signatures and Commitments to Group Elements -- Efficient Indifferentiable Hashing into Ordinary Elliptic Curves -- Key Exchange, OAEP/RSA, CCA -- Credential Authenticated Identification and Key Exchange -- Password-Authenticated Session-Key Generation on the Internet in the Plain Model -- Instantiability of RSA-OAEP under Chosen-Plaintext Attack -- Efficient Chosen-Ciphertext Security via Extractable Hash Proofs -- Attacks -- Factorization of a 768-Bit RSA Modulus -- Correcting Errors in RSA Private Keys -- Improved Differential Attacks for ECHO and Grøstl -- A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony -- Composition -- Universally Composable Incoercibility -- Concurrent Non-Malleable Zero Knowledge Proofs -- Equivalence of Uniform Key Agreement and Composition Insecurity -- Computation Delegation and Obfuscation -- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers -- Improved Delegation of Computation Using Fully Homomorphic Encryption -- Oblivious RAM Revisited -- On Strong Simulation and Composable Point Obfuscation -- Multiparty Computation -- Protocols for Multiparty Coin Toss with Dishonest Majority -- Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost -- Secure Multiparty Computation with Minimal Interaction -- A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security -- Pseudorandomness -- On Generalized Feistel Networks -- Cryptographic Extraction and Key Derivation: The HKDF Scheme -- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs -- Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks -- Quantum -- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries -- On the Efficiency of Classical and Quantum Oblivious Transfer Reductions -- Sampling in a Quantum Population, and Applications.
520			_aThis book constitutes the refereed proceedings of the 30th Annual International Cryptology Conference, CRYPTO 2010, held in Santa Barbara, CA, USA in August 2010, co-located with CHES 2010, the workshop on Cryptographic Hardware and Embedded Systems. The 39 revised full papers presented were carefully reviewed and selected from 203 submissions. Addressing all current foundational, theoretical and research aspects of cryptology, cryptography, and cryptanalysis as well as advanced applications, the papers are organized in topical sections on leakage, lattice, homomorphic encryption, theory and applications, key exchange, OAEP/RSA, CCA, attacks, composition, computation delegation and obfuscation, multiparty computation, pseudorandomness, and quantum.
650		0	_aComputer science.
650		0	_aComputer Communication Networks.
650		0	_aData protection.
650		0	_aData encryption (Computer science).
650		0	_aComputational complexity.
650		0	_aInformation Systems.
650	1	4	_aComputer Science.
650	2	4	_aData Encryption.
650	2	4	_aManagement of Computing and Information Systems.
650	2	4	_aComputer Communication Networks.
650	2	4	_aSystems and Data Security.
650	2	4	_aComputers and Society.
650	2	4	_aDiscrete Mathematics in Computer Science.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642146220
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v6223
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-642-14623-7
912			_aZDB-2-SCS
912			_aZDB-2-LNC
999			_c112515 _d112515