LEADER 07260nam 22008655 450 001 9910484218603321 005 20251226203029.0 010 $a3-642-14623-6 024 7 $a10.1007/978-3-642-14623-7 035 $a(CKB)2670000000036343 035 $a(SSID)ssj0000446245 035 $a(PQKBManifestationID)11297654 035 $a(PQKBTitleCode)TC0000446245 035 $a(PQKBWorkID)10491042 035 $a(PQKB)10350775 035 $a(DE-He213)978-3-642-14623-7 035 $a(MiAaPQ)EBC3065631 035 $a(PPN)149018029 035 $a(BIP)31646384 035 $a(EXLCZ)992670000000036343 100 $a20100810d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAdvances in Cryptology -- CRYPTO 2010 $e30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010, Proceedings /$fedited by Tal Rabin 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XIV, 744 p. 63 illus.) 225 1 $aSecurity and Cryptology,$x2946-1863 ;$v6223 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-14622-8 320 $aIncludes bibliographical references and index. 327 $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. 330 $aCRYPTO2010, the30thAnnualInternationalCryptologyConference, wassp- sored by the International Association for Cryptologic Research (IACR) in - operation with the IEEE Computer Society Technical Committee on Security and Privacy and the Computer Science Department of the University of C- ifornia at Santa Barbara. The conference was held in Santa Barbara, Calif- nia, during August 15-19, 2010, in conjunction with CHES 2010 (Workshop on Cryptographic Hardware and Embedded Systems). Zul'kar Ramzan served as the General Chair. The conference received 203 submissions. The quality of the submissions was very high, and the selection process was a challenging one. The Program C- mittee, aided by a 159 external reviewers, reviewed the submissions and after an intensive review period the committee accepted 41 of these submissions. Three submissions were merged into a single paper and two papers were merged into a single talk, yielding a total of 39 papers in the proceedings and 38 presen- tions at the conference. The revised versions of the 39 papers appearing in the proceedings were not subject to editorial review and the authors bear full - sponsibility for their contents. The best-paper award was awarded to the paper "Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness" by Craig Gentry. The conference featured two invited presentations. This year we celebrated 25 years from the publication of the ground-breaking work of Sha? Goldwasser, Silvio Micali and Charles Racko? "The Knowledge Complexity of Interactive Proof-Systems. 410 0$aSecurity and Cryptology,$x2946-1863 ;$v6223 606 $aCryptography 606 $aData encryption (Computer science) 606 $aElectronic data processing$xManagement 606 $aComputer networks 606 $aData protection 606 $aComputers and civilization 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aCryptology 606 $aIT Operations 606 $aComputer Communication Networks 606 $aData and Information Security 606 $aComputers and Society 606 $aDiscrete Mathematics in Computer Science 615 0$aCryptography. 615 0$aData encryption (Computer science). 615 0$aElectronic data processing$xManagement. 615 0$aComputer networks. 615 0$aData protection. 615 0$aComputers and civilization. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 14$aCryptology. 615 24$aIT Operations. 615 24$aComputer Communication Networks. 615 24$aData and Information Security. 615 24$aComputers and Society. 615 24$aDiscrete Mathematics in Computer Science. 676 $a005.8 701 $aRabin$b Tal$01757814 712 12$aCRYPTO (Conference) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484218603321 996 $aAdvances in cryptology--CRYPTO 2010$94195780 997 $aUNINA