default search action
15. TCC 2017: Baltimore, MD, USA
- Yael Kalai, Leonid Reyzin:
Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part II. Lecture Notes in Computer Science 10678, Springer 2017, ISBN 978-3-319-70502-6
Garbled Circuits and Oblivious RAM
- Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam:
Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model. 3-39 - Zahra Jafargholi, Alessandra Scafuro, Daniel Wichs:
Adaptively Indistinguishable Garbled Circuits. 40-71 - T.-H. Hubert Chan, Elaine Shi:
Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs. 72-107
Zero-Knowledge and Non-Malleability
- Wutichai Chongchitmate, Rafail Ostrovsky, Ivan Visconti:
Resettably-Sound Resettable Zero Knowledge in Constant Rounds. 111-138 - Dakshita Khurana:
Round Optimal Concurrent Non-malleability from Polynomial Hardness. 139-171 - Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
:
Zero Knowledge Protocols from Succinct Constraint Detection. 172-206
Leakage and Tampering
- Daniel Genkin, Yuval Ishai, Mor Weiss:
How to Construct a Leakage-Resilient (Stateless) Trusted Party. 209-244 - Saeed Mahloujifar, Mohammad Mahmoody
Blockwise p-Tampering Attacks on Cryptographic Primitives, Extractors, and Learners. 245-279
Delegation
- Omer Paneth, Guy N. Rothblum:
On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-interactive Arguments. 283-315
Non-Malleable Codes
- Divesh Aggarwal, Tomasz Kazana, Maciej Obremski:
Inception Makes Non-malleable Codes Stronger. 319-343 - Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu
Four-State Non-malleable Codes with Explicit Constant Rate. 344-375
Secret Sharing
- Ilan Komargodski, Anat Paskin-Cherniavsky:
Evolving Secret Sharing: Dynamic Thresholds and Robustness. 379-393 - Amos Beimel
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures. 394-423 - Kuan Cheng, Yuval Ishai, Xin Li:
Near-Optimal Secret Sharing and Error Correcting Codes in \mathsf AC^0 AC 0. 424-458
OT Combiners
- Ignacio Cascudo
Resource-Efficient OT Combiners with Active Security. 461-486
Signatures
- Rotem Tsabary:
An Equivalence Between Attribute-Based Signatures and Homomorphic Signatures, and New Constructions for Both. 489-518 - Manuel Fersch, Eike Kiltz
On the One-Per-Message Unforgeability of (EC)DSA and Its Variants. 519-534
Verifiable Random Functions
- Rishab Goyal, Susan Hohenberger, Venkata Koppula, Brent Waters:
A Generic Approach to Constructing and Proving Verifiable Random Functions. 537-566 - Nir Bitansky:
Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs. 567-594
Fully Homomorphic Encryption
- Long Chen, Zhenfeng Zhang, Xueqing Wang:
Batched Multi-hop Multi-key FHE from Ring-LWE with Compact Ciphertext Extension. 597-627
Database Privacy
- Ilya Mironov
Strengthening the Security of Encrypted Databases: Non-transitive JOINs. 631-661 - Elette Boyle, Yuval Ishai, Rafael Pass
Can We Access a Database Both Locally and Privately? 662-693 - Ran Canetti, Justin Holmgren, Silas Richelson:
Towards Doubly Efficient Private Information Retrieval. 694-726
Assumptions
- Srinivas Devadas, Ling Ren, Hanshen Xiao:
On Iterative Collision Search for LPN and Subset Sum. 729-746 - Alon Rosen, Gil Segev, Ido Shahaf:
Can PPAD Hardness be Based on Standard Cryptographic Assumptions? 747-776
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-04 19:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: