000 04384nam a22006495i 4500
001 978-3-030-90459-3
003 DE-He213
005 20240730180654.0
007 cr nn 008mamaa
008 211105s2021 sz | s |||| 0|eng d
020 _a9783030904593
_9978-3-030-90459-3
024 7 _a10.1007/978-3-030-90459-3
_2doi
050 4 _aQA268
072 7 _aGPJ
_2bicssc
072 7 _aURY
_2bicssc
072 7 _aCOM083000
_2bisacsh
072 7 _aGPJ
_2thema
072 7 _aURY
_2thema
082 0 4 _a005.824
_223
245 1 0 _aTheory of Cryptography
_h[electronic resource] :
_b19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021, Proceedings, Part I /
_cedited by Kobbi Nissim, Brent Waters.
250 _a1st ed. 2021.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2021.
300 _aXVI, 785 p. 89 illus., 13 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSecurity and Cryptology,
_x2946-1863 ;
_v13042
505 0 _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.-.
520 _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.
650 0 _aCryptography.
_91973
650 0 _aData encryption (Computer science).
_99168
650 0 _aCoding theory.
_94154
650 0 _aInformation theory.
_914256
650 0 _aComputer engineering.
_910164
650 0 _aComputer networks .
_931572
650 0 _aData protection.
_97245
650 1 4 _aCryptology.
_931769
650 2 4 _aCoding and Information Theory.
_9121295
650 2 4 _aComputer Engineering and Networks.
_9121296
650 2 4 _aComputer Communication Networks.
_9121297
650 2 4 _aData and Information Security.
_931990
700 1 _aNissim, Kobbi.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9121298
700 1 _aWaters, Brent.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9121299
710 2 _aSpringerLink (Online service)
_9121300
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030904586
776 0 8 _iPrinted edition:
_z9783030904609
830 0 _aSecurity and Cryptology,
_x2946-1863 ;
_v13042
_9121301
856 4 0 _uhttps://doi.org/10.1007/978-3-030-90459-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c90443
_d90443