- 2013
- Shweta Agrawal, Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Functional Encryption: New Perspectives and Lower Bounds. CRYPTO (2) 2013: 500-518 - Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Brent Waters:
Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys. CRYPTO (2) 2013: 166-184 - Mihir Bellare, Viet Tung Hoang, Sriram Keelveedhi:
Instantiating Random Oracles via UCEs. CRYPTO (2) 2013: 398-415 - Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer, Madars Virza:
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge. CRYPTO (2) 2013: 90-108 - Dan Boneh, Ananth Raghunathan, Gil Segev:
Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption. CRYPTO (2) 2013: 461-478 - Dan Boneh, Mark Zhandry:
Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World. CRYPTO (2) 2013: 361-379 - Zvika Brakerski, Guy N. Rothblum:
Obfuscating Conjunctions. CRYPTO (2) 2013: 416-434 - Anne Broadbent, Gus Gutoski, Douglas Stebila:
Quantum One-Time Programs - (Extended Abstract). CRYPTO (2) 2013: 344-360 - Angelo De Caro, Vincenzo Iovino, Abhishek Jain, Adam O'Neill, Omer Paneth, Giuseppe Persiano:
On the Achievability of Simulation-Based Security for Functional Encryption. CRYPTO (2) 2013: 519-535 - Jie Chen, Hoeteck Wee:
Fully, (Almost) Tightly Secure IBE and Dual System Groups. CRYPTO (2) 2013: 435-460 - Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron D. Rothblum:
Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract). CRYPTO (2) 2013: 185-202 - Frédéric Dupuis, Omar Fawzi, Stephanie Wehner:
Achieving the Limits of the Noisy-Storage Model Using Entanglement Sampling. CRYPTO (2) 2013: 326-343 - Stefan Dziembowski, Tomasz Kazana, Maciej Obremski:
Non-malleable Codes from Two-Source Extractors. CRYPTO (2) 2013: 239-257 - Alex Escala, Gottfried Herold, Eike Kiltz, Carla Ràfols, Jorge L. Villar:
An Algebraic Framework for Diffie-Hellman Assumptions. CRYPTO (2) 2013: 129-147 - Nelly Fazio, Rosario Gennaro, Irippuge Milinda Perera, William E. Skeith III:
Hard-Core Predicates for a Diffie-Hellman Problem over Finite Fields. CRYPTO (2) 2013: 148-165 - Matthew K. Franklin, Ran Gelles, Rafail Ostrovsky, Leonard J. Schulman:
Optimal Coding for Streaming Authentication and Interactive Communication. CRYPTO (2) 2013: 258-276 - Sanjam Garg, Craig Gentry, Shai Halevi, Amit Sahai, Brent Waters:
Attribute-Based Encryption for Circuits from Multilinear Maps. CRYPTO (2) 2013: 479-499 - Shafi Goldwasser, Yael Tauman Kalai, Raluca A. Popa, Vinod Vaikuntanathan, Nickolai Zeldovich:
How to Run Turing Machines on Encrypted Data. CRYPTO (2) 2013: 536-553 - Faruk Göloglu, Robert Granger, Gary McGuire, Jens Zumbrägel:
On the Function Field Sieve and the Impact of Higher Splitting Probabilities - Application to Discrete Logarithms in and. CRYPTO (2) 2013: 109-128 - Vipul Goyal, Divya Gupta, Abhishek Jain:
What Information Is Leaked under Concurrent Composition? CRYPTO (2) 2013: 220-238 - Martin Hirt, Christoph Lucas, Ueli Maurer:
A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation. CRYPTO (2) 2013: 203-219 - Martin Hirt, Christoph Lucas, Ueli Maurer:
Erratum: A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation. CRYPTO (2) 2013 - Yan Huang, Jonathan Katz, David Evans:
Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose. CRYPTO (2) 2013: 18-35 - Vladimir Kolesnikov, Ranjit Kumaresan:
Improved OT Extension for Transferring Short Secrets. CRYPTO (2) 2013: 54-70 - Benoît Libert, Thomas Peters, Marc Joye, Moti Yung:
Linearly Homomorphic Structure-Preserving Signatures and Their Applications. CRYPTO (2) 2013: 289-307 - Yehuda Lindell:
Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries. CRYPTO (2) 2013: 1-17 - Vadim Lyubashevsky, Daniel Masny:
Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs. CRYPTO (2) 2013: 308-325 - Payman Mohassel, Ben Riva:
Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation. CRYPTO (2) 2013: 36-53 - Sebastià Martín Molleví, Carles Padró, An Yang:
Secret Sharing, Rank Inequalities and Information Inequalities. CRYPTO (2) 2013: 277-288 - Justin Thaler:
Time-Optimal Interactive Proofs for Circuit Evaluation. CRYPTO (2) 2013: 71-89