default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13. TCC 2016: Tel Aviv, Israel
- Eyal Kushilevitz, Tal Malkin:
Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I. Lecture Notes in Computer Science 9562, Springer 2016, ISBN 978-3-662-49095-2
Obfuscation: Impossibility Results and Constructions
- Rafael Pass
, Abhi Shelat:
Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings. 3-17 - Mohammad Mahmoody, Ameer Mohammed, Soheil Nematihaji:
On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models. 18-48 - Mohammad Mahmoody, Ameer Mohammed, Soheil Nematihaji, Rafael Pass, Abhi Shelat:
Lower Bounds on Assumptions Behind Indistinguishability Obfuscation. 49-66 - Nir Bitansky, Vinod Vaikuntanathan:
Indistinguishability Obfuscation: From Approximate to Exact. 67-95 - Huijia Lin, Rafael Pass, Karn Seth, Sidharth Telang:
Output-Compressing Randomized Encodings and Applications. 96-124 - Prabhanjan Vijendra Ananth, Amit Sahai:
Functional Encryption for Turing Machines. 125-153
Differential Privacy
- Jack Murtagh, Salil P. Vadhan:
The Complexity of Computing the Optimal Composition of Differential Privacy. 157-175 - Mark Bun, Mark Zhandry:
Order-Revealing Encryption and the Hardness of Private Learning. 176-206
LWR and LPN
- Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson, Alon Rosen:
On the Hardness of Learning with Rounding over Small Modulus. 209-224 - David Cash, Eike Kiltz, Stefano Tessaro:
Two-Round Man-in-the-Middle Security from LPN. 225-248
Public Key Encryption, Signatures, and VRF
- Dennis Hofheinz:
Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography. 251-281 - Georg Fuchsbauer, Felix Heuer, Eike Kiltz, Krzysztof Pietrzak:
Standard Security Does Imply Security Against Selective Opening for Markov Distributions. 282-305 - Sandro Coretti, Yevgeniy Dodis, Björn Tackmann, Daniele Venturi:
Non-Malleable Encryption: Simpler, Shorter, Stronger. 306-335 - Dennis Hofheinz, Tibor Jager:
Verifiable Random Functions from Standard Assumptions. 336-362
Complexity of Cryptographic Primitives
- Andrej Bogdanov, Chin Ho Lee:
Homomorphic Evaluation Requires Depth. 365-371 - Tianren Liu, Vinod Vaikuntanathan:
On Basing Private Information Retrieval on NP-Hardness. 372-386
Obfuscation-Based Cryptographic Constructions
- Ran Canetti, Yilei Chen, Leonid Reyzin:
On the Correlation Intractability of Obfuscated Pseudorandom Functions. 389-415 - Julia Hesse, Dennis Hofheinz, Andy Rupp:
Reconfigurable Cryptography: A Flexible Approach to Long-Term Security. 416-445 - Martin R. Albrecht, Pooya Farshim, Dennis Hofheinz, Enrique Larraia, Kenneth G. Paterson:
Multilinear Maps from Obfuscation. 446-473 - Nir Bitansky, Omer Paneth, Daniel Wichs:
Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation. 474-502
Cryptographic Assumptions (Invited Talk followed by Panel)
- Shafi Goldwasser, Yael Tauman Kalai:
Cryptographic Assumptions: A Position Paper. 505-522
Multiparty Computation
- Brett Hemenway, Rafail Ostrovsky, Silas Richelson, Alon Rosen:
Adaptive Security with Quasi-Optimal Rate. 525-541 - Tore Kasper Frederiksen, Thomas P. Jakobsen, Jesper Buus Nielsen, Roberto Trifiletti:
On the Complexity of Additively Homomorphic UC Commitments. 542-565 - Douglas Wikström:
Simplified Universal Composability Framework. 566-595 - Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
Characterization of Secure Multiparty Computation Without Broadcast. 596-616
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-09 20:16 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:
