Guy N. Rothblum

IACR Cryptol. ePrint Arch., 2014

Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding.

[BibT_eX]

[DOI]

Zvika Brakerski

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Black-box obfuscation for d-CNFs.

[BibT_eX]

[DOI]

Zvika Brakerski

Proceedings of the Innovations in Theoretical Computer Science, 2014

Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Refereed delegation of computation.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Interactive proofs of proximity: delegating computation in sublinear time.

[BibT_eX]

[DOI]

Salil P. Vadhan

Avi Wigderson

Proceedings of the Symposium on Theory of Computing Conference, 2013

Obfuscating Conjunctions.

[BibT_eX]

[DOI]

Zvika Brakerski

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012

Private data release via learning thresholds.

[BibT_eX]

[DOI]

Moritz Hardt

Rocco A. Servedio

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Two Protocols for Delegation of Computation.

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security - 6th International Conference, 2012

How to Compute in the Presence of Leakage.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

How to Compute under ${\cal{AC}}^{\sf0}$ Leakage without Secure Hardware.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

2011

Two 1-Round Protocols for Delegation of Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

On Approximating the Entropy of Polynomial Mappings.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Computer Science, 2011

Practical delegation of computation using multiple servers.

[BibT_eX]

[DOI]

Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

Program Obfuscation with Leaky Hardware.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010

Leakage-Resilient Signatures.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Obfuscation of Hyperplane Membership.

[BibT_eX]

[DOI]

Mayank Varia

Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Differential privacy under continual observation.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Pan-Private Streaming Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Computer Science, 2010

A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis.

[BibT_eX]

[DOI]

Moritz Hardt

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Boosting and Differential Privacy.

[BibT_eX]

[DOI]

Cynthia Dwork

Salil P. Vadhan

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Securing Computation against Continuous Leakage.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2010

2009

Delegating computation reliably: paradigms and constructions.

[BibT_eX]

[DOI]

PhD thesis, 2009

How Efficient Can Memory Checking Be?.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Weak Verifiable Random Functions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

On the complexity of differentially private data release: efficient algorithms and hardness results.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Are PCPs Inherent in Efficient Arguments?

[BibT_eX]

[DOI]

Salil P. Vadhan

Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009

2008

Delegating computation: interactive proofs for muggles.

[BibT_eX]

[DOI]

Yael Tauman Kalai

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

A (de)constructive approach to program checking.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

One-Time Programs.

[BibT_eX]

[DOI]

Yael Tauman Kalai

Proceedings of the Advances in Cryptology, 2008

The Complexity of Local List Decoding.

[BibT_eX]

[DOI]

Dan Gutfreund

Proceedings of the Approximation, 2008

2007

Securely Obfuscating Re-encryption.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

On Best-Possible Obfuscation.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

Verifying and decoding in constant depth.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms, 4th International Conference, 2007

2006

Learning to impersonate.

[BibT_eX]

[DOI]

Moni Naor

Proceedings of the Machine Learning, 2006

2005

The Complexity of Online Memory Checking.

[BibT_eX]

[DOI]

Moni Naor

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005

2004

Selection from Structured Data Sets

[BibT_eX]

[DOI]

Erez Petrank