LEADER 04647nam 22007455 450 001 9910447246303321 005 20251225190541.0 010 $a3-030-64381-6 024 7 $a10.1007/978-3-030-64381-2 035 $a(CKB)5340000000066975 035 $a(DE-He213)978-3-030-64381-2 035 $a(MiAaPQ)EBC6424521 035 $a(PPN)252514513 035 $a(EXLCZ)995340000000066975 100 $a20201212d2020 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aTheory of Cryptography $e18th International Conference, TCC 2020, Durham, NC, USA, November 16?19, 2020, Proceedings, Part III /$fedited by Rafael Pass, Krzysztof Pietrzak 205 $a1st ed. 2020. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2020. 215 $a1 online resource (XII, 673 p. 395 illus., 11 illus. in color.) 225 1 $aSecurity and Cryptology,$x2946-1863 ;$v12552 311 08$a3-030-64380-8 327 $aUniversal Composition with Global Subroutines: Capturing Global Setup within plain UC -- Security analysis of SPAKE2+ -- Schrödinger's Pirate: How To Trace a Quantum Decoder -- Quantum Encryption with Certified Deletion -- Secure Quantum Extraction Protocols -- Non-interactive Classical Verification of Quantum Computation -- Classical Verification of Quantum Computations with Efficient Verifier -- Coupling of Random Systems -- Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity -- Zero-Communication Reductions -- Lower Bounds on the Time/Memory Tradeoff of Function Inversion -- Super-Linear Time-Memory Trade-Offs for Symmetric Encryption -- Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions -- On the Security of Time-Lock Puzzles and Timed Commitments -- Expected-Time Cryptography: Generic Techniques and Applications to Concrete Soundness -- On the Complexity of Arithmetic Secret Sharing -- Robust Secret Sharing with AlmostOptimal Share Size and Security Against Rushing Adversaries -- The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs -- Transparent Error Correcting in a Computationally Bounded World -- New Techniques in Replica Encodings with Client Setup. 330 $aThis three-volume set, LNCS 12550, 12551, and 12552, constitutes the refereed proceedings of the 18th International Conference on Theory of Cryptography, TCCC 2020, held in Durham, NC, USA, in November 2020. The total of 71 full papers presented in this three-volume set was carefully reviewed and selected from 167 submissions. Amongst others they cover the following topics: study of known paradigms, approaches, and techniques, directed towards their better understanding and utilization; discovery of new paradigms, approaches and techniques that overcome limitations of the existing ones, formulation and treatment of new cryptographic problems; study of notions of security and relations among them; modeling and analysis of cryptographic algorithms; and study of the complexity assumptions used in cryptography. Due to the Corona pandemic this event was held virtually. 410 0$aSecurity and Cryptology,$x2946-1863 ;$v12552 606 $aCryptography 606 $aData encryption (Computer science) 606 $aApplication software 606 $aComputer networks$xSecurity measures 606 $aData protection 606 $aComputer networks 606 $aComputer systems 606 $aCryptology 606 $aComputer and Information Systems Applications 606 $aMobile and Network Security 606 $aData and Information Security 606 $aComputer Communication Networks 606 $aComputer System Implementation 615 0$aCryptography. 615 0$aData encryption (Computer science). 615 0$aApplication software. 615 0$aComputer networks$xSecurity measures. 615 0$aData protection. 615 0$aComputer networks. 615 0$aComputer systems. 615 14$aCryptology. 615 24$aComputer and Information Systems Applications. 615 24$aMobile and Network Security. 615 24$aData and Information Security. 615 24$aComputer Communication Networks. 615 24$aComputer System Implementation. 676 $a005.82 702 $aPass$b Rafael 702 $aPietrzak$b Krzysztof 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910447246303321 996 $aTheory of Cryptography$93000229 997 $aUNINA