000			05457nam a22006495i 4500
001			978-3-030-84245-1
003			DE-He213
005			20240730171901.0
007			cr nn 008mamaa
008			210809s2021 sz | s |||| 0|eng d
020			_a9783030842451 _9978-3-030-84245-1
024	7		_a10.1007/978-3-030-84245-1 _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	_aAdvances in Cryptology - CRYPTO 2021 _h[electronic resource] : _b41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part II / _cedited by Tal Malkin, Chris Peikert.
250			_a1st ed. 2021.
264		1	_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2021.
300			_aXV, 822 p. 104 illus., 40 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 ; _v12826
505	0		_aMulti-Party Computation -- Game-Theoretic Fairness Meets Multi-Party Protocols: The Case of Leader Election -- Computational Hardness of Optimal Fair Computation: Beyond Minicrypt -- You Only Speak Once: Secure MPC with Stateless Ephemeral Roles -- Fluid MPC: Secure Multiparty Computation with Dynamic Participants -- Secure Computation from One-Way Noisy Communication, or: Anti-Correlation via Anti-Concentration -- Broadcast-Optimal Two Round MPC with an Honest Majority -- Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer -- On the Round Complexity of Black-Box Secure MPC -- ATLAS: Efficient and Scalable MPC in the Honest Majority Setting -- Unconditional Communication-Efficient MPC via Hall's Marriage Theorem -- Non-Interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and Extensions -- Efficient Information-Theoretic Multi-Party Computation over Non-Commutative Rings -- Pushing the Limits of Valiant'sUniversal Circuits: Simpler, Tighter and More Compact -- Oblivious Key-Value Stores and Amplification for Private Set Intersection -- MHz2k: MPC from HE over ℤ2k with New Packing, Simpler Reshare, and Better ZKP -- Sublinear GMW-Style Compiler for MPC with Preprocessing -- Limits on the Adaptive Security of Yao's Garbling -- Lattice Cryptography -- Subtractive Sets over Cyclotomic Rings: Limits of Schnorr-like Arguments over Lattices -- A Compressed Sigma-Protocol Theory for Lattices -- A New Simple Technique to Bootstrap Various Lattice Zero-Knowledge Proofs to QROM Secure NIZKs -- SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions -- Deniable Fully Homomorphic Encryption from Learning With Errors -- Lattice Cryptanalysis -- Counterexamples to New Circular Security Assumptions Underlying iO -- How to Meet Ternary LWE Keys -- Lattice Reduction with Approximate Enumeration Oracles: Practical Algorithms and Concrete Performance -- Towards faster polynomial-time lattice reduction -- Lower bounds on lattice sieving and information set decoding.
520			_aThe four-volume set, LNCS 12825, LNCS 12826, LNCS 12827, and LNCS 12828, constitutes the refereed proceedings of the 41st Annual International Cryptology Conference, CRYPTO 2021. Crypto has traditionally been held at UCSB every year, but due to the COVID-19 pandemic it was an online event in 2021. The 103 full papers presented in the proceedings were carefully reviewed and selected from a total of 426 submissions. The papers are organized in the following topical sections: Part I: Award Papers; Signatures; Quantum Cryptography; Succinct Arguments. Part II: Multi-Party Computation; Lattice Cryptography; and Lattice Cryptanalysis. Part III: Models; Applied Cryptography and Side Channels; Cryptanalysis; Codes and Extractors; Secret Sharing. Part IV: Zero Knowledge; Encryption++; Foundations; Low-Complexity Cryptography; Protocols.
650		0	_aCryptography. _91973
650		0	_aData encryption (Computer science). _99168
650		0	_aComputer networks _xSecurity measures. _93969
650		0	_aComputer engineering. _910164
650		0	_aComputer networks . _931572
650		0	_aCoding theory. _94154
650		0	_aInformation theory. _914256
650	1	4	_aCryptology. _931769
650	2	4	_aMobile and Network Security. _933624
650	2	4	_aComputer Engineering and Networks. _9100763
650	2	4	_aComputer Engineering and Networks. _9100763
650	2	4	_aCoding and Information Theory. _9100765
700	1		_aMalkin, Tal. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9100767
700	1		_aPeikert, Chris. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9100769
710	2		_aSpringerLink (Online service) _9100771
773	0		_tSpringer Nature eBook
776	0	8	_iPrinted edition: _z9783030842444
776	0	8	_iPrinted edition: _z9783030842468
830		0	_aSecurity and Cryptology, _x2946-1863 ; _v12826 _9100772
856	4	0	_uhttps://doi.org/10.1007/978-3-030-84245-1
912			_aZDB-2-SCS
912			_aZDB-2-SXCS
912			_aZDB-2-LNC
942			_cELN
999			_c87868 _d87868