東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Advances in cryptology - CRYPTO 2021...

CRYPTO (Conference) (2021 :)

FindBook

Google Book

Amazon

博客來

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.
其他題名:	CRYPTO 2021
其他作者:	Malkin, Tal.
團體作者:	CRYPTO (Conference)
出版者:	Cham :Springer International Publishing : : 2021.,
面頁冊數:	xv, 732 p. :ill., digital ;24 cm.
內容註:	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.
Contained By:	Springer Nature eBook
標題:	Data encryption (Computer science) - Congresses. -
電子資源:	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] :CRYPTO 2021edited by Tal Malkin, Chris Peikert. - Cham :Springer International Publishing :2021. - xv, 732 p. :ill., digital ;24 cm. - Lecture notes in computer science,128280302-9743 ;. - Lecture notes in computer science ;12828..

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:

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 IV /
LDR:03774nmm a2200373 a 4500 001 2249050
003 DE-He213
005 20210812025144.0
006 m d
007 cr nn 008maaau
008 220103s2021 sz s 0 eng d
020 $a 9783030842598 $q (electronic bk.)
020 $a 9783030842581 $q (paper)
024 7 $a 10.1007/978-3-030-84259-8 $2 doi
035 $a 978-3-030-84259-8
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 IV / $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, 732 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12828
490 1 $a Security and cryptology
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) $v Congresses. $3 844473
650 0 $a Computer security $v Congresses. $3 622818
650 1 4 $a Cryptology. $3 3382308
650 2 4 $a Systems and Data Security. $3 898223
650 2 4 $a Computer Systems Organization and Communication Networks. $3 891212
650 2 4 $a Information Systems and Communication Service. $3 891044
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 12828. $3 3514086
830 0 $a Security and cryptology. $3 3382517
856 4 0 $u https://doi.org/10.1007/978-3-030-84259-8
950 $a Computer Science (SpringerNature-11645)