國立虎尾科技大學 |

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, Part II /
其他作者:	Peikert, Chris.
面頁冊數:	XV, 822 p. 104 illus., 40 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Coding and Information Theory. -
電子資源:	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] :edited by Tal Malkin, Chris Peikert. - 1st ed. 2021. - XV, 822 p. 104 illus., 40 illus. in color.online resource. - Security and Cryptology ;12826. - Security and Cryptology ;9241.

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:

669784
Coding and Information Theory.

LC Class. No.: QA76.9.D335

Dewey Class. No.: 005.82

Advances in Cryptology – CRYPTO 2021 = 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part II /
LDR:04485nam a22004215i 4500 001 1054010
003 DE-He213
005 20210812025153.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030842451 $9 978-3-030-84245-1
024 7 $a 10.1007/978-3-030-84245-1 $2 doi
035 $a 978-3-030-84245-1
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.82 $2 23
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, Part II / $c edited by Tal Malkin, Chris Peikert.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XV, 822 p. 104 illus., 40 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Security and Cryptology ; $v 12826
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 2 4 $a Coding and Information Theory. $3 669784
650 2 4 $a Computer Systems Organization and Communication Networks. $3 669309
650 2 4 $a Information Systems and Communication Service. $3 669203
650 2 4 $a Mobile and Network Security. $3 1211619
650 1 4 $a Cryptology. $3 1211076
650 0 $a Information theory. $3 595305
650 0 $a Coding theory. $3 561460
650 0 $a Computer organization. $3 596298
650 0 $a Computers. $3 565115
650 0 $a Computer networks $x Security measures. $3 555385
650 0 $a Data encryption (Computer science). $3 1051084
700 1 $a Peikert, Chris. $e editor. $1 https://orcid.org/0000-0003-0419-7501 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1358977
700 1 $a Malkin, Tal. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 679930
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030842444
776 0 8 $i Printed edition: $z 9783030842468
830 0 $a Security and Cryptology ; $v 9241 $3 1254069
856 4 0 $u https://doi.org/10.1007/978-3-030-84245-1
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)