國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Advances in cryptology - CRYPTO 2021...

(1998 :)

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

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Advances in cryptology - CRYPTO 2021edited by Tal Malkin, Chris Peikert.
其他題名:	41st Annual International Cryptology Conference, CRYPTO 2021, virtual event, August 16-20, 2021 : proceedings.
其他題名:	CRYPTO 2021
其他作者:	Malkin, Tal.
團體作者:
出版者:	Cham :Springer International Publishing :2021.
面頁冊數:	xv, 805 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Data encryption (Computer science)
電子資源:	https://doi.org/10.1007/978-3-030-84242-0
ISBN:	9783030842420

Advances in cryptology - CRYPTO 202141st Annual International Cryptology Conference, CRYPTO 2021, virtual event, August 16-20, 2021 : proceedings.Part I /
Advances in cryptology - CRYPTO 202141st Annual International Cryptology Conference, CRYPTO 2021, virtual event, August 16-20, 2021 : proceedings.Part I /[electronic resource] :CRYPTO 2021edited by Tal Malkin, Chris Peikert. - Cham :Springer International Publishing :2021. - xv, 805 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,128250302-9743 ;. - Lecture notes in computer science ;4891..

Invited Talk -- Which e-voting problems do we need to solve? -- Award Papers -- On the Possibility of Basing Cryptography on EXP6 ≠ BPP -- Linear Cryptanalysis of FF3-1 and FEA -- Efficient Key Recovery for all HFE Signature Variants -- Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits -- Signatures -- Threshold Schnorr with Stateless Deterministic Signing from Standard Assumptions -- Two-Round Trip Schnorr Multi-Signatures via Delinearized Witnesses -- MuSig2: Simple Two-Round Schnorr Multi-Signatures -- Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for E-Protocols -- DualRing: Generic Construction of Ring Signatures with Efficient Instantiations -- Compact Ring Signatures from Learning With Errors -- Quantum Cryptography -- A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds -- On the Concurrent Composition of Quantum Zero-Knowledge -- Multi-theorem Designated-Verifier NIZK for QMA -- On the Round Complexity of Secure Quantum Computation -- Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort -- One-Way Functions Imply Secure Computation in a Quantum World -- Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits -- New Approaches for Quantum Copy-Protection -- Hidden Cosets and Applications to Unclonable Cryptography -- On Tight Quantum Security of HMAC and NMAC in the Quantum Random Oracle Model -- Quantum Collision Attacks on Reduced SHA-256 and SHA-512 -- Succinct Arguments -- Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments -- Proof-Carrying Data without Succinct Arguments -- Subquadratic SNARGs in the Random Oracle Model -- Sumcheck Arguments and their Applications -- An Algebraic Framework for Universal and Updatable SNARKs.

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

Standard No.: 10.1007/978-3-030-84242-0doiSubjects--Topical Terms:

184520
Data encryption (Computer science)

LC Class. No.: QA76.9.D335

Dewey Class. No.: 005.824

Advances in cryptology - CRYPTO 202141st Annual International Cryptology Conference, CRYPTO 2021, virtual event, August 16-20, 2021 : proceedings.Part I /
LDR:03935nmm a2200373 a 4500 001 607853
003 DE-He213
005 20210811233539.0
006 m d
007 cr nn 008maaau
008 220119s2021 sz s 0 eng d
020 $a 9783030842420 $q (electronic bk.)
020 $a 9783030842413 $q (paper)
024 7 $a 10.1007/978-3-030-84242-0 $2 doi
035 $a 978-3-030-84242-0
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 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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 I / $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, 805 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12825
490 1 $a Security and cryptology
505 0 $a Invited Talk -- Which e-voting problems do we need to solve? -- Award Papers -- On the Possibility of Basing Cryptography on EXP6 ≠ BPP -- Linear Cryptanalysis of FF3-1 and FEA -- Efficient Key Recovery for all HFE Signature Variants -- Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits -- Signatures -- Threshold Schnorr with Stateless Deterministic Signing from Standard Assumptions -- Two-Round Trip Schnorr Multi-Signatures via Delinearized Witnesses -- MuSig2: Simple Two-Round Schnorr Multi-Signatures -- Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for E-Protocols -- DualRing: Generic Construction of Ring Signatures with Efficient Instantiations -- Compact Ring Signatures from Learning With Errors -- Quantum Cryptography -- A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds -- On the Concurrent Composition of Quantum Zero-Knowledge -- Multi-theorem Designated-Verifier NIZK for QMA -- On the Round Complexity of Secure Quantum Computation -- Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort -- One-Way Functions Imply Secure Computation in a Quantum World -- Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits -- New Approaches for Quantum Copy-Protection -- Hidden Cosets and Applications to Unclonable Cryptography -- On Tight Quantum Security of HMAC and NMAC in the Quantum Random Oracle Model -- Quantum Collision Attacks on Reduced SHA-256 and SHA-512 -- Succinct Arguments -- Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments -- Proof-Carrying Data without Succinct Arguments -- Subquadratic SNARGs in the Random Oracle Model -- Sumcheck Arguments and their Applications -- An Algebraic Framework for Universal and Updatable SNARKs.
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 184520
650 0 $a Computer security $v Congresses. $3 383239
650 1 4 $a Cryptology. $3 825728
650 2 4 $a Information Systems and Communication Service. $3 274025
650 2 4 $a Mobile and Network Security. $3 825732
650 2 4 $a Computer Systems Organization and Communication Networks. $3 273709
650 2 4 $a Coding and Information Theory. $3 273763
700 1 $a Malkin, Tal. $3 277551
700 1 $a Peikert, Chris. $3 905008
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Security and cryptology. $3 822028
856 4 0 $u https://doi.org/10.1007/978-3-030-84242-0
950 $a Computer Science (SpringerNature-11645)