Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 20

Lossiness and Entropic Hardness for Ring-LWE.- Multi-key Fully-Homomorphic Encryption in the Plain Model.- Constant Ciphertext-Rate Non-Committing Encryption from Standard Assumptions.- Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and CP-ABE for Circuits (and more) in the Symmetric Key Setting.- Optimal Broadcast Encryption from LWE and Pairings in the Standard Model.- Equipping Public-Key Cryptographic Primitives with Watermarking (or: A Hole Is to Watermark).- Functional Encryption for Quadratic Functions from k-Lin, Revisited.- On Perfect Correctness in (Lockable) Obfuscation.- Can a Public Blockchain Keep a Secret.- Blockchains from Non-Idealized Hash Functions.- Ledger Combiners for Fast Asynchronous Byzantine Agreement with Subquadratic Communication.- Expected Constant Round Byzantine Broadcast under Dishonest Majority.- Round-Efficient Byzantine Broadcast under Strongly Adaptive and Majority Corruptions.- A Lower Bound for One-Round Oblivious RAM.- Lower Bounds for Multi-Server Oblivious RAMs.- On Computational Shortcuts for Information-Theoretic PIR.- Characterizing Deterministic-Prover Zero Knowledge.- NIZK from SNARG.- Weakly Extractable One-Way Functions.- Towards Non-Interactive Witness Hiding.- FHE-Based Bootstrapping of Designated-Prover NIZK.- Perfect Zero Knowledge: New Upperbounds and Relativized Separations.