default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14. TCC 2016: Beijing, China
- Martin Hirt, Adam D. Smith:
Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part I. Lecture Notes in Computer Science 9985, 2016, ISBN 978-3-662-53640-7
TCC Test-of-Time Award
- Ueli Maurer, Renato Renner:
From Indifferentiability to Constructive Cryptography (and Back). 3-24
Foundations
- Benny Applebaum, Pavel Raykov:
Fast Pseudorandom Functions Based on Expander Graphs. 27-56 - Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai, Omer Paneth, Vinod Vaikuntanathan:
3-Message Zero Knowledge Against Human Ignorance. 57-83 - Aloni Cohen, Saleet Klein:
The GGM Function Family Is a Weakly One-Way Family of Functions. 84-107 - Dario Fiore, Anca Nitulescu:
On the (In)Security of SNARKs in the Presence of Oracles. 108-138 - Ilan Komargodski:
Leakage Resilient One-Way Functions: The Auxiliary-Input Setting. 139-158 - Maciej Skórski:
Simulating Auxiliary Inputs, Revisited. 159-179
Unconditional Security
- Krzysztof Pietrzak, Maciej Skórski:
Pseudoentropy: Lower-Bounds for Chain Rules and Transformations. 183-203 - Ignacio Cascudo
, Ivan Damgård, Felipe Lacerda, Samuel Ranellucci:
Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement. 204-234 - Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, Stefano Tessaro:
Simultaneous Secrecy and Reliability Amplification for a General Channel Model. 235-261 - Ling Ren, Srinivas Devadas:
Proof of Space from Stacked Expanders. 262-285 - Gabriele Spini, Gilles Zémor:
Perfectly Secure Message Transmission in Two Rounds. 286-304
Foundations of Multi-Party Protocols
- Bar Alon, Eran Omri:
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious. 307-335 - Daniel Genkin, Yuval Ishai, Mor Weiss:
Binary AMD Circuits from Secure Multiparty Computation. 336-366 - Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity. 367-399 - Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions. 400-432 - Zahra Jafargholi, Daniel Wichs:
Adaptive Security of Yao's Garbled Circuits. 433-458
Round Complexity and Efficiency of Multi-party Computation
- Carsten Baum, Emmanuela Orsini, Peter Scholl:
Efficient Secure Multiparty Computation with Identifiable Abort. 461-490 - Sanjam Garg, Divya Gupta, Peihan Miao, Omkant Pandey:
Secure Multiparty RAM Computation in Constant Rounds. 491-520 - Carmit Hazay, Avishay Yanai:
Constant-Round Maliciously Secure Two-Party Computation in the RAM Model. 521-553 - Yehuda Lindell, Nigel P. Smart, Eduardo Soria-Vazquez:
More Efficient Constant-Round Multi-party Computation from BMR and SHE. 554-581 - Jesper Buus Nielsen, Claudio Orlandi:
Cross and Clean: Amortized Garbled Circuits with Constant Overhead. 582-603
Differential Privacy
- Mark Bun, Yi-Hsiu Chen, Salil P. Vadhan:
Separating Computational and Statistical Differential Privacy in the Client-Server Model. 607-634 - Mark Bun, Thomas Steinke:
Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds. 635-658 - Lucas Kowalczyk, Tal Malkin, Jonathan R. Ullman, Mark Zhandry:
Strong Hardness of Privacy from Weak Traitor Tracing. 659-689
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 2025-05-23 00:44 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:
