Read more
The three-volume set LNCS 13042, LNCS 13043 and LNCS 13044 constitutes the refereed proceedings of the 19th International Conference on Theory of Cryptography, TCC 2021, held in Raleigh, NC, USA, in November 2021. The total of 66 full papers presented in this three-volume set was carefully reviewed and selected from 161 submissions. They cover topics on proof systems, attribute-based and functional encryption, obfuscation, key management and secure communication.
List of contents
Dory: Efficient, Transparent arguments for Generalised Inner Products and Polynomial Commitments.- On Communication-E cient Asynchronous MPC with Adaptive Security.- Efficient Perfectly Secure Computation with Optimal Resilience.- On Communication Models and Best-Achievable Security in Two-Round MPC.- Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation.- Blockchains Enable Non-Interactive MPC.- Multi-party PSM, Revisited: Improved Communication and Unbalanced Communication.- Multi-Party Functional Encryption.- Succinct LWE Sampling, Random Polynomials, and Obfuscation.- ABE for DFA from LWE against Bounded Collusions, Revisited.- Distributed Merkle's Puzzles.- Continuously Non-Malleable Secret Sharing: Joint Tampering, Plain Model and Capacity.- Disappearing Cryptography in the Bounded Storage Model.- Trojan-Resilience without Cryptography.- On Derandomizing Yao's Weak-to-Strong OWF Construction.- Simple Constructions from (Almost) Regular One-Way Functions.- On Treewidth, Separators and Yao's Garbling.- Oblivious Transfer from Trapdoor Permutations in Minimal Rounds.- The Cost of Adaptivity in Security Games on Graphs.- Concurrent Composition of Differential Privacy.- Direct Product Hardness Amplifcation.- On the (Ir)Replaceability of Global Setups, or How (Not) to Use a Global Ledger.- BKW Meets Fourier: New Algorithms for LPN with Sparse Parities.- Computational Robust (Fuzzy) Extractors for CRS-dependent Sources with Minimal Min-entropy.- Polynomial-time targeted attacks on coin-tossing for any number of corruptions.-
