Theory of Cryptography : 11th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014. Proceedings
معرفی کتاب «Theory of Cryptography : 11th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014. Proceedings» نوشتهٔ Yehuda Lindell (ed.).، منتشرشده توسط نشر Springer-Verlag Berlin and Heidelberg GmbH &. این کتاب در فرمت pdf، زبان انگلیسی ارائه شده است.
This 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. Front Matter....Pages I-XVI Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding....Pages 1-25 Obfuscation for Evasive Functions....Pages 26-51 On Extractability Obfuscation....Pages 52-73 Two-Round Secure MPC from Indistinguishability Obfuscation....Pages 74-94 Chosen Ciphertext Security via Point Obfuscation....Pages 95-120 Probabilistically Checkable Proofs of Proximity with Zero-Knowledge....Pages 121-145 Achieving Constant Round Leakage-Resilient Zero-Knowledge....Pages 146-166 Statistical Concurrent Non-malleable Zero Knowledge....Pages 167-191 4-Round Resettably-Sound Zero Knowledge....Pages 192-216 Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?....Pages 217-239 On the Power of Public-Key Encryption in Secure Computation....Pages 240-264 On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations....Pages 265-290 Towards Characterizing Complete Fairness in Secure Two-Party Computation....Pages 291-316 On the Cryptographic Complexity of the Worst Functions....Pages 317-342 Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol....Pages 343-367 One-Sided Adaptively Secure Two-Party Computation....Pages 368-393 Multi-linear Secret-Sharing Schemes....Pages 394-418 Broadcast Amplification....Pages 419-439 Non-malleable Coding against Bit-Wise and Split-State Tampering....Pages 440-464 Continuous Non-malleable Codes....Pages 465-488 Locally Updatable and Locally Decodable Codes....Pages 489-514 Leakage Resilient Fully Homomorphic Encryption....Pages 515-539 Securing Circuits and Protocols against 1/poly( k ) Tampering Rate....Pages 540-565 How to Fake Auxiliary Input....Pages 566-590 Standard versus Selective Opening Security: Separation and Equivalence Results....Pages 591-615 Dual System Encryption via Predicate Encodings....Pages 616-637 (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens....Pages 638-662 Lower Bounds in the Hardware Token Model....Pages 663-687 Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures....Pages 688-712 On the Impossibility of Structure-Preserving Deterministic Primitives....Pages 713-738 Back Matter....Pages - This book constitutes the thoroughly refereed proceedings of the 10th Theory of Cryptography Conference, TCC 2013, held in Tokyo, Japan, in March 2013. The papers cover topics such as study of known paradigms, approaches, and techniques, directed towards their better understanding and utilization;
دانلود کتاب Theory of Cryptography : 11th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014. Proceedings