Advances in Cryptology – CRYPTO 2021
Springer International Publishing (Verlag)
978-3-030-84244-4 (ISBN)
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.
Multi-Party Computation.- Game-Theoretic Fairness Meets Multi-Party Protocols: The Case of Leader Election.- Computational Hardness of Optimal Fair Computation: Beyond Minicrypt.- You Only Speak Once: Secure MPC with Stateless Ephemeral Roles.- Fluid MPC: Secure Multiparty Computation with Dynamic Participants.- Secure Computation from One-Way Noisy Communication, or: Anti-Correlation via Anti-Concentration.- Broadcast-Optimal Two Round MPC with an Honest Majority.- Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer.- On the Round Complexity of Black-Box Secure MPC.- ATLAS: Efficient and Scalable MPC in the Honest Majority Setting.- Unconditional Communication-Efficient MPC via Hall's Marriage Theorem.- Non-Interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and Extensions.- Efficient Information-Theoretic Multi-Party Computation over Non-Commutative Rings.- Pushing the Limits of Valiant'sUniversal Circuits: Simpler, Tighter and More Compact.- Oblivious Key-Value Stores and Amplification for Private Set Intersection.- MHz2k: MPC from HE over 2k with New Packing, Simpler Reshare, and Better ZKP.- Sublinear GMW-Style Compiler for MPC with Preprocessing.- Limits on the Adaptive Security of Yao's Garbling.- Lattice Cryptography.- Subtractive Sets over Cyclotomic Rings: Limits of Schnorr-like Arguments over Lattices.- A Compressed Sigma-Protocol Theory for Lattices.- A New Simple Technique to Bootstrap Various Lattice Zero-Knowledge Proofs to QROM Secure NIZKs.- SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions.- Deniable Fully Homomorphic Encryption from Learning With Errors.- Lattice Cryptanalysis.- Counterexamples to New Circular Security Assumptions Underlying iO.- How to Meet Ternary LWE Keys.- Lattice Reduction with Approximate Enumeration Oracles: Practical Algorithms and Concrete Performance.- Towards faster polynomial-time lattice reduction.- Lower bounds on lattice sieving and information set decoding.
| Erscheinungsdatum | 11.08.2021 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Security and Cryptology |
| Zusatzinfo | XV, 822 p. 104 illus., 40 illus. in color. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 1246 g |
| Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
| Schlagworte | Applications • Artificial Intelligence • authentication • Communication Protocols • Computer Science • Computer Security • conference proceedings • cryptography • Data communication systems • Data Mining • Data Security • distributed computer systems • Encryption • Informatics • Information Theory • multiparty computation • Network Protocols • Network Security • privacy preserving • Public Key Cryptography • Research • secure multi-party computation • Telecommunication Systems |
| ISBN-10 | 3-030-84244-4 / 3030842444 |
| ISBN-13 | 978-3-030-84244-4 / 9783030842444 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
