東華大學圖書館 |

Advances in cryptology - CRYPTO 2021 = 41st Annual International Cryptology Conference, CRYPTO 2021, virtual event, August 16-20, 2021 : proceedings.. Part II /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Advances in cryptology - CRYPTO 2021/ edited by Tal Malkin, Chris Peikert.
其他題名:	41st Annual International Cryptology Conference, CRYPTO 2021, virtual event, August 16-20, 2021 : proceedings.
其他題名:	CRYPTO 2021
其他作者:	Malkin, Tal.
團體作者:	CRYPTO (Conference)
出版者:	Cham :Springer International Publishing : : 2021.,
面頁冊數:	xv, 822 p. :ill., digital ;24 cm.
內容註:	Multi-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's Universal 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.
Contained By:	Springer Nature eBook
標題:	Data encryption (Computer science) - Congresses. -
電子資源:	https://doi.org/10.1007/978-3-030-84245-1
ISBN:	9783030842451

Advances in cryptology - CRYPTO 2021 = 41st Annual International Cryptology Conference, CRYPTO 2021, virtual event, August 16-20, 2021 : proceedings.. Part II /
Advances in cryptology - CRYPTO 202141st Annual International Cryptology Conference, CRYPTO 2021, virtual event, August 16-20, 2021 : proceedings.Part II /[electronic resource] :CRYPTO 2021edited by Tal Malkin, Chris Peikert. - Cham :Springer International Publishing :2021. - xv, 822 p. :ill., digital ;24 cm. - Lecture notes in computer science,128260302-9743 ;. - Lecture notes in computer science ;12826..

Multi-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's Universal 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.

The 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.

ISBN: 9783030842451

Standard No.: 10.1007/978-3-030-84245-1doiSubjects--Topical Terms:

844473
Data encryption (Computer science)
--Congresses.

LC Class. No.: QA76.9.D335

Dewey Class. No.: 005.824

Advances in cryptology - CRYPTO 2021 = 41st Annual International Cryptology Conference, CRYPTO 2021, virtual event, August 16-20, 2021 : proceedings.. Part II /
LDR:04219nmm a2200373 a 4500 001 2249048
003 DE-He213
005 20210812025153.0
006 m d
007 cr nn 008maaau
008 220103s2021 sz s 0 eng d
020 $a 9783030842451 $q (electronic bk.)
020 $a 9783030842444 $q (paper)
024 7 $a 10.1007/978-3-030-84245-1 $2 doi
035 $a 978-3-030-84245-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.D335
072 7 $a GPJ $2 bicssc
072 7 $a COM053000 $2 bisacsh
072 7 $a GPJ $2 thema
072 7 $a URY $2 thema
082 0 4 $a 005.824 $2 23
090 $a QA76.9.D335 $b C957 2021
111 2 $a CRYPTO (Conference) $n (41st : $d 2021 : $c Online) $3 3514081
245 1 0 $a Advances in cryptology - CRYPTO 2021 $h [electronic resource] : $b 41st Annual International Cryptology Conference, CRYPTO 2021, virtual event, August 16-20, 2021 : proceedings. $n Part II / $c edited by Tal Malkin, Chris Peikert.
246 3 $a CRYPTO 2021
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xv, 822 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12826
490 1 $a Security and cryptology
505 0 $a Multi-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's Universal 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 $a The 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 $a Data encryption (Computer science) $v Congresses. $3 844473
650 0 $a Computer security $v Congresses. $3 622818
650 1 4 $a Cryptology. $3 3382308
650 2 4 $a Mobile and Network Security. $3 3382377
650 2 4 $a Information Systems and Communication Service. $3 891044
650 2 4 $a Computer Systems Organization and Communication Networks. $3 891212
650 2 4 $a Coding and Information Theory. $3 891252
700 1 $a Malkin, Tal. $3 900560
700 1 $a Peikert, Chris. $3 3514082
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 12826. $3 3514084
830 0 $a Security and cryptology. $3 3382517
856 4 0 $u https://doi.org/10.1007/978-3-030-84245-1
950 $a Computer Science (SpringerNature-11645)