國立虎尾科技大學 |

Advances in Cryptology – CRYPTO 2021 = 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part IV /

紀錄類型:	書目-語言資料,印刷品 : 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 IV /
其他作者:	Malkin, Tal.
面頁冊數:	XV, 732 p. 112 illus., 24 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Data encryption (Computer science). -
電子資源:	https://doi.org/10.1007/978-3-030-84259-8
ISBN:	9783030842598

Advances in Cryptology – CRYPTO 2021 = 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part IV /
Advances in Cryptology – CRYPTO 202141st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part IV /[electronic resource] :edited by Tal Malkin, Chris Peikert. - 1st ed. 2021. - XV, 732 p. 112 illus., 24 illus. in color.online resource. - Security and Cryptology ;12828. - Security and Cryptology ;9241.

Zero Knowledge -- Witness Authenticating NIZKs and Applications -- Towards a Unified Approach to Black-Box Constructions of Zero-Knowledge Proofs -- Compressing Proofs of k-Out-Of-n Partial Knowledge -- Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions -- Time- and Space-Efficient Arguments from Groups of Unknown Order -- Encryption++ -- Broadcast Encryption with Size N1/3 and More from k-Lin -- Fine-grained Secure Attribute-based Encryption -- Multi-Input Quadratic Functional Encryption from Pairings -- Functional Encryption for Turing Machines with Dynamic Bounded Collusion from LWE -- Receiver-Anonymity in Reradomizable RCCA-Secure Cryptosystems Resolved -- Foundations -- White Box Traitor Tracing -- Does Fiat-Shamir Require a Cryptographic Hash Function? -- Composition with Knowledge Assumptions -- Non-Interactive Batch Arguments for NP from Standard Assumptions -- Targeted Lossy Functions and Applications -- The t-wise Independence of Substitution-Permutation Networks -- Low-Complexity Cryptography -- Low-Complexity Weak Pseudorandom Functions in AC0[MOD2] -- MPC-Friendly Symmetric Cryptography from Alternating Moduli: Candidates, Protocols, and Applications -- No Time to Hash: On Super-Efficient Entropy Accumulation -- Protocols -- A Logarithmic Lower Bound for Oblivious RAM (for all parameters) -- Oblivious RAM with Worst-Case Logarithmic Overhead -- Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwidth and Time -- Authenticated Key Exchange and Signatures with Tight Security in the Standard Model -- KHAPE: Asymmetric PAKE from Key-Hiding Key Exchange.

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: 9783030842598

Standard No.: 10.1007/978-3-030-84259-8doiSubjects--Topical Terms:

1051084
Data encryption (Computer science).

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 IV /
LDR:04040nam a22004215i 4500 001 1054012
003 DE-He213
005 20210812025144.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030842598 $9 978-3-030-84259-8
024 7 $a 10.1007/978-3-030-84259-8 $2 doi
035 $a 978-3-030-84259-8
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 IV / $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, 732 p. 112 illus., 24 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 12828
505 0 $a Zero Knowledge -- Witness Authenticating NIZKs and Applications -- Towards a Unified Approach to Black-Box Constructions of Zero-Knowledge Proofs -- Compressing Proofs of k-Out-Of-n Partial Knowledge -- Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions -- Time- and Space-Efficient Arguments from Groups of Unknown Order -- Encryption++ -- Broadcast Encryption with Size N1/3 and More from k-Lin -- Fine-grained Secure Attribute-based Encryption -- Multi-Input Quadratic Functional Encryption from Pairings -- Functional Encryption for Turing Machines with Dynamic Bounded Collusion from LWE -- Receiver-Anonymity in Reradomizable RCCA-Secure Cryptosystems Resolved -- Foundations -- White Box Traitor Tracing -- Does Fiat-Shamir Require a Cryptographic Hash Function? -- Composition with Knowledge Assumptions -- Non-Interactive Batch Arguments for NP from Standard Assumptions -- Targeted Lossy Functions and Applications -- The t-wise Independence of Substitution-Permutation Networks -- Low-Complexity Cryptography -- Low-Complexity Weak Pseudorandom Functions in AC0[MOD2] -- MPC-Friendly Symmetric Cryptography from Alternating Moduli: Candidates, Protocols, and Applications -- No Time to Hash: On Super-Efficient Entropy Accumulation -- Protocols -- A Logarithmic Lower Bound for Oblivious RAM (for all parameters) -- Oblivious RAM with Worst-Case Logarithmic Overhead -- Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwidth and Time -- Authenticated Key Exchange and Signatures with Tight Security in the Standard Model -- KHAPE: Asymmetric PAKE from Key-Hiding Key Exchange.
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). $3 1051084
650 0 $a Computer security. $3 557122
650 0 $a Computer organization. $3 596298
650 0 $a Computers. $3 565115
650 0 $a Coding theory. $3 561460
650 0 $a Information theory. $3 595305
650 1 4 $a Cryptology. $3 1211076
650 2 4 $a Systems and Data Security. $3 677062
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 Coding and Information Theory. $3 669784
700 1 $a Malkin, Tal. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 679930
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
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030842581
776 0 8 $i Printed edition: $z 9783030842604
830 0 $a Security and Cryptology ; $v 9241 $3 1254069
856 4 0 $u https://doi.org/10.1007/978-3-030-84259-8
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)