Vor Ort
Merkzettel Warenkorb
Produktbild: Advances in Cryptology – ASIACRYPT 2020
Band 12493

Advances in Cryptology – ASIACRYPT 2020 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7–11, 2020, Proceedings, Part III

Aus der Reihe Security and Cryptology

99,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

05.12.2020

Herausgeber

Shiho Moriai + weitere

Verlag

Springer

Seitenzahl

904

Maße (L/B/H)

23,5/15,5/4,9 cm

Gewicht

1364 g

Auflage

1st edition 2020

Sprache

Englisch

ISBN

978-3-030-64839-8

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

05.12.2020

Herausgeber

Verlag

Springer

Seitenzahl

904

Maße (L/B/H)

23,5/15,5/4,9 cm

Gewicht

1364 g

Auflage

1st edition 2020

Sprache

Englisch

ISBN

978-3-030-64839-8

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Advances in Cryptology – ASIACRYPT 2020

  • Multi-Party Computation.- MOTIF: (Almost) Free Branching in GMW via Vector-Scalar Multiplication.- Maliciously Secure Matrix Multiplication with Applications to Private Deep Learning.- On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation.- MPC with Synchronous Security and Asynchronous Responsiveness.- Secure MPC: Laziness Leads to GOD.- Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z=pk Z.- Towards E ciency-Preserving Round Compression in MPC: Do fewer rounds mean more computation.- Circuit Amortization Friendly Encodings and their Application to Statistically Secure Multiparty Computation.- Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs.- Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security.- Secret Sharing.- ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing.- Secret-Shared Shu e.- Attribute-Based Encryption.- Adaptively Secure Inner Product Encryption from LWE.- Unbounded Dynamic Predicate Compositions in ABE from Standard Assumptions.- Succinct and Adaptively Secure ABE for Arithmetic Branching Programs from k-Lin.- Inner-Product Functional Encryption with Fine-Grained Access Control.- MoniPoly|An Expressive q-SDH-Based Anonymous Attribute-Based Credential System.- Updatable Encryption.- The Direction of Updatable Encryption does not Matter Much.- Improving Speed and Security in Updatable Encryption Schemes.- CCA Updatable Encryption Against Malicious Re-Encryption Attacks.- Determining the Core Primitive for Optimally Secure Ratcheting.- Zero Knowledge.- Cryptography from One-Way Communication: On Completeness of Finite Channels.- Succinct Functional Commitment for a Large Class of Arithmetic Circuits.- Crowd Veri able Zero-Knowledge and End-to-end Verifiable Multiparty Computation.- Non-Interactive Composition of Sigma-Protocols via Share-then-Hash.- Succinct Diophantine-Satisfiability Arguments.- Individual Simulations.- Blockchains and Contact Tracing.- KVaC: Key-Value Commitments for Blockchains and Beyond.- Catalic: Delegated PSI Cardinality with Applications to Contact Tracing.