International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Papers from TCC 2017

Year
Venue
Title
2017
TCC
A Generic Approach to Constructing and Proving Verifiable Random Functions
Rishab Goyal Susan Hohenberger Venkata Koppula Brent Waters
2017
TCC
A Modular Analysis of the Fujisaki-Okamoto Transformation
Dennis Hofheinz Kathrin Hövelmanns Eike Kiltz
2017
TCC
A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models
Susumu Kiyoshima Huijia Lin Muthuramakrishnan Venkitasubramaniam
2017
TCC
Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model
Carmit Hazay Yuval Ishai Muthuramakrishnan Venkitasubramaniam
2017
TCC
Adaptively Indistinguishable Garbled Circuits
Zahra Jafargholi Alessandra Scafuro Daniel Wichs
2017
TCC
An Equivalence Between Attribute-Based Signatures and Homomorphic Signatures, and New Constructions for Both
Rotem Tsabary
2017
TCC
Attribute-Hiding Predicate Encryption in Bilinear Groups, Revisited
Hoeteck Wee
2017
TCC
Bandwidth Hard Functions for ASIC Resistance
Ling Ren Srinivas Devadas
2017
TCC
Barriers to Black-Box Constructions of Traitor Tracing Systems
Bo Tang Jiapeng Zhang
2017
TCC
Batched Multi-hop Multi-key FHE from Ring-LWE with Compact Ciphertext Extension
Long Chen Zhenfeng Zhang Xueqing Wang
2017
TCC
Blockwise p-Tampering Attacks on Cryptographic Primitives, Extractors, and Learners
Saeed Mahloujifar Mohammad Mahmoody
2017
TCC
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
Alon Rosen Gil Segev Ido Shahaf
2017
TCC
Can We Access a Database Both Locally and Privately?
Elette Boyle Yuval Ishai Rafael Pass Mary Wootters
2017
TCC
Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs
T.-H. Hubert Chan Elaine Shi
2017
TCC
Constrained Keys for Invertible Pseudorandom Functions
Dan Boneh Sam Kim David J. Wu
2017
TCC
Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness
Qipeng Liu Mark Zhandry
2017
TCC
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds
Michele Ciampi Rafail Ostrovsky Luisa Siniscalchi Ivan Visconti
2017
TCC
Designing Fully Secure Protocols for Secure Two-Party Computation of Constant-Domain Functions
Vanesa Daza Nikolaos Makriyannis
2017
TCC
Evolving Secret Sharing: Dynamic Thresholds and Robustness
Ilan Komargodski Anat Paskin-Cherniavsky
2017
TCC
Four Round Secure Computation Without Setup
Zvika Brakerski Shai Halevi Antigoni Polychroniadou
2017
TCC
Four-State Non-malleable Codes with Explicit Constant Rate
Bhavana Kanukurthi Sai Lakshmi Bhavana Obbattu Sruthi Sekar
2017
TCC
From Selective IBE to Full IBE and Selective HIBE
Nico Döttling Sanjam Garg
2017
TCC
Functional Encryption for Bounded Collusions, Revisited
Shweta Agrawal Alon Rosen
2017
TCC
How to Construct a Leakage-Resilient (Stateless) Trusted Party
Daniel Genkin Yuval Ishai Mor Weiss
2017
TCC
Inception Makes Non-malleable Codes Stronger
Divesh Aggarwal Tomasz Kazana Maciej Obremski
2017
TCC
Limits on the Locality of Pseudorandom Generators and Applications to Indistinguishability Obfuscation
Alex Lombardi Vinod Vaikuntanathan
2017
TCC
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures
Amos Beimel Oriol Farràs Yuval Mintz Naty Peter
2017
TCC
Moderately Hard Functions: Definition, Instantiations, and Applications
Joël Alwen Björn Tackmann
2017
TCC
Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy
Tibor Jager Martijn Stam Ryan Stanley-Oakes Bogdan Warinschi
2017
TCC
Near-Optimal Secret Sharing and Error Correcting Codes in \mathsf AC^0 AC 0
Kuan Cheng Yuval Ishai Xin Li
2017
TCC
On Iterative Collision Search for LPN and Subset Sum
Srinivas Devadas Ling Ren Hanshen Xiao
2017
TCC
On Secure Two-Party Computation in Three Rounds
Prabhanjan Ananth Abhishek Jain
2017
TCC
On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i
Jeremiah Blocki Samson Zhou
2017
TCC
On the Impossibility of Entropy Reversal, and Its Application to Zero-Knowledge Proofs
Shachar Lovett Jiapeng Zhang
2017
TCC
On the One-Per-Message Unforgeability of (EC)DSA and Its Variants
Manuel Fersch Eike Kiltz Bertram Poettering
2017
TCC
On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-interactive Arguments
Omer Paneth Guy N. Rothblum
2017
TCC
Overcoming Cryptographic Impossibility Results Using Blockchains
Rishab Goyal Vipul Goyal
2017
TCC
Position-Based Cryptography and Multiparty Communication Complexity
Joshua Brody Stefan Dziembowski Sebastian Faust Krzysztof Pietrzak
2017
TCC
Private Constrained PRFs (and More) from LWE
Zvika Brakerski Rotem Tsabary Vinod Vaikuntanathan Hoeteck Wee
2017
TCC
Resettably-Sound Resettable Zero Knowledge in Constant Rounds
Wutichai Chongchitmate Rafail Ostrovsky Ivan Visconti
2017
TCC
Resource-Efficient OT Combiners with Active Security
Ignacio Cascudo Ivan Damgård Oriol Farràs Samuel Ranellucci
2017
TCC
Round Optimal Concurrent MPC via Strong Simulation
Saikrishna Badrinarayanan Vipul Goyal Abhishek Jain Dakshita Khurana Amit Sahai
2017
TCC
Round Optimal Concurrent Non-malleability from Polynomial Hardness
Dakshita Khurana
2017
TCC
Round-Optimal Secure Two-Party Computation from Trapdoor Permutations
Michele Ciampi Rafail Ostrovsky Luisa Siniscalchi Ivan Visconti
2017
TCC
Secure Two-Party Computation with Fairness - A Necessary Design Principle
Yehuda Lindell Tal Rabin
2017
TCC
Strengthening the Security of Encrypted Databases: Non-transitive JOINs
Ilya Mironov Gil Segev Ido Shahaf
2017
TCC
The Edited Truth
Shafi Goldwasser Saleet Klein Daniel Wichs
2017
TCC
Theory for Society: Fairness in Classification
★Invited talk
Cynthia Dwork
2017
TCC
Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I
2017
TCC
Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part II
2017
TCC
To Cyclicity and Beyond!
★Invited talk
Chris Peikert Alon Rosen
2017
TCC
Towards Doubly Efficient Private Information Retrieval
Ran Canetti Justin Holmgren Silas Richelson
2017
TCC
Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs
Nir Bitansky
2017
TCC
When Does Functional Encryption Imply Obfuscation?
Sanjam Garg Mohammad Mahmoody Ameer Mohammed
2017
TCC
Zero Knowledge Protocols from Succinct Constraint Detection
Eli Ben-Sasson Alessandro Chiesa Michael A. Forbes Ariel Gabizon Michael Riabzev Nicholas Spooner