000 | 05161nam a22006495i 4500 | ||
---|---|---|---|
001 | 978-3-030-84242-0 | ||
003 | DE-He213 | ||
005 | 20240730175740.0 | ||
007 | cr nn 008mamaa | ||
008 | 210807s2021 sz | s |||| 0|eng d | ||
020 |
_a9783030842420 _9978-3-030-84242-0 |
||
024 | 7 |
_a10.1007/978-3-030-84242-0 _2doi |
|
050 | 4 | _aQA268 | |
072 | 7 |
_aGPJ _2bicssc |
|
072 | 7 |
_aURY _2bicssc |
|
072 | 7 |
_aCOM083000 _2bisacsh |
|
072 | 7 |
_aGPJ _2thema |
|
072 | 7 |
_aURY _2thema |
|
082 | 0 | 4 |
_a005.824 _223 |
245 | 1 | 0 |
_aAdvances in Cryptology - CRYPTO 2021 _h[electronic resource] : _b41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part I / _cedited by Tal Malkin, Chris Peikert. |
250 | _a1st ed. 2021. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2021. |
|
300 |
_aXV, 805 p. 58 illus., 1 illus. in color. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aSecurity and Cryptology, _x2946-1863 ; _v12825 |
|
505 | 0 | _aInvited 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 Σ-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 | _aThe 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 |
_aCryptography. _91973 |
|
650 | 0 |
_aData encryption (Computer science). _99168 |
|
650 | 0 |
_aComputer engineering. _910164 |
|
650 | 0 |
_aComputer networks . _931572 |
|
650 | 0 |
_aComputer networks _xSecurity measures. _93969 |
|
650 | 0 |
_aCoding theory. _94154 |
|
650 | 0 |
_aInformation theory. _914256 |
|
650 | 1 | 4 |
_aCryptology. _931769 |
650 | 2 | 4 |
_aComputer Engineering and Networks. _9117757 |
650 | 2 | 4 |
_aMobile and Network Security. _933624 |
650 | 2 | 4 |
_aComputer Engineering and Networks. _9117757 |
650 | 2 | 4 |
_aCoding and Information Theory. _9117758 |
700 | 1 |
_aMalkin, Tal. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9117759 |
|
700 | 1 |
_aPeikert, Chris. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9117760 |
|
710 | 2 |
_aSpringerLink (Online service) _9117761 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783030842413 |
776 | 0 | 8 |
_iPrinted edition: _z9783030842437 |
830 | 0 |
_aSecurity and Cryptology, _x2946-1863 ; _v12825 _9117762 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-84242-0 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c90041 _d90041 |