Muutke küpsiste eelistusi

E-raamat: Advances in Cryptology - CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part I

Edited by , Edited by
  • Formaat: EPUB+DRM
  • Sari: Security and Cryptology 12825
  • Ilmumisaeg: 11-Aug-2021
  • Kirjastus: Springer Nature Switzerland AG
  • Keel: eng
  • ISBN-13: 9783030842420
  • Formaat - EPUB+DRM
  • Hind: 122,88 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Formaat: EPUB+DRM
  • Sari: Security and Cryptology 12825
  • Ilmumisaeg: 11-Aug-2021
  • Kirjastus: Springer Nature Switzerland AG
  • Keel: eng
  • ISBN-13: 9783030842420

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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.
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 S-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.