Amit Sahai

According to our database1, Amit Sahai authored at least 235 papers between 1996 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Statistical ZAP Arguments.
IACR Cryptology ePrint Archive, 2019

How to Leverage Hardness of Constant-Degree Expanding Polynomials over \mathbb R R to build i풪 i O.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Sum-of-Squares Meets Program Obfuscation, Revisited.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Cryptographic Sensing.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Simultaneous Amplification: The Case of Non-interactive Zero-Knowledge.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
Expander Graphs are Non-Malleable Codes.
IACR Cryptology ePrint Archive, 2018

Leakage-Resilient Secret Sharing.
IACR Cryptology ePrint Archive, 2018

How to leverage hardness of constant-degree expanding polynomials over ℝ to build iO.
IACR Cryptology ePrint Archive, 2018

Exploring Crypto Dark Matter: New Simple PRF Candidates and Their Applications.
IACR Cryptology ePrint Archive, 2018

Secure MPC: Laziness Leads to GOD.
IACR Cryptology ePrint Archive, 2018

Output Compression, MPC, and iO for Turing Machines.
IACR Cryptology ePrint Archive, 2018

Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness.
IACR Cryptology ePrint Archive, 2018

From FE Combiners to Secure MPC and Back.
IACR Cryptology ePrint Archive, 2018

Leakage-Resilient Secret Sharing.
Electronic Colloquium on Computational Complexity (ECCC), 2018

Non-Interactive Delegation for Low-Space Non-Deterministic Computation.
Electronic Colloquium on Computational Complexity (ECCC), 2018

Exploring Crypto Dark Matter: - New Simple PRF Candidates and Their Applications.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Upgrading to Functional Encryption.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Succinct delegation for low-space non-deterministic computation.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Statistical Witness Indistinguishability (and more) in Two Messages.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Threshold Cryptosystems from Threshold Fully Homomorphic Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Promise Zero Knowledge and Its Applications to Round Optimal MPC.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Private Circuits: A Modular Approach.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
Two-Message Non-Malleable Commitments from Standard Sub-exponential Assumptions.
IACR Cryptology ePrint Archive, 2017

Threshold Fully Homomorphic Encryption.
IACR Cryptology ePrint Archive, 2017

Non-Interactive Delegation for Low-Space Non-Deterministic Computation.
IACR Cryptology ePrint Archive, 2017

A note on VRFs from Verifiable Functional Encryption.
IACR Cryptology ePrint Archive, 2017

Round Optimal Concurrent MPC via Strong Simulation.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Hierarchical Functional Encryption.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

How to Achieve Non-Malleability in One or Two Rounds.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Lattice-Based SNARGs and Their Application to More Efficient Obfuscation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Patchable Indistinguishability Obfuscation: iO for Evolving Software.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Non-Interactive Multiparty Computation Without Correlated Randomness.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

Preventing CLT Attacks on Obfuscation with Linear Overhead.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016
Secure obfuscation in a weak multilinear map model: A simple construction secure against all known attacks.
IACR Cryptology ePrint Archive, 2016

All Complete Functionalities are Reversible.
IACR Cryptology ePrint Archive, 2016

Preventing CLT Zeroizing Attacks on Obfuscation.
IACR Cryptology ePrint Archive, 2016

Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security.
IACR Cryptology ePrint Archive, 2016

Hiding secrets in software: a cryptographic approach to program obfuscation.
Commun. ACM, 2016

Secure Obfuscation in a Weak Multilinear Map Model.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Functional Encryption for Turing Machines.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Adaptive protocols for interactive communication.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Do Distributed Differentially-Private Protocols Require Oblivious Transfer?.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Breaking the Three Round Barrier for Non-malleable Commitments.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Bounded-Communication Leakage Resilience via Parity-Resilient Circuits.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Secure Computation from Elastic Noisy Channels.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

All Complete Functionalities are Reversible.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Secure Protocol Transformations.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

How to Generate and Use Universal Samplers.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

Verifiable Functional Encryption.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015
Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs.
J. Cryptology, 2015

On the Equivalence of Obfuscation and Multilinear Maps.
IACR Cryptology ePrint Archive, 2015

Do Distributed Differentially-Private Protocols Require Oblivious Transfer?
IACR Cryptology ePrint Archive, 2015

Functional Encryption: Decentralised and Delegatable.
IACR Cryptology ePrint Archive, 2015

Cryptanalysis of the Quadratic Zero-Testing of GGH.
IACR Cryptology ePrint Archive, 2015

Post-Zeroizing Obfuscation: The case of Evasive Circuits.
IACR Cryptology ePrint Archive, 2015

Patchable Obfuscation.
IACR Cryptology ePrint Archive, 2015

Indistinguishability Obfuscation with Constant Size Overhead.
IACR Cryptology ePrint Archive, 2015

Achieving Compactness Generically: Indistinguishability Obfuscation from Non-Compact Functional Encryption.
IACR Cryptology ePrint Archive, 2015

Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Public-Coin Differing-Inputs Obfuscation and Its Applications.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Functional Encryption for Randomized Functionalities.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

On the Practical Security of Inner Product Functional Encryption.
Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Hosting Services on an Untrusted Cloud.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Concurrent Secure Computation via Non-Black Box Simulation.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Cryptography with One-Way Communication.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Secure Computation from Leaky Correlated Randomness.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

Multi-input Functional Encryption for Unbounded Arity Functions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014
Efficient Coding for Interactive Communication.
IEEE Trans. Information Theory, 2014

Obfuscating Low-Rank Matrix Branching Programs.
IACR Cryptology ePrint Archive, 2014

Protecting obfuscation against arithmetic attacks.
IACR Cryptology ePrint Archive, 2014

How to Generate and use Universal Parameters.
IACR Cryptology ePrint Archive, 2014

Zeroizing without zeroes: Cryptanalyzing multilinear maps without encodings of zero.
IACR Cryptology ePrint Archive, 2014

Privacy preserving protocol for detecting genetic relatives using rare variants.
Bioinformatics, 2014

Statistical Concurrent Non-malleable Zero Knowledge.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Obfuscation for Evasive Functions.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

How to use indistinguishability obfuscation: deniable encryption, and more.
Proceedings of the Symposium on Theory of Computing, 2014

Circuits resilient to additive attacks with applications to secure computation.
Proceedings of the Symposium on Theory of Computing, 2014

Single-use ot combiners with near-optimal resilience.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Private interactive communication across an adversarial channel.
Proceedings of the Innovations in Theoretical Computer Science, 2014

On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption.
Proceedings of the Progress in Cryptology - INDOCRYPT 2014, 2014

Secure Computation Using Leaky Tokens.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

A Full Characterization of Completeness for Two-Party Randomized Function Evaluation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Multi-input Functional Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Protecting Obfuscation against Algebraic Attacks.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Optimizing Obfuscation: Avoiding Barrington's Theorem.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

Black-Box Separations for Differentially Private Protocols.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013
The IPS Compiler.
Proceedings of the Secure Multi-Party Computation, 2013

Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles.
J. Cryptology, 2013

Multi-Input Functional Encryption.
IACR Cryptology ePrint Archive, 2013

Differing-Inputs Obfuscation and Applications.
IACR Cryptology ePrint Archive, 2013

Function Private Functional Encryption and Property Preserving Encryption : New Definitions and Positive Results.
IACR Cryptology ePrint Archive, 2013

Witness encryption and its applications.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Robust Pseudorandom Generators.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Full Domain Hash from (Leveled) Multilinear Maps and Identity-Based Aggregate Signatures.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Attribute-Based Encryption for Circuits from Multilinear Maps.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Secure Computation against Adaptive Auxiliary Information.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Discrete Gaussian Leftover Hash Lemma over Infinite Domains.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

Zero Knowledge LTCs and Their Applications.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Efficient Noninteractive Proof Systems for Bilinear Groups.
SIAM J. Comput., 2012

New Techniques for Noninteractive Zero-Knowledge.
J. ACM, 2012

Attribute-Based Encryption for Circuits from Multilinear Maps.
IACR Cryptology ePrint Archive, 2012

Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma.
IACR Cryptology ePrint Archive, 2012

Sampling Discrete Gaussians Efficiently and Obliviously.
IACR Cryptology ePrint Archive, 2012

Functional encryption: a new vision for public-key cryptography.
Commun. ACM, 2012

On Efficient Zero-Knowledge PCPs.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

An information-theoretic protocol compiler.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Concurrently Secure Computation in Constant Rounds.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

Adaptively Secure Multi-Party Computation with Dishonest Majority.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

2011
Bringing People of Different Beliefs Together to Do UC.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Functional Encryption: Definitions and Challenges.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Fully Secure Accountable-Authority Identity-Based Encryption.
Proceedings of the Public Key Cryptography - PKC 2011, 2011

Efficient and Explicit Coding for Interactive Communication.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Efficient Non-interactive Secure Computation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Cryptography with Tamperable and Leaky Memory.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Constant-Rate Oblivious Transfer from Noisy Channels.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Round Optimal Blind Signatures.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Leakage-Resilient Zero Knowledge.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Resettable Cryptography in Constant Rounds - The Case of Zero Knowledge.
Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010
Founding Cryptography on Tamper-Proof Hardware Tokens.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

On Complete Primitives for Fairness.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Revocation Systems with Very Small Private Keys.
Proceedings of the 31st IEEE Symposium on Security and Privacy, 2010

On the Computational Complexity of Coin Flipping.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography.
Proceedings of the Advances in Cryptology, 2010

Worry-free encryption: functional encryption with public keys.
Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010

Building efficient fully collusion-resilient traitor tracing and revocation schemes.
Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010

On Invertible Sampling and Adaptive Security.
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009
Attribute-Based Encryption.
Proceedings of the Identity-Based Cryptography, 2009

Zero-Knowledge Proofs from Secure Multiparty Computation.
SIAM J. Comput., 2009

Special Issue On The Thirty-Eighth Annual ACM Symposium On Theory Of Computing (STOC 2006).
SIAM J. Comput., 2009

Secure Arithmetic Computation with No Honest Majority.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Extracting Correlations.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Resettably Secure Computation.
Proceedings of the Advances in Cryptology, 2009

Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems.
Proceedings of the Advances in Cryptology, 2009

2008
Improved algorithms for optimal embeddings.
ACM Trans. Algorithms, 2008

Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy.
IACR Cryptology ePrint Archive, 2008

Cryptography with constant computational overhead.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Computing on Encrypted Data.
Proceedings of the Information Systems Security, 4th International Conference, 2008

Bounded Ciphertext Policy Attribute Based Encryption.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Precise Concurrent Zero Knowledge.
Proceedings of the Advances in Cryptology, 2008

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products.
Proceedings of the Advances in Cryptology, 2008

Efficient Non-interactive Proof Systems for Bilinear Groups.
Proceedings of the Advances in Cryptology, 2008

New Constructions for UC Secure Computation Using Tamper-Proof Hardware.
Proceedings of the Advances in Cryptology, 2008

Founding Cryptography on Oblivious Transfer - Efficiently.
Proceedings of the Advances in Cryptology, 2008

Black-box accountable authority identity-based encryption.
Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008

2007
Zero-knowledge from secure multiparty computation.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Ciphertext-Policy Attribute-Based Encryption.
Proceedings of the 2007 IEEE Symposium on Security and Privacy (S&P 2007), 2007

Private Locally Decodable Codes.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Ring Signatures of Sub-linear Size Without Random Oracles.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Covert Multi-Party Computation.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

Attribute-based encryption with non-monotonic access structures.
Proceedings of the 2007 ACM Conference on Computer and Communications Security, 2007

Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions.
Proceedings of the Advances in Cryptology, 2007

2006
Fully Collusion Resistant Traitor Tracing.
IACR Cryptology ePrint Archive, 2006

Improved Algorithms for Optimal Embeddings.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Concurrent Zero Knowledge Without Complexity Assumptions.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Cryptography from Anonymity.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Concurrent Non-Malleable Zero Knowledge.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Sequential Aggregate Signatures and Multisignatures Without Random Oracles.
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

Private Circuits II: Keeping Secrets in Tamperable Circuits.
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

Perfect Non-interactive Zero Knowledge for NP.
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys.
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

Non-interactive Zaps and New Techniques for NIZK.
Proceedings of the Advances in Cryptology, 2006

Attribute-based encryption for fine-grained access control of encrypted data.
Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, Alexandria, VA, USA, Ioctober 30, 2006

2005
The smallest grammar problem.
IEEE Trans. Information Theory, 2005

Perfect Non-Interactive Zero Knowledge for NP
Electronic Colloquium on Computational Complexity (ECCC), 2005

How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation
Electronic Colloquium on Computational Complexity (ECCC), 2005

Concurrent Zero Knowledge without Complexity Assumptions
Electronic Colloquium on Computational Complexity (ECCC), 2005

Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Fuzzy Identity-Based Encryption.
Proceedings of the Advances in Cryptology, 2005

2004
New notions of security: achieving universal composability without trusted setup.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Batch codes and their applications.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Frugality in path auctions.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Secure Protocols for Complex Tasks in Complex Environments.
Proceedings of the Progress in Cryptology, 2004

On the (Im)possibility of Cryptography with Imperfect Randomness.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

Positive Results and Techniques for Obfuscation.
Proceedings of the Advances in Cryptology, 2004

2003
A complete problem for statistical zero knowledge.
J. ACM, 2003

Private Circuits: Securing Hardware against Probing Attacks.
Proceedings of the Advances in Cryptology, 2003

Receiver anonymity via incomparable public keys.
Proceedings of the 10th ACM Conference on Computer and Communications Security, 2003

2002
Query Strategies for Priced Information.
J. Comput. Syst. Sci., 2002

Concurrent Zero Knowledge Proofs with Logarithmic Round-Complexity.
IACR Cryptology ePrint Archive, 2002

A Unified Methodology For Constructing Public-Key Encryption Schemes Secure Against Adaptive Chosen-Ciphertext Attack.
IACR Cryptology ePrint Archive, 2002

Approximating the smallest grammar: Kolmogorov complexity in natural models.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Universally composable two-party and multi-party secure computation.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Concurrent Zero Knowledge with Logarithmic Round-Complexity.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Dimension Reduction in the \ell _1 Norm.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001
On the (Im)possibility of Obfuscating Programs
Electronic Colloquium on Computational Complexity (ECCC), 2001

On Perfect and Adaptive Security in Exposure-Resilient Cryptography.
Proceedings of the Advances in Cryptology, 2001

Robust Non-interactive Zero Knowledge.
Proceedings of the Advances in Cryptology, 2001

On the (Im)possibility of Obfuscating Programs.
Proceedings of the Advances in Cryptology, 2001

2000
Frontiers in zero knowledge.
PhD thesis, 2000

A Complete Problem for Statistical Zero Knowledge.
IACR Cryptology ePrint Archive, 2000

A Complete Problem for Statistical Zero Knowledge
Electronic Colloquium on Computational Complexity (ECCC), 2000

Query strategies for priced information (extended abstract).
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

"Soft-decision" Decoding of Chinese Remainder Codes.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Combinatorial feature selection problems.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Exposure-Resilient Functions and All-or-Nothing Transforms.
Proceedings of the Advances in Cryptology, 2000

1999
Can Statistical Zero Knowledge be made Non-Interactive? or On the Relationship of SZK and NISZK
Electronic Colloquium on Computational Complexity (ECCC), 1999

Minimizing Wirelength in Zero and Bounded Skew Clock Trees.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Pseudonym Systems.
Proceedings of the Selected Areas in Cryptography, 6th Annual International Workshop, 1999

Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

Coding Constructions for Blacklisting Problems without Computational Assumptions.
Proceedings of the Advances in Cryptology, 1999

Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK.
Proceedings of the Advances in Cryptology, 1999

Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization.
Proceedings of the Advances in Cryptology, 1999

Multiclass Learning, Boosting, and Error-Correcting Codes.
Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

1998
Many-to-one Trapdoor Functions and their Relation to Public-key Cryptosystems.
IACR Cryptology ePrint Archive, 1998

Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Concurrent Zero-Knowledge.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

The Power of a Pebble: Exploring and Mapping Directed Graphs.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints.
Proceedings of the Advances in Cryptology, 1998

Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems.
Proceedings of the Advances in Cryptology, 1998

1997
A Complete Promise Problem for Statistical Zero-Knowledge.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

Manipulating statistical difference.
Proceedings of the Randomization Methods in Algorithm Design, 1997

1996
Pushing Disks Together - The Continuous-Motion Case.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996


  Loading...