default search action
12. TCC 2015: Warsaw, Poland
- Yevgeniy Dodis, Jesper Buus Nielsen
:
Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part II. Lecture Notes in Computer Science 9015, Springer 2015, ISBN 978-3-662-46496-0
Pseudorandom Functions and Applications
- Zvika Brakerski, Vinod Vaikuntanathan:
Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions - Or: How to Secretly Embed a Circuit in Your PRF. 1-30 - Abhishek Banerjee, Georg Fuchsbauer, Chris Peikert, Krzysztof Pietrzak, Sophie Stevens:
Key-Homomorphic Constrained Pseudorandom Functions. 31-60 - Aloni Cohen, Shafi Goldwasser, Vinod Vaikuntanathan:
Aggregate Pseudorandom Functions and Connections to Learning. 61-89 - Carmit Hazay
Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs. 90-120 - Tibor Jager:
Verifiable Random Functions from Weaker Assumptions. 121-143
Proofs and Verifiable Computation
- S. Dov Gordon, Jonathan Katz, Feng-Hao Liu, Elaine Shi, Hong-Sheng Zhou
Multi-Client Verifiable Computation with Stronger Security Guarantees. 144-168 - Giulia Alberini, Tal Moran, Alon Rosen:
Public Verification of Private Effort. 169-198 - Moni Naor, Asaf Ziv:
Primary-Secondary-Resolver Membership Proof Systems. 199-228 - Kai-Min Chung, Rafael Pass
Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence. 229-246 - Carla Ràfols
Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability. 247-276
Differential Privacy
- Edward Lui, Rafael Pass
Outlier Privacy. 277-305
Functional Encryption
- Zvika Brakerski, Gil Segev:
Function-Private Functional Encryption in the Private-Key Setting. 306-324 - Vipul Goyal, Abhishek Jain, Venkata Koppula, Amit Sahai:
Functional Encryption for Randomized Functionalities. 325-351 - Ilan Komargodski, Gil Segev, Eylon Yogev:
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. 352-377
Obfuscation
- Venkata Koppula, Kim Ramchen, Brent Waters:
Separations in Circular Security for Arbitrary Length Key Cycles. 378-400 - Nir Bitansky, Omer Paneth:
ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation. 401-427 - Christina Brzuska, Pooya Farshim, Arno Mittelbach:
Random-Oracle Uninstantiability from Indistinguishability Obfuscation. 428-455 - Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Obfuscation with Random Oracles. 456-467 - Ran Canetti, Huijia Lin, Stefano Tessaro, Vinod Vaikuntanathan:
Obfuscation of Probabilistic Circuits and Applications. 468-497 - Craig Gentry, Sergey Gorbunov, Shai Halevi:
Graph-Induced Multilinear Maps from Lattices. 498-527 - Benny Applebaum, Zvika Brakerski:
Obfuscating Circuits via Composite-Order Graded Encoding. 528-556 - Ran Canetti, Shafi Goldwasser, Oxana Poburinnaya:
Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation. 557-585 - Dana Dachman-Soled, Jonathan Katz, Vanishree Rao:
Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds. 586-613 - Sanjam Garg, Antigoni Polychroniadou:
Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation. 614-637 - Omkant Pandey, Manoj Prabhakaran, Amit Sahai:
Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP. 638-667 - Yuval Ishai, Omkant Pandey, Amit Sahai:
Public-Coin Differing-Inputs Obfuscation and Its Applications. 668-697
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-12-12 20:46 CET 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: