TCC (B1)

Keyphrases

Publications

2016

Ignacio Cascudo, Ivan Damgård, Felipe Lacerda, Samuel Ranellucci
Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement. TCC (B1) (2016)
Bar Alon, Eran Omri
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious. TCC (B1) (2016)
Krzysztof Pietrzak, Maciej Skórski
Pseudoentropy: Lower-Bounds for Chain Rules and Transformations. TCC (B1) (2016)
Benny Applebaum, Pavel Raykov
Fast Pseudorandom Functions Based on Expander Graphs. TCC (B1) (2016)
Ueli Maurer, Renato Renner
From Indifferentiability to Constructive Cryptography (and Back). TCC (B1) (2016)
Jesper Buus Nielsen, Claudio Orlandi
Cross and Clean: Amortized Garbled Circuits with Constant Overhead. TCC (B1) (2016)
Maciej Skórski
Simulating Auxiliary Inputs, Revisited. TCC (B1) (2016)
Lucas Kowalczyk, Tal Malkin, Jonathan R. Ullman, Mark Zhandry
Strong Hardness of Privacy from Weak Traitor Tracing. TCC (B1) (2016)
Mark Bun, Thomas Steinke
Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds. TCC (B1) (2016)
Carmit Hazay, Avishay Yanai
Constant-Round Maliciously Secure Two-Party Computation in the RAM Model. TCC (B1) (2016)
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, Stefano Tessaro
Simultaneous Secrecy and Reliability Amplification for a General Channel Model. TCC (B1) (2016)
Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai, Omer Paneth, Vinod Vaikuntanathan
3-Message Zero Knowledge Against Human Ignorance. TCC (B1) (2016)
Zahra Jafargholi, Daniel Wichs
Adaptive Security of Yao's Garbled Circuits. TCC (B1) (2016)
Yehuda Lindell, Nigel P. Smart, Eduardo Soria-Vazquez
More Efficient Constant-Round Multi-party Computation from BMR and SHE. TCC (B1) (2016)
Aloni Cohen, Saleet Klein
The GGM Function Family Is a Weakly One-Way Family of Functions. TCC (B1) (2016)
Sanjam Garg, Divya Gupta, Peihan Miao, Omkant Pandey
Secure Multiparty RAM Computation in Constant Rounds. TCC (B1) (2016)
Carsten Baum, Emmanuela Orsini, Peter Scholl
Efficient Secure Multiparty Computation with Identifiable Abort. TCC (B1) (2016)
Ling Ren, Srinivas Devadas
Proof of Space from Stacked Expanders. TCC (B1) (2016)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions. TCC (B1) (2016)
Daniel Genkin, Yuval Ishai, Mor Weiss
Binary AMD Circuits from Secure Multiparty Computation. TCC (B1) (2016)
Mark Bun, Yi-Hsiu Chen, Salil P. Vadhan
Separating Computational and Statistical Differential Privacy in the Client-Server Model. TCC (B1) (2016)
Gabriele Spini, Gilles Zémor
Perfectly Secure Message Transmission in Two Rounds. TCC (B1) (2016)
Ilan Komargodski
Leakage Resilient One-Way Functions: The Auxiliary-Input Setting. TCC (B1) (2016)
Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity. TCC (B1) (2016)
Dario Fiore, Anca Nitulescu
On the (In)Security of SNARKs in the Presence of Oracles. TCC (B1) (2016)

volume 9985, 2016

Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part I TCC (B1) 9985 (2016)