LEADER 04526nam 22007815 450 001 9910508435903321 005 20251225180513.0 010 $a3-030-90459-8 024 7 $a10.1007/978-3-030-90459-3 035 $a(MiAaPQ)EBC6799455 035 $a(Au-PeEL)EBL6799455 035 $a(CKB)19410944100041 035 $a(OCoLC)1284915078 035 $a(PPN)258838566 035 $a(BIP)82142434 035 $a(BIP)81776735 035 $a(DE-He213)978-3-030-90459-3 035 $a(EXLCZ)9919410944100041 100 $a20211105d2021 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aTheory of Cryptography $e19th International Conference, TCC 2021, Raleigh, NC, USA, November 8?11, 2021, Proceedings, Part I /$fedited by Kobbi Nissim, Brent Waters 205 $a1st ed. 2021. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021. 215 $a1 online resource (799 pages) 225 1 $aSecurity and Cryptology,$x2946-1863 ;$v13042 311 08$aPrint version: Nissim, Kobbi Theory of Cryptography Cham : Springer International Publishing AG,c2021 9783030904586 320 $aIncludes bibliographical references and index. 327 $aSecure Quantum Computation with Classical Communication -- Secure Software Leasing from Standard Assumptions -- Post-quantum Resettably-Sound Zero Knowledge -- Secure Software Leasing Without Assumptions -- The Round Complexity of Quantum Zero-Knowledge -- Rate-1 Quantum Fully Homomorphic Encryption -- Unifying Presampling via Concentration Bounds -- Quantum Key-length Extension -- Relationships between quantum IND-CPA notions -- Classical Binding for Quantum Commitments -- Unclonable Encryption, Revisited -- Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs -- Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness -- Tight Security Bounds for Micali's SNARGs -- Acyclicity Programming for Sigma-Protocols.-Statistical ZAPs from Group-Based Assumptions -- Generalized Proofs of Knowledge with Fully Dynamic Setup -- Fully-succinct Publicly Verifiable Delegation from Constant-Size Assumptions -- On expected polynomial runtime in cryptography.-Information-Theoretically Secure MPC against Mixed Dynamic Adversaries -- Round-Efficient Byzantine Agreement and Multi-Party Computation with Asynchronous Fallback -- Two-Round Maliciously Secure Computation with Super-Polynomial Simulation -- Adaptive Security of Multi-Party Protocols, Revisited.-On Actively-Secure Elementary MPC Reductions -- Environmentally Friendly Composable Multi-Party Computation in the Plain Model from Standard (Timed) Assumptions.-. 330 $aThe three-volume set LNCS 13042, LNCS 13043 and LNCS 13044 constitutes the refereed proceedings of the 19th International Conference on Theory of Cryptography, TCC 2021, held in Raleigh, NC, USA, in November 2021. The total of 66 full papers presented in this three-volume set was carefully reviewed and selected from 161 submissions. They cover topics on proof systems, attribute-based and functional encryption, obfuscation, key management and secure communication. 410 0$aSecurity and Cryptology,$x2946-1863 ;$v13042 606 $aCryptography 606 $aData encryption (Computer science) 606 $aCoding theory 606 $aInformation theory 606 $aComputer engineering 606 $aComputer networks 606 $aData protection 606 $aCryptology 606 $aCoding and Information Theory 606 $aComputer Engineering and Networks 606 $aComputer Communication Networks 606 $aData and Information Security 615 0$aCryptography. 615 0$aData encryption (Computer science) 615 0$aCoding theory. 615 0$aInformation theory. 615 0$aComputer engineering. 615 0$aComputer networks. 615 0$aData protection. 615 14$aCryptology. 615 24$aCoding and Information Theory. 615 24$aComputer Engineering and Networks. 615 24$aComputer Communication Networks. 615 24$aData and Information Security. 676 $a005.82 702 $aNissim$b Kobbi 702 $aWaters$b Brent R.$f1978- 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910508435903321 996 $aTheory of Cryptography$93000229 997 $aUNINA