Yuval Ishai

According to our database1, Yuval Ishai authored at least 177 papers between 1996 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Separating Two-Round Secure Computation from Oblivious Transfer.
IACR Cryptology ePrint Archive, 2020

Affine Determinant Programs: A Framework for Obfuscation and Witness Encryption.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be?
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019
Cryptographic Sensing.
IACR Cryptology ePrint Archive, 2019

On Fully Secure MPC with Solitary Output.
IACR Cryptology ePrint Archive, 2019

Trapdoor Hash Functions and Their Applications.
IACR Cryptology ePrint Archive, 2019

Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs.
IACR Cryptology ePrint Archive, 2019

Secure Computation with Preprocessing via Function Secret Sharing.
IACR Cryptology ePrint Archive, 2019

Efficient Pseudorandom Correlation Generators: Silent OT Extension and More.
IACR Cryptology ePrint Archive, 2019

Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation.
IACR Cryptology ePrint Archive, 2019

Compressing Vector OLE.
IACR Cryptology ePrint Archive, 2019

How to Prove a Secret: Zero-Knowledge Proofs on Distributed Data via Fully Linear PCPs.
IACR Cryptology ePrint Archive, 2019

Unconditionally Secure Computation Against Low-Complexity Leakage.
IACR Cryptology ePrint Archive, 2019

On the Local Leakage Resilience of Linear Secret Sharing Schemes.
IACR Cryptology ePrint Archive, 2019

Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

LevioSA: Lightweight Secure Arithmetic Computation.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018
Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings.
J. Cryptology, 2018

On the Message Complexity of Secure Multiparty Computation.
IACR Cryptology ePrint Archive, 2018

Best Possible Information-Theoretic MPC.
IACR Cryptology ePrint Archive, 2018

Two-Round MPC: Information-Theoretic and Black-Box.
IACR Cryptology ePrint Archive, 2018

Reusable Non-Interactive Secure Computation.
IACR Cryptology ePrint Archive, 2018

Limits of Practical Sublinear Secure Computation.
IACR Cryptology ePrint Archive, 2018

Function Secret Sharing: Improvements and Extensions.
IACR Cryptology ePrint Archive, 2018

Homomorphic Secret Sharing: Optimizations and Applications.
IACR Cryptology ePrint Archive, 2018

Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs.
IACR Cryptology ePrint Archive, 2018

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

Private Circuits: A Modular Approach.
IACR Cryptology ePrint Archive, 2018

Outsourcing Private Machine Learning via Lightweight Secure Arithmetic Computation.
CoRR, 2018

2017
Probabilistically Checkable Proofs of Proximity with Zero-Knowledge.
IACR Cryptology ePrint Archive, 2017

Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model.
IACR Cryptology ePrint Archive, 2017

Non-Interactive Multiparty Computation without Correlated Randomness.
IACR Cryptology ePrint Archive, 2017

How to Construct a Leakage-Resilient (Stateless) Trusted Party.
IACR Cryptology ePrint Archive, 2017

The Price of Low Communication in Secure Multi-Party Computation.
IACR Cryptology ePrint Archive, 2017

Near-Optimal Secret Sharing and Error Correcting Codes in AC0.
IACR Cryptology ePrint Archive, 2017

Can We Access a Database Both Locally and Privately?
IACR Cryptology ePrint Archive, 2017

Foundations of Homomorphic Secret Sharing.
IACR Cryptology ePrint Archive, 2017

Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation.
IACR Cryptology ePrint Archive, 2017

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

Ad Hoc PSM Protocols: Secure Computation Without Coordination.
IACR Cryptology ePrint Archive, 2017

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

Secure Arithmetic Computation with Constant Computational Overhead.
IACR Cryptology ePrint Archive, 2017

Low-Complexity Cryptographic Hash Functions.
Electronic Colloquium on Computational Complexity (ECCC), 2017

Near-Optimal Secret Sharing and Error Correcting Codes in \mathsf AC^0 AC 0.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Ligero: Lightweight Sublinear Arguments Without a Trusted Setup.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30, 2017

2016
Special Section on the Fifty-Fourth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013).
SIAM J. Comput., 2016

Special Section on the Forty-Fifth Annual ACM Symposium on the Theory of Computing (STOC 2013).
SIAM J. Comput., 2016

Secure Protocol Transformations.
IACR Cryptology ePrint Archive, 2016

Binary AMD Circuits from Secure Multiparty Computation.
IACR Cryptology ePrint Archive, 2016

Breaking the Circuit Size Barrier for Secure Computation Under DDH.
IACR Cryptology ePrint Archive, 2016

Distribution Design.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

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

2015
Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys.
SIAM J. Comput., 2015

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

Private Large-Scale Databases with Distributed Searchable Symmetric Encryption.
IACR Cryptology ePrint Archive, 2015

Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits.
IACR Cryptology ePrint Archive, 2015

Secure Multi-Party Computation with Identifiable Abort.
IACR Cryptology ePrint Archive, 2015

Secure Multiparty Computation with General Interaction Patterns.
IACR Cryptology ePrint Archive, 2015

Circuits Resilient to Additive Attacks with Applications to Secure Computation.
IACR Cryptology ePrint Archive, 2015

Bounded Indistinguishability and the Complexity of Recovering Secrets.
Electronic Colloquium on Computational Complexity (ECCC), 2015

On Public Key Encryption from Noisy Codewords.
Electronic Colloquium on Computational Complexity (ECCC), 2015

Statistical Randomized Encodings: A Complexity Theoretic View.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Function Secret Sharing.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Secure Computation with Minimal Interaction, Revisited.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Parallel Hashing via List Recoverability.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

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

2014
On linear-size pseudorandom generators and hardcore functions.
Theor. Comput. Sci., 2014

Partial Garbling Schemes and Their Applications.
IACR Cryptology ePrint Archive, 2014

Public-Coin Differing-Inputs Obfuscation and Its Applications.
IACR Cryptology ePrint Archive, 2014

Cryptography with One-Way Communication.
IACR Cryptology ePrint Archive, 2014

Non-Interactive Secure Multiparty Computation.
IACR Cryptology ePrint Archive, 2014

Optimizing Obfuscation: Avoiding Barrington's Theorem.
IACR Cryptology ePrint Archive, 2014

On the Cryptographic Complexity of the Worst Functions.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 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

Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications.
Proceedings of the Innovations in Theoretical Computer Science, 2014

Distributed Point Functions and Their Applications.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

On the Complexity of UC Commitments.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013
Randomization Techniques for Secure Computation.
Proceedings of the Secure Multi-Party Computation, 2013

Lossy Chains and Fractional Secret Sharing.
IACR Cryptology ePrint Archive, 2013

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

Efficient Multiparty Protocols via Log-Depth Threshold Formulae.
Electronic Colloquium on Computational Complexity (ECCC), 2013

On the Power of Correlated Randomness in Secure Computation.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract).
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

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

2012
Succinct Non-Interactive Arguments via Linear Interactive Proofs.
IACR Cryptology ePrint Archive, 2012

Encoding Functions with Constant Online Rate or How to Compress Keys in Garbled Circuits.
IACR Cryptology ePrint Archive, 2012

How to Garble Arithmetic Circuits.
Electronic Colloquium on Computational Complexity (ECCC), 2012

Identifying Cheaters without an Honest Majority.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

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

The complexity of information theoretic secure computation.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

From randomizing polynomials to parallel algorithms.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

Share Conversion and Private Information Retrieval.
Proceedings of the 27th Conference on Computational Complexity, 2012

2011
Correlation Extractors and Their Applications - (Invited Talk).
Proceedings of the Information Theoretic Security - 5th International Conference, 2011

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

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

2010
On d-Multiplicative Secret Sharing.
J. Cryptology, 2010

On Achieving the "Best of Both Worlds" in Secure Multiparty Computation.
IACR Cryptology ePrint Archive, 2010

Black-Box Constructions of Protocols for Secure Computation.
IACR Cryptology ePrint Archive, 2010

Founding Cryptography on Tamper-Proof Hardware Tokens.
IACR Cryptology ePrint Archive, 2010

Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography.
IACR Cryptology ePrint Archive, 2010

Semantic Security Under Related-Key Attacks and Applications.
IACR Cryptology ePrint Archive, 2010

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

On Locally Decodable Codes, Self-Correctable Codes, and t-Private PIR.
Algorithmica, 2010

Secure Computation and Its Diverse Applications.
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

Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Proceedings of the Innovations in Computer Science, 2010

From Secrecy to Soundness: Efficient Verification via Secure Computation.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Secure Multiparty Computation with Minimal Interaction.
Proceedings of the Advances in Cryptology, 2010

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

2009
Private multiparty sampling and approximation of vector combinations.
Theor. Comput. Sci., 2009

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

Cryptography with Constant Input Locality.
J. Cryptology, 2009

Bounded Key-Dependent Message Security.
IACR Cryptology ePrint Archive, 2009

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

2008
Secure Arithmetic Computation with No Honest Majority.
IACR Cryptology ePrint Archive, 2008

On Pseudorandom Generators with Linear Stretch in NC0.
Computational Complexity, 2008

OT-Combiners via Secure Computation.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Basing Weak Public-Key Cryptography on Strong One-Way Functions.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

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

Communication in the presence of replication.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle.
Proceedings of the Advances in Cryptology, 2008

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

Scalable Multiparty Computation with Nearly Optimal Work and Resilience.
Proceedings of the Advances in Cryptology, 2008

2007
Communication vs. Computation.
Computational Complexity, 2007

Evaluating Branching Programs on Encrypted Data.
Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

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

How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
Proceedings of the Advances in Cryptology, 2007

Efficient Arguments without Short PCPs.
Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 2007

2006
Secure multiparty computation of approximations.
ACM Trans. Algorithms, 2006

Cryptography in NC0.
SIAM J. Comput., 2006

Cryptography from Anonymity.
IACR Cryptology ePrint Archive, 2006

Computationally Private Randomizing Polynomials and Their Applications.
Computational Complexity, 2006

Black-box constructions for secure computation.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

On the randomness complexity of efficient sampling.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 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

On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation.
Proceedings of the Advances in Cryptology, 2006

Scalable Secure Multiparty Computation.
Proceedings of the Advances in Cryptology, 2006

2005
General constructions for information-theoretic private information retrieval.
J. Comput. Syst. Sci., 2005

Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator.
IACR Cryptology ePrint Archive, 2005

Sufficient Conditions for Collision-Resistant Hashing.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Keyword Search and Oblivious Pseudorandom Functions.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems.
Proceedings of the Advances in Cryptology, 2005

2004
Adaptive versus Non-Adaptive Security of Multi-Party Protocols.
J. Cryptology, 2004

Reducing the Servers' Computation in Private Information Retrieval: PIR with Preprocessing.
J. Cryptology, 2004

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

Communication Versus Computation.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

On the Hardness of Information-Theoretic Multiparty Computation.
Proceedings of the Advances in Cryptology, 2004

2003
Private computation using a PEZ dispenser.
Theor. Comput. Sci., 2003

Efficient Multi-Party Computation over Rings.
IACR Cryptology ePrint Archive, 2003

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

Extending Oblivious Transfers Efficiently.
Proceedings of the Advances in Cryptology, 2003

2002
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

On 2-Round Secure Multiparty Computation.
Proceedings of the Advances in Cryptology, 2002

2001
Universal Service-Providers for Private Information Retrieval.
J. Cryptology, 2001

On Privacy and Partition Arguments.
Inf. Comput., 2001

On adaptive vs. non-adaptive security of multiparty protocols.
IACR Cryptology ePrint Archive, 2001

On the Power of Nonlinear Secret-Sharing.
IACR Cryptology ePrint Archive, 2001

Information-Theoretic Private Information Retrieval: A Unified Construction
Electronic Colloquium on Computational Complexity (ECCC), 2001

The round complexity of verifiable secret sharing and secure multicast.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Selective private function evaluation with applications to private statistics.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

Priced Oblivious Transfer: How to Sell Digital Goods.
Proceedings of the Advances in Cryptology, 2001

On the Power of Nonlinear Secrect-Sharing.
Proceedings of the 16th Annual IEEE Conference on Computational Complexity, 2001

2000
Protecting Data Privacy in Private Information Retrieval Schemes.
J. Comput. Syst. Sci., 2000

Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
Improved Upper Bounds on Information-Theoretic Private Information Retrieval (Extended Abstract).
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

One-Way Functions Are Essential for Single-Server Private Information Retrieval.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Compressing Cryptographic Resources.
Proceedings of the Advances in Cryptology, 1999

1998
Universal Service Providers for Database Private Information Retrieval.
IACR Cryptology ePrint Archive, 1998

Non-Interactive and Non-Malleable Commitment.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Universal Service-Providers for Database Private Information Retrieval (Extended Abstract).
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

1997
Protecting Data Privacy in Private Information Retrieval Schemes.
IACR Cryptology ePrint Archive, 1997

Private Simultaneous Messages Protocols with Applications.
Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems, 1997

1996
Valid Generalisation from Approximate Interpolation.
Combinatorics, Probability & Computing, 1996


  Loading...