LEADER 04873nam 22007935 450 001 9910483136803321 005 20251226203757.0 010 $a3-642-54242-5 024 7 $a10.1007/978-3-642-54242-8 035 $a(CKB)3710000000089214 035 $a(DE-He213)978-3-642-54242-8 035 $a(SSID)ssj0001187570 035 $a(PQKBManifestationID)11754727 035 $a(PQKBTitleCode)TC0001187570 035 $a(PQKBWorkID)11270990 035 $a(PQKB)11014682 035 $a(MiAaPQ)EBC3093096 035 $a(PPN)176751645 035 $a(EXLCZ)993710000000089214 100 $a20140203d2014 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aTheory of Cryptography $e11th International Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014, Proceedings /$fedited by Yehuda Lindell 205 $a1st ed. 2014. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2014. 215 $a1 online resource (XVI, 739 p. 59 illus.) 225 1 $aSecurity and Cryptology,$x2946-1863 ;$v8349 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-54241-7 327 $aVirtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding -- Obfuscation for Evasive Functions -- On Extractability Obfuscation -- Two-Round Secure MPC from Indistinguishability Obfuscation -- Chosen Ciphertext Security via Point Obfuscation -- Probabilistically Checkable Proofs of Proximity with Zero-Knowledge -- Achieving Constant Round Leakage-Resilient Zero-Knowledge -- Statistical Concurrent Non-malleable Zero Knowledge -- 4-Round Resettably-Sound Zero Knowledge -- Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? -- On the Power of Public-Key Encryption in Secure Computation -- On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations -- Towards Characterizing Complete Fairness in Secure Two-Party Computation -- On the Cryptographic Complexity of the Worst Functions -- Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol -- One-Sided Adaptively Secure Two-Party Computation -- Multi-linear Secret-Sharing -- Broadcast Amplification -- Non-malleable Coding against Bit-Wise and Split-State Tampering -- Continuous Non-malleable Codes -- Locally Updatable and Locally Decodable Codes -- Leakage Resilient Fully Homomorphic Encryption -- Securing Circuits and Protocols against 1/ poly(k) Tampering Rate -- How to Fake Auxiliary Input -- Standard versus Selective Opening Security: Separation and Equivalence Results -- Dual System Encryption via Predicate Encodings -- (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens -- Lower Bounds in the Hardware Token Model -- Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures -- On the Impossibility of Structure-Preserving Deterministic Primitives. 330 $aThis book constitutes the refereed proceedings of the 11th Theory of Cryptography Conference, TCC 2014, held in San Diego, CA, USA, in February 2014. The 30 revised full papers presented were carefully reviewed and selected from 90 submissions. The papers are organized in topical sections on obfuscation, applications of obfuscation, zero knowledge, black-box separations, secure computation, coding and cryptographic applications, leakage, encryption, hardware-aided secure protocols, and encryption and signatures. 410 0$aSecurity and Cryptology,$x2946-1863 ;$v8349 606 $aCryptography 606 $aData encryption (Computer science) 606 $aData protection 606 $aComputer science 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aCryptology 606 $aData and Information Security 606 $aTheory of Computation 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 615 0$aCryptography. 615 0$aData encryption (Computer science). 615 0$aData protection. 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 14$aCryptology. 615 24$aData and Information Security. 615 24$aTheory of Computation. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 676 $a005.8 702 $aLindell$b Yehuda$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aTheory of Cryptography Conference 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483136803321 996 $aTheory of Cryptography$93000229 997 $aUNINA