LEADER 05310nam 22008175 450 001 9910483826803321 005 20251226202523.0 010 $a3-662-53641-2 024 7 $a10.1007/978-3-662-53641-4 035 $a(CKB)3710000000926191 035 $a(DE-He213)978-3-662-53641-4 035 $a(MiAaPQ)EBC6287722 035 $a(MiAaPQ)EBC5591608 035 $a(Au-PeEL)EBL5591608 035 $a(OCoLC)961321895 035 $a(PPN)196323371 035 $a(EXLCZ)993710000000926191 100 $a20161021d2016 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aTheory of Cryptography $e14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part I /$fedited by Martin Hirt, Adam Smith 205 $a1st ed. 2016. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2016. 215 $a1 online resource (XVI, 692 p. 85 illus.) 225 1 $aSecurity and Cryptology,$x2946-1863 ;$v9985 311 08$a3-662-53640-4 320 $aIncludes bibliographical references and index. 327 $aTCC Test-of-Time Award -- From Indifferentiability to Constructive Cryptography (and Back) -- Foundations -- Fast Pseudorandom Functions Based on Expander Graphs -- 3-Message Zero Knowledge Against Human Ignorance -- The GGM Function Family is a Weakly One-Way Family of Functions -- On the (In)security of SNARKs in the Presence of Oracles -- Leakage Resilient One-Way Functions: The Auxiliary-Input Setting -- Simulating Auxiliary Inputs, Revisited -- Unconditional Security -- Pseudoentropy: Lower-bounds for Chain rules and Transformations -- Oblivious Transfer from Any Non-Trivial Elastic Noisy Channel via Secret Key Agreement -- Simultaneous Secrecy and Reliability Amplification for a General Channel Model -- Proof of Space from Stacked Expanders -- Perfectly Secure Message Transmission in Two Rounds -- Foundations of Multi-Party Protocols -- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious -- Binary AMD Circuits from Secure Multiparty Computation -- Composable Security in the Tamper-Proof Hardware Model under Minimal Complexity -- Composable Adaptive Secure Protocols without Setup under Polytime Assumptions -- Adaptive Security of Yao?s Garbled Circuits -- Round Complexity and Efficiency of Multi-Party Computation -- Efficient Secure Multiparty Computation with Identifiable Abort -- Secure Multiparty RAM Computation in Constant Rounds -- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model -- More Efficient Constant-Round Multi-Party Computation from BMR and SHE -- Cross&Clean: Amortized Garbled Circuits With Constant Overhead -- Differential Privacy -- Separating Computational and Statistical Differential Privacy in the Client-Server Model -- Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds -- Strong Hardness of Privacy from Weak Traitor Tracing. . 330 $aThe two-volume set LNCS 9985 and LNCS 9986 constitutes the refereed proceedings of the 14th International Conference on Theory of Cryptography, TCC 2016-B, held in Beijing, China, in November 2016. The total of 45 revised full papers presented in the proceedings were carefully reviewed and selected from 113 submissions. The papers were organized in topical sections named: TCC test-of-time award; foundations; unconditional security; foundations of multi-party protocols; round complexity and efficiency of multi-party computation; differential privacy; delegation and IP; public-key encryption; obfuscation and multilinear maps; attribute-based encryption; functional encryption; secret sharing; new models. 410 0$aSecurity and Cryptology,$x2946-1863 ;$v9985 606 $aCryptography 606 $aData encryption (Computer science) 606 $aData protection 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aElectronic data processing$xManagement 606 $aComputer networks 606 $aCryptology 606 $aData and Information Security 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aIT Operations 606 $aComputer Communication Networks 615 0$aCryptography. 615 0$aData encryption (Computer science). 615 0$aData protection. 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aElectronic data processing$xManagement. 615 0$aComputer networks. 615 14$aCryptology. 615 24$aData and Information Security. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aIT Operations. 615 24$aComputer Communication Networks. 676 $a005.82 702 $aHirt$b Martin$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSmith$b Adam$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483826803321 996 $aTheory of Cryptography$93000229 997 $aUNINA