Advances in Cryptology - Crypto 2021: 41st Annual International Cryptology Conference, Crypto 2021, Virtual Event, August 16-20, 2021, Proceedings, Pa

ISBN-13: 9783030842444 / Angielski / Miękka / 2021 / 810 str.

Tal Malkin; Chris Peikert

Spis treści

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's Universal 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.