Theory of Cryptography

Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding.- Obfuscation for Evasive Functions.- On Extractability Obfuscation.- Two-Round Secure MPC from Indistinguishability Obfuscation.- Chosen Ciphertext Security via Point Obfuscation.- Probabilistically Checkable Proofs of Proximity with Zero-Knowledge.- Achieving Constant Round Leakage-Resilient Zero-Knowledge.- Statistical Concurrent Non-malleable Zero Knowledge.- 4-Round Resettably-Sound Zero Knowledge.- Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?.- On the Power of Public-Key Encryption in Secure Computation.- On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations.- Towards Characterizing Complete Fairness in Secure Two-Party Computation.- On the Cryptographic Complexity of the Worst Functions.- Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol.- One-Sided Adaptively Secure Two-Party Computation.- Multi-linear Secret-Sharing.- Broadcast Amplification.- Non-malleable Coding against Bit-Wise and Split-State Tampering.- Continuous Non-malleable Codes.- Locally Updatable and Locally Decodable Codes.- Leakage Resilient Fully Homomorphic Encryption.- Securing Circuits and Protocols against 1/ poly(k) Tampering Rate.- How to Fake Auxiliary Input.- Standard versus Selective Opening Security: Separation and Equivalence Results.- Dual System Encryption via Predicate Encodings.- (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens.- Lower Bounds in the Hardware Token Model.- Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures.- On the Impossibility of Structure-Preserving Deterministic Primitives.