Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part II

Description

The two-volume set LNCS 10677 and LNCS 10678 constitutes the refereed proceedings of the 15th International Conference on Theory of Cryptography, TCC 2017, held in Baltimore, MD, USA, in November 2017. The total of 51 revised full papers presented in the proceedings were carefully reviewed and selected from 150 submissions. The Theory of Cryptography Conference deals with the paradigms, approaches, and techniques used to conceptualize natural cryptographic problems and provide algorithmic solutions to them and much more. Front Matter ....Pages I-XVII Front Matter ....Pages 1-1 Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model (Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam)....Pages 3-39 Adaptively Indistinguishable Garbled Circuits (Zahra Jafargholi, Alessandra Scafuro, Daniel Wichs)....Pages 40-71 Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs (T.-H. Hubert Chan, Elaine Shi)....Pages 72-107 Front Matter ....Pages 109-109 Resettably-Sound Resettable Zero Knowledge in Constant Rounds (Wutichai Chongchitmate, Rafail Ostrovsky, Ivan Visconti)....Pages 111-138 Round Optimal Concurrent Non-malleability from Polynomial Hardness (Dakshita Khurana)....Pages 139-171 Zero Knowledge Protocols from Succinct Constraint Detection (Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner)....Pages 172-206 Front Matter ....Pages 207-207 How to Construct a Leakage-Resilient (Stateless) Trusted Party (Daniel Genkin, Yuval Ishai, Mor Weiss)....Pages 209-244 Blockwise p-Tampering Attacks on Cryptographic Primitives, Extractors, and Learners (Saeed Mahloujifar, Mohammad Mahmoody)....Pages 245-279 Front Matter ....Pages 281-281 On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-interactive Arguments (Omer Paneth, Guy N. Rothblum)....Pages 283-315 Front Matter ....Pages 317-317 Inception Makes Non-malleable Codes Stronger (Divesh Aggarwal, Tomasz Kazana, Maciej Obremski)....Pages 319-343 Four-State Non-malleable Codes with Explicit Constant Rate (Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar)....Pages 344-375 Front Matter ....Pages 377-377 Evolving Secret Sharing: Dynamic Thresholds and Robustness (Ilan Komargodski, Anat Paskin-Cherniavsky)....Pages 379-393 Linear Secret-Sharing Schemes for Forbidden Graph Access Structures (Amos Beimel, Oriol Farràs, Yuval Mintz, Naty Peter)....Pages 394-423 Near-Optimal Secret Sharing and Error Correcting Codes in \(\mathsf {AC}^0\) (Kuan Cheng, Yuval Ishai, Xin Li)....Pages 424-458 Front Matter ....Pages 459-459 Resource-Efficient OT Combiners with Active Security (Ignacio Cascudo, Ivan Damgård, Oriol Farràs, Samuel Ranellucci)....Pages 461-486 Front Matter ....Pages 487-487 An Equivalence Between Attribute-Based Signatures and Homomorphic Signatures, and New Constructions for Both (Rotem Tsabary)....Pages 489-518 On the One-Per-Message Unforgeability of (EC)DSA and Its Variants (Manuel Fersch, Eike Kiltz, Bertram Poettering)....Pages 519-534 Front Matter ....Pages 535-535 A Generic Approach to Constructing and Proving Verifiable Random Functions (Rishab Goyal, Susan Hohenberger, Venkata Koppula, Brent Waters)....Pages 537-566 Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs (Nir Bitansky)....Pages 567-594 Front Matter ....Pages 595-595 Batched Multi-hop Multi-key FHE from Ring-LWE with Compact Ciphertext Extension (Long Chen, Zhenfeng Zhang, Xueqing Wang)....Pages 597-627 Front Matter ....Pages 629-629 Strengthening the Security of Encrypted Databases: Non-transitive JOINs (Ilya Mironov, Gil Segev, Ido Shahaf)....Pages 631-661 Can We Access a Database Both Locally and Privately? (Elette Boyle, Yuval Ishai, Rafael Pass, Mary Wootters)....Pages 662-693 Towards Doubly Efficient Private Information Retrieval (Ran Canetti, Justin Holmgren, Silas Richelson)....Pages 694-726 Front Matter ....Pages 727-727 On Iterative Collision Search for LPN and Subset Sum (Srinivas Devadas, Ling Ren, Hanshen Xiao)....Pages 729-746 Can PPAD Hardness be Based on Standard Cryptographic Assumptions? (Alon Rosen, Gil Segev, Ido Shahaf)....Pages 747-776 Back Matter ....Pages 777-778