LEADER 04668nam 22007815 450 001 9910357840603321 005 20251225195022.0 010 $a3-030-36030-X 024 7 $a10.1007/978-3-030-36030-6 035 $a(CKB)4100000009939735 035 $a(MiAaPQ)EBC5984033 035 $a(DE-He213)978-3-030-36030-6 035 $a(PPN)257357971 035 $a(EXLCZ)994100000009939735 100 $a20191122d2019 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $2rdacontent 182 $2rdamedia 183 $2rdacarrier 200 10$aTheory of Cryptography $e17th International Conference, TCC 2019, Nuremberg, Germany, December 1?5, 2019, Proceedings, Part I /$fedited by Dennis Hofheinz, Alon Rosen 205 $a1st ed. 2019. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2019. 215 $a1 online resource (611 pages) 225 1 $aSecurity and Cryptology,$x2946-1863 ;$v11891 311 08$a3-030-36029-6 320 $aIncludes bibliographical references and index. 327 $aAlgebraically Structured LWE, Revisited -- Lattice Trapdoors and IBE from Middle-Product LWE -- Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation -- Obfuscated Fuzzy Hamming Distance and Conjunctions from Subset Product Problems -- A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement -- Synchronous Consensus with Optimal Asynchronous Fallback Guarantees -- Predicate Encryption from Bilinear Maps and One-Sided Probabilistic Rank -- Optimal Bounded-Collusion Secure Functional Encryption -- From FE Combiners to Secure MPC and Back -- (Pseudo) Random Quantum States with Binary Phase -- General Linear Group Action on Tensors: A Candidate for Post-Quantum Cryptography -- Composable and Finite Computational Security of Quantum Message Transmission -- On Fully Secure MPC with Solitary Output -- Secure Computation with Preprocessing via Function Secret Sharing -- Efficient Private PEZ Protocols for Symmetric Functions -- TheFunction-Inversion Problem: Barriers and Opportunities -- On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations -- Characterizing Collision and Second-Preimage Resistance in Linicrypt -- Efficient Information-Theoretic Secure Multiparty Computation over Z/pkZ via Galois Rings -- Is Information-Theoretic Topology-Hiding Computation Possible -- Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation -- On Perfectly Secure 2PC in the OT-Hybrid Model. 330 $aThe two-volume set LNCS 11891 and 11892 constitutes the proceedings of the 17th International Conference on Theory of Cryptography, TCC 2019, held in Nuremberg, Germany, in December 2019. The 43 full papers presented were carefully reviewed and selected from 147 submissions. The Theory of Cryptography Conference deals with the paradigms, approaches, and techniques used to conceptualize natural cryptographic problems and provide algorithmic solutions to them and much more. 410 0$aSecurity and Cryptology,$x2946-1863 ;$v11891 606 $aCryptography 606 $aData encryption (Computer science) 606 $aComputer networks 606 $aApplication software 606 $aData structures (Computer science) 606 $aInformation theory 606 $aData protection 606 $aComputers 606 $aCryptology 606 $aComputer Communication Networks 606 $aComputer and Information Systems Applications 606 $aData Structures and Information Theory 606 $aData and Information Security 606 $aComputing Milieux 615 0$aCryptography. 615 0$aData encryption (Computer science). 615 0$aComputer networks. 615 0$aApplication software. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 0$aData protection. 615 0$aComputers. 615 14$aCryptology. 615 24$aComputer Communication Networks. 615 24$aComputer and Information Systems Applications. 615 24$aData Structures and Information Theory. 615 24$aData and Information Security. 615 24$aComputing Milieux. 676 $a005.82 702 $aHofheinz$b Dennis$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRosen$b Alon$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910357840603321 996 $aTheory of Cryptography$93000229 997 $aUNINA