000			05064nam a22006735i 4500
001			978-3-030-64378-2
003			DE-He213
005			20240730175020.0
007			cr nn 008mamaa
008			201212s2020 sz | s |||| 0|eng d
020			_a9783030643782 _9978-3-030-64378-2
024	7		_a10.1007/978-3-030-64378-2 _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] : _b18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part II / _cedited by Rafael Pass, Krzysztof Pietrzak.
250			_a1st ed. 2020.
264		1	_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2020.
300			_aXII, 715 p. 139 illus., 25 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 ; _v12551
505	0		_aProof-Carrying Data from Accumulation Schemes -- Linear-Time Arguments with Sublinear Verification from Tensor Codes -- Barriers for Succinct Arguments in the Random Oracle Model -- Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires Interaction -- Batch Verification and Proofs of Proximity with Polylog Overhead -- Batch Verification for Statistical Zero Knowledge Proofs -- Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads -- On the Price of Concurrency in Group Ratcheting Protocols -- Stronger Security and Constructions of Multi-Designated Verifier Signatures -- Continuous Group Key Agreement with Active Security -- Round Optimal Secure Multiparty Computation from Minimal Assumptions -- Reusable Two-Round MPC from DDH -- Mr NISC: Multiparty Reusable Non-Interactive Secure Computation -- Secure Massively Parallel Computation for Dishonest Majority -- Towards Multiparty Computation Withstanding Coercion of All Parties -- SynchronousConstructive Cryptography -- Topology-Hiding Communication from Minimal Assumptions. -- Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More -- On Statistical Security in Two-Party Computation -- The Resiliency of MPC with Low Interaction: The Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures -- On the Power of an Honest Majority in Three-Party Computation Without Broadcast -- A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity -- On the Round Complexity of the Shuffle Model.
520			_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.
650		0	_aCryptography. _91973
650		0	_aData encryption (Computer science). _99168
650		0	_aSoftware engineering. _94138
650		0	_aData structures (Computer science). _98188
650		0	_aInformation theory. _914256
650		0	_aComputer networks _xSecurity measures. _93969
650		0	_aData protection. _97245
650		0	_aComputer networks . _931572
650	1	4	_aCryptology. _931769
650	2	4	_aSoftware Engineering. _94138
650	2	4	_aData Structures and Information Theory. _931923
650	2	4	_aMobile and Network Security. _933624
650	2	4	_aData and Information Security. _931990
650	2	4	_aComputer Communication Networks. _9115106
700	1		_aPass, Rafael. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9115107
700	1		_aPietrzak, Krzysztof. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9115108
710	2		_aSpringerLink (Online service) _9115109
773	0		_tSpringer Nature eBook
776	0	8	_iPrinted edition: _z9783030643775
776	0	8	_iPrinted edition: _z9783030643799
830		0	_aSecurity and Cryptology, _x2946-1863 ; _v12551 _9115110
856	4	0	_uhttps://doi.org/10.1007/978-3-030-64378-2
912			_aZDB-2-SCS
912			_aZDB-2-SXCS
912			_aZDB-2-LNC
942			_cELN
999			_c89741 _d89741