Amit Sahai

According to our database1, Amit Sahai authored at least 234 papers between 1997 and 2020.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2018, "For contributions to cryptography and to the development of indistinguishability obfuscation".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Quantum Immune One-Time Memories.
IACR Cryptol. ePrint Arch., 2020

Combiners for Functional Encryption, Unconditionally.
IACR Cryptol. ePrint Arch., 2020

Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techniques, and Simplification.
IACR Cryptol. ePrint Arch., 2020

Affine Determinant Programs: A Framework for Obfuscation and Witness Encryption.
IACR Cryptol. ePrint Arch., 2020

On Pseudorandom Encodings.
IACR Cryptol. ePrint Arch., 2020

Amplifying the Security of Functional Encryption, Unconditionally.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
Simplifying Constructions and Assumptions for i풪.
IACR Cryptol. ePrint Arch., 2019

How to leverage hardness of constant degree expanding polynomials over R to build iO.
IACR Cryptol. ePrint Arch., 2019

Cryptographic Sensing.
IACR Cryptol. ePrint Arch., 2019

Simultaneous Amplification: The Case of Non-Interactive Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2019

Statistical ZAP Arguments.
IACR Cryptol. ePrint Arch., 2019

Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification.
IACR Cryptol. ePrint Arch., 2019

Homomorphic Encryption Standard.
IACR Cryptol. ePrint Arch., 2019

Leakage-Resilient Secret Sharing Against Colluding Parties.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 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

2018
Expander Graphs are Non-Malleable Codes.
IACR Cryptol. ePrint Arch., 2018

Statistical Witness Indistinguishability (and more) in Two Messages.
IACR Cryptol. ePrint Arch., 2018

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

Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs.
IACR Cryptol. ePrint Arch., 2018

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

Sum-of-Squares Meets Program Obfuscation, Revisited.
IACR Cryptol. ePrint Arch., 2018

Upgrading to Functional Encryption.
IACR Cryptol. ePrint Arch., 2018

Secure MPC: Laziness Leads to GOD.
IACR Cryptol. ePrint Arch., 2018

Output Compression, MPC, and iO for Turing Machines.
IACR Cryptol. ePrint Arch., 2018

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

Private Circuits: A Modular Approach.
IACR Cryptol. ePrint Arch., 2018

From FE Combiners to Secure MPC and Back.
IACR Cryptol. ePrint Arch., 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

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

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

Threshold Fully Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2017

Non-Interactive Multiparty Computation without Correlated Randomness.
IACR Cryptol. ePrint Arch., 2017

Lattice-Based SNARGs and Their Application to More Efficient Obfuscation.
IACR Cryptol. ePrint Arch., 2017

Threshold Cryptosystems From Threshold Fully Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2017

Promise Zero Knowledge and its Applications to Round Optimal MPC.
IACR Cryptol. ePrint Arch., 2017

Round Optimal Concurrent MPC via Strong Simulation.
IACR Cryptol. ePrint Arch., 2017

Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions.
IACR Cryptol. ePrint Arch., 2017

A note on VRFs from Verifiable Functional Encryption.
IACR Cryptol. ePrint Arch., 2017

Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption.
IACR Cryptol. ePrint Arch., 2017

How to Achieve Non-Malleability in One or Two Rounds.
Electronic Colloquium on Computational Complexity (ECCC), 2017

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

Patchable Indistinguishability Obfuscation: i<i>O</i> 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

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

Preventing CLT Attacks on Obfuscation with Linear Overhead.
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 Cryptol. ePrint Arch., 2016

Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13.
IACR Cryptol. ePrint Arch., 2016

All Complete Functionalities are Reversible.
IACR Cryptol. ePrint Arch., 2016

Secure Computation from Elastic Noisy Channels.
IACR Cryptol. ePrint Arch., 2016

Secure Protocol Transformations.
IACR Cryptol. ePrint Arch., 2016

Secure Obfuscation in a Weak Multilinear Map Model.
IACR Cryptol. ePrint Arch., 2016

Preventing CLT Zeroizing Attacks on Obfuscation.
IACR Cryptol. ePrint Arch., 2016

Verifiable Functional Encryption.
IACR Cryptol. ePrint Arch., 2016

Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation From Degree-5 Multilinear Maps.
IACR Cryptol. ePrint Arch., 2016

Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security.
IACR Cryptol. ePrint Arch., 2016

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

Adaptive protocols for interactive communication.
Proceedings of the IEEE International Symposium on Information Theory, 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

Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits.
Proceedings of the Advances in Cryptology - EUROCRYPT 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

2015
Private Interactive Communication Across an Adversarial Channel.
IEEE Trans. Inf. Theory, 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 Cryptol. ePrint Arch., 2015

Do Distributed Differentially-Private Protocols Require Oblivious Transfer?
IACR Cryptol. ePrint Arch., 2015

Concurrent Secure Computation via Non-Black Box Simulation.
IACR Cryptol. ePrint Arch., 2015

Circuits Resilient to Additive Attacks with Applications to Secure Computation.
IACR Cryptol. ePrint Arch., 2015

Zeroizing Without Low-Level Zeroes: New MMAP Attacks and Their Limitations.
IACR Cryptol. ePrint Arch., 2015

Functional Encryption: Decentralised and Delegatable.
IACR Cryptol. ePrint Arch., 2015

Cryptanalysis of the Quadratic Zero-Testing of GGH.
IACR Cryptol. ePrint Arch., 2015

Post-Zeroizing Obfuscation: The case of Evasive Circuits.
IACR Cryptol. ePrint Arch., 2015

Multi-Input Functional Encryption for Unbounded Arity Functions.
IACR Cryptol. ePrint Arch., 2015

Functional Encryption for Turing Machines.
IACR Cryptol. ePrint Arch., 2015

Patchable Obfuscation.
IACR Cryptol. ePrint Arch., 2015

Indistinguishability Obfuscation with Constant Size Overhead.
IACR Cryptol. ePrint Arch., 2015

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

Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma.
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

Hosting Services on an Untrusted Cloud.
Proceedings of the Advances in Cryptology - EUROCRYPT 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

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

Obfuscating Low-Rank Matrix Branching Programs.
IACR Cryptol. ePrint Arch., 2014

Statistical Concurrent Non-Malleable Zero Knowledge.
IACR Cryptol. ePrint Arch., 2014

Protecting obfuscation against arithmetic attacks.
IACR Cryptol. ePrint Arch., 2014

A Full Characterization of Completeness for Two-party Randomized Function Evaluation.
IACR Cryptol. ePrint Arch., 2014

How to Generate and use Universal Parameters.
IACR Cryptol. ePrint Arch., 2014

Black Box Separations for Differentially Private Protocols.
IACR Cryptol. ePrint Arch., 2014

Public-Coin Differing-Inputs Obfuscation and Its Applications.
IACR Cryptol. ePrint Arch., 2014

Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption.
IACR Cryptol. ePrint Arch., 2014

Zeroizing without zeroes: Cryptanalyzing multilinear maps without encodings of zero.
IACR Cryptol. ePrint Arch., 2014

Cryptography with One-Way Communication.
IACR Cryptol. ePrint Arch., 2014

Semantically Secure Order-Revealing Encryption: Multi-Input Functional Encryption Without Obfuscation.
IACR Cryptol. ePrint Arch., 2014

Optimizing Obfuscation: Avoiding Barrington's Theorem.
IACR Cryptol. ePrint Arch., 2014

Privacy preserving protocol for detecting genetic relatives using rare variants.
Bioinform., 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

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

Multi-input Functional Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 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

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products.
J. Cryptology, 2013

How to Use Indistinguishability Obfuscation: Deniable Encryption, and More.
IACR Cryptol. ePrint Arch., 2013

Obfuscation-based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP.
IACR Cryptol. ePrint Arch., 2013

Replacing a Random Oracle: Full Domain Hash From Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2013

Full Domain Hash from (Leveled) Multilinear Maps and Identity-Based Aggregate Signatures.
IACR Cryptol. ePrint Arch., 2013

Functional Encryption for Randomized Functionalities.
IACR Cryptol. ePrint Arch., 2013

Multi-Input Functional Encryption.
IACR Cryptol. ePrint Arch., 2013

Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based.
IACR Cryptol. ePrint Arch., 2013

Witness Encryption and its Applications.
IACR Cryptol. ePrint Arch., 2013

Attribute-Based Encryption for Circuits from Multilinear Maps.
IACR Cryptol. ePrint Arch., 2013

Candidate Indistinguishability Obfuscation and Functional Encryption for all circuits.
IACR Cryptol. ePrint Arch., 2013

Protecting Obfuscation Against Algebraic Attacks.
IACR Cryptol. ePrint Arch., 2013

Obfuscation for Evasive Functions.
IACR Cryptol. ePrint Arch., 2013

Differing-Inputs Obfuscation and Applications.
IACR Cryptol. ePrint Arch., 2013

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

Robust Pseudorandom Generators.
Electronic Colloquium on Computational Complexity (ECCC), 2013

Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols.
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

On the (im)possibility of obfuscating programs.
J. ACM, 2012

Attribute-Based Encryption for Circuits from Multilinear Maps.
IACR Cryptol. ePrint Arch., 2012

Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption.
IACR Cryptol. ePrint Arch., 2012

On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption.
IACR Cryptol. ePrint Arch., 2012

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

Adaptively Secure Multi-Party Computation with Dishonest Majority.
IACR Cryptol. ePrint Arch., 2012

Sampling Discrete Gaussians Efficiently and Obliviously.
IACR Cryptol. ePrint Arch., 2012

New Impossibility Results for Concurrent Composition and a Non-Interactive Completeness Theorem for Secure Computation.
IACR Cryptol. ePrint Arch., 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

2011
Concurrently Secure Computation in Constant Rounds.
IACR Cryptol. ePrint Arch., 2011

Resettable Cryptography in Constant Rounds - the Case of Zero Knowledge.
IACR Cryptol. ePrint Arch., 2011

Potent Tree Codes and their applications: Coding for Interactive Communication, revisited
CoRR, 2011

Bringing People of Different Beliefs Together to Do UC.
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

2010
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption.
IACR Cryptol. ePrint Arch., 2010

Founding Cryptography on Tamper-Proof Hardware Tokens.
IACR Cryptol. ePrint Arch., 2010

Functional Encryption: Definitions and Challenges.
IACR Cryptol. ePrint Arch., 2010

Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography.
Electronic Colloquium on Computational Complexity (ECCC), 2010

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

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

Worry-free encryption: functional encryption with public keys.
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

Building Efficient Fully Collusion-Resilient Traitor Tracing and Revocation Schemes.
IACR Cryptol. ePrint Arch., 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

Revocation Systems with Very Small Private Keys.
IACR Cryptol. ePrint Arch., 2008

Secure Arithmetic Computation with No Honest Majority.
IACR Cryptol. ePrint Arch., 2008

Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy.
IACR Cryptol. ePrint Arch., 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

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
Precise Concurrent Zero Knowledge.
IACR Cryptol. ePrint Arch., 2007

Attribute-Based Encryption with Non-Monotonic Access Structures.
IACR Cryptol. ePrint Arch., 2007

Private Locally Decodable Codes.
IACR Cryptol. ePrint Arch., 2007

New Constructions for UC Secure Computation using Tamper-proof Hardware.
IACR Cryptol. ePrint Arch., 2007

Efficient Non-interactive Proof Systems for Bilinear Groups.
Electronic Colloquium on Computational Complexity (ECCC), 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

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

2006
Sequential Aggregate Signatures and Multisignatures without Random Oracles.
IACR Cryptol. ePrint Arch., 2006

Cryptography from Anonymity.
IACR Cryptol. ePrint Arch., 2006

Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data.
IACR Cryptol. ePrint Arch., 2006

Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions.
IACR Cryptol. ePrint Arch., 2006

Fully Collusion Resistant Traitor Tracing.
IACR Cryptol. ePrint Arch., 2006

Non-Malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-based Characterization.
IACR Cryptol. ePrint Arch., 2006

Concurrent Non-Malleable Zero Knowledge.
IACR Cryptol. ePrint Arch., 2006

Improved Algorithms for Optimal Embeddings.
Electronic Colloquium on Computational Complexity (ECCC), 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

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

2005
The smallest grammar problem.
IEEE Trans. Inf. 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

2004
Minimizing Wirelength in Zero and Bounded Skew Clock Trees.
SIAM J. Discret. Math., 2004

Concurrent zero-knowledge.
J. ACM, 2004

Fuzzy Identity Based Encryption.
IACR Cryptol. ePrint Arch., 2004

New Notions of Security: Achieving Universal Composability without Trusted Setup.
IACR Cryptol. ePrint Arch., 2004

Positive Results and Techniques for Obfuscation.
IACR Cryptol. ePrint Arch., 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

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

The Power of a Pebble: Exploring and Mapping Directed Graphs.
Inf. Comput., 2002

Concurrent Zero Knowledge Proofs with Logarithmic Round-Complexity.
IACR Cryptol. ePrint Arch., 2002

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

Universally Composable Two-Party and Multi-Party Secure Computation.
IACR Cryptol. ePrint Arch., 2002

Approximating the smallest grammar: Kolmogorov complexity in natural models.
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 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

2000
Frontiers in zero knowledge.
PhD thesis, 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

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

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 Cryptol. ePrint Arch., 1998

Pushing Disks Together - The Continuous-Motion Case.
Discret. Comput. Geom., 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: 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


  Loading...