Advances in Cryptology – ASIACRYPT 2020
Springer International Publishing (Verlag)
978-3-030-64839-8 (ISBN)
The total of 85 full papers presented in these proceedings was carefully reviewed and selected from 316 submissions. The papers were organized in topical sections as follows:
Part I: Best paper awards; encryption schemes.- post-quantum cryptography; cryptanalysis; symmetric key cryptography; message authentication codes; side-channel analysis.
Part II: public key cryptography; lattice-based cryptography; isogeny-based cryptography; quantum algorithms; authenticated key exchange.
Part III: multi-party computation; secret sharing; attribute-based encryption; updatable encryption; zero knowledge; blockchains and contact tracing.
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.
| Erscheinungsdatum | 04.01.2021 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Security and Cryptology |
| Zusatzinfo | XV, 904 p. 153 illus., 31 illus. in color. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 1383 g |
| Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
| Schlagworte | Access Control • Applications • authentication • ciphertexts • Communication • Computer Networks • Computer Science • conference proceedings • cryptography • Data Mining • data privacy • Data Security • Encryption • Informatics • Information Theory • Network Protocols • Network Security • privacy • Public Key Cryptography • Research • Signal Processing |
| ISBN-10 | 3-030-64839-7 / 3030648397 |
| ISBN-13 | 978-3-030-64839-8 / 9783030648398 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
