Yuval Ishai

Yifan Song

Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Asymptotically Quasi-Optimal Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Secure Multiparty Computation with Sublinear Preprocessing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Beyond the Csiszár-Korner Bound: Best-Possible Wiretap Coding via Obfuscation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Tight Bounds on the Randomness Complexity of Secure Multiparty Computation.

[BibT_eX]

[DOI]

Vipul Goyal

Saikrishna Badrinarayanan

Yifan Song

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Authenticated Garbling from Simple Correlations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Programmable Distributed Point Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Correlated Pseudorandomness from Expand-Accumulate Codes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Information-Theoretic Distributed Point Functions.

[BibT_eX]

[DOI]

Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022

Refuting the Dream XOR Lemma via Ideal Obfuscation and Resettable MPC.

[BibT_eX]

[DOI]

Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022

Improving Line-Point Zero Knowledge: Two Multiplications for the Price of One.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

PSI from Ring-OLE.

[BibT_eX]

[DOI]

Wutichai Chongchitmate

Steve Lu

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021

Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority.

[BibT_eX]

[DOI]

Ruihan Wang

Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

Lightweight Techniques for Private Heavy Hitters.

[BibT_eX]

[DOI]

Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

A Geometric Approach to Homomorphic Secret Sharing.

[BibT_eX]

[DOI]

Russell W. F. Lai

Giulio Malavolta

Proceedings of the Public-Key Cryptography - PKC 2021, 2021

Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

On the Round Complexity of Black-Box Secure MPC.

[BibT_eX]

[DOI]

Dakshita Khurana

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

MPC-Friendly Symmetric Cryptography from Alternating Moduli: Candidates, Protocols, and Applications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Sublinear GMW-Style Compiler for MPC with Preprocessing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Low-Complexity Weak Pseudorandom Functions in $\mathtt {AC}0[\mathtt {MOD}2]$.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentration.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Line-Point Zero Knowledge and Its Applications.

[BibT_eX]

[DOI]

Samuel Dittmer

Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

Shorter and Faster Post-Quantum Designated-Verifier zkSNARKs from Lattices.

[BibT_eX]

[DOI]

Hang Su

David J. Wu

Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020

How Low Can We Go?

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Function Secret Sharing for PSI-CA: With Applications to Private Contact Tracing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

On Computational Shortcuts for Information-Theoretic PIR.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

On Pseudorandom Encodings.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Affine Determinant Programs: A Framework for Obfuscation and Witness Encryption.

[BibT_eX]

[DOI]

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?

[BibT_eX]

[DOI]

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Separating Two-Round Secure Computation From Oblivious Transfer.

[BibT_eX]

[DOI]

Mohammad Hossein Faghihi Sereshgi

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Correlated Pseudorandom Functions from Variable-Density LPN.

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Proximity Gaps for Reed-Solomon Codes.

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Efficient Pseudorandom Correlation Generators from Ring-LPN.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

On Succinct Arguments and Witness Encryption from Groups.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Limits of Preprocessing.

[BibT_eX]

[DOI]

Proceedings of the 35th Computational Complexity Conference, 2020

Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC.

[BibT_eX]

[DOI]

Jackson Abascal

Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

Cryptography from One-Way Communication: On Completeness of Finite Channels.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019

How to Prove a Secret: Zero-Knowledge Proofs on Distributed Data via Fully Linear PCPs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

On Fully Secure MPC with Solitary Output.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Secure Computation with Preprocessing via Function Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Cryptographic Sensing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Trapdoor Hash Functions and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Reusable Non-Interactive Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Efficient Pseudorandom Correlation Generators: Silent OT Extension and More.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Unconditionally Secure Computation Against Low-Complexity Leakage.

[BibT_eX]

[DOI]

Andrej Bogdanov

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

LevioSA: Lightweight Secure Arithmetic Computation.

[BibT_eX]

[DOI]

Antonio Marcedone

Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018

Outsourcing Private Machine Learning via Lightweight Secure Arithmetic Computation.

[BibT_eX]

[DOI]

CoRR, 2018

Best Possible Information-Theoretic MPC.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Two-Round MPC: Information-Theoretic and Black-Box.

[BibT_eX]

[DOI]

Sanjam Garg

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Exploring Crypto Dark Matter: - New Simple PRF Candidates and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

On the Message Complexity of Secure Multiparty Computation.

[BibT_eX]

[DOI]

Manika Mittal

Proceedings of the Public-Key Cryptography - PKC 2018, 2018

Foundations of Homomorphic Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs.

[BibT_eX]

[DOI]

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

Limits of Practical Sublinear Secure Computation.

[BibT_eX]

[DOI]

Antigoni Polychroniadou

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

On the Local Leakage Resilience of Linear Secret Sharing Schemes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Private Circuits: A Modular Approach.

[BibT_eX]

[DOI]

Prabhanjan Ananth

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Compressing Vector OLE.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017

Near-Optimal Secret Sharing and Error Correcting Codes in AC0.

[BibT_eX]

[DOI]

Kuan Cheng

Xin Li

IACR Cryptol. ePrint Arch., 2017

Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

How to Construct a Leakage-Resilient (Stateless) Trusted Party.

[BibT_eX]

[DOI]

Daniel Genkin

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Near-Optimal Secret Sharing and Error Correcting Codes in \mathsf AC^0 AC 0.

[BibT_eX]

[DOI]

Kuan Cheng

Xin Li

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Can We Access a Database Both Locally and Privately?

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Low-Complexity Cryptographic Hash Functions .

[BibT_eX]

[DOI]

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation.

[BibT_eX]

[DOI]

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

Lattice-Based SNARGs and Their Application to More Efficient Obfuscation.

[BibT_eX]

[DOI]

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

Ad Hoc PSM Protocols: Secure Computation Without Coordination.

[BibT_eX]

[DOI]

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

The Price of Low Communication in Secure Multi-party Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Secure Arithmetic Computation with Constant Computational Overhead.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Homomorphic Secret Sharing: Optimizations and Applications.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

Ligero: Lightweight Sublinear Arguments Without a Trusted Setup.

[BibT_eX]

[DOI]

Scott Ames

Saikrishna Badrinarayanan

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

Non-Interactive Multiparty Computation Without Correlated Randomness.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016

Special Section on the Fifty-Fourth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013).

[BibT_eX]

[DOI]

Moritz Hardt

Virginia Vassilevska Williams

Raghu Meka

SIAM J. Comput., 2016

Special Section on the Forty-Fifth Annual ACM Symposium on the Theory of Computing (STOC 2013).

[BibT_eX]

[DOI]

James Aspnes

Peter Bro Miltersen

SIAM J. Comput., 2016

Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits.

[BibT_eX]

[DOI]

Guang Yang

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Binary AMD Circuits from Secure Multiparty Computation.

[BibT_eX]

[DOI]

Daniel Genkin

Proceedings of the Theory of Cryptography - 14th International Conference, 2016

On Public Key Encryption from Noisy Codewords.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2016, 2016

Secure Multiparty Computation with General Interaction Patterns.

[BibT_eX]

[DOI]

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

Distribution Design.

[BibT_eX]

[DOI]

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

Bounded-Communication Leakage Resilience via Parity-Resilient Circuits.

[BibT_eX]

[DOI]

Alexander A. Sherstov

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Private Large-Scale Databases with Distributed Searchable Symmetric Encryption.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology - CT-RSA 2016 - The Cryptographers' Track at the RSA Conference 2016, San Francisco, CA, USA, February 29, 2016

Secure Protocol Transformations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Breaking the Circuit Size Barrier for Secure Computation Under DDH.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Bounded Indistinguishability and the Complexity of Recovering Secrets.

[BibT_eX]

[DOI]

Andrej Bogdanov

Emanuele Viola

Christopher Williamson

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Function Secret Sharing: Improvements and Extensions.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015

Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

J. Cryptol., 2015

Minimizing Locality of One-Way Functions via Semi-Private Randomized Encodings.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2015

Public-Coin Differing-Inputs Obfuscation and Its Applications.

[BibT_eX]

[DOI]

Omkant Pandey

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Statistical Randomized Encodings: A Complexity Theoretic View.

[BibT_eX]

[DOI]

Shweta Agrawal

Dakshita Khurana

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Function Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Secure Computation with Minimal Interaction, Revisited.

[BibT_eX]

[DOI]

Ranjit Kumaresan

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Parallel Hashing via List Recoverability.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits.

[BibT_eX]

[DOI]

Daniel Genkin

Antigoni Polychroniadou

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Cryptography with One-Way Communication.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Secure Computation from Leaky Correlated Randomness.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014

Probabilistically Checkable Proofs of Proximity with Zero-Knowledge.

[BibT_eX]

[DOI]

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

On the Cryptographic Complexity of the Worst Functions.

[BibT_eX]

[DOI]

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

Circuits resilient to additive attacks with applications to secure computation.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing, 2014

Single-use ot combiners with near-optimal resilience.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Erez Druk

Proceedings of the Innovations in Theoretical Computer Science, 2014

Partial Garbling Schemes and Their Applications.

[BibT_eX]

[DOI]

Hoeteck Wee

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

Distributed Point Functions and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

On the Complexity of UC Commitments.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Secure Multi-Party Computation with Identifiable Abort.

[BibT_eX]

[DOI]

Vassilis Zikas

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Non-Interactive Secure Multiparty Computation.

[BibT_eX]

[DOI]

Prabhanjan Vijendra Ananth

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Optimizing Obfuscation: Avoiding Barrington's Theorem.

[BibT_eX]

[DOI]

Divya Gupta

Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

2013

Randomization Techniques for Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Secure Multi-Party Computation, 2013

Efficient Multiparty Protocols via Log-Depth Threshold Formulae.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2013

On the Power of Correlated Randomness in Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Succinct Non-interactive Arguments via Linear Interactive Proofs.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Lossy Chains and Fractional Secret Sharing.

[BibT_eX]

[DOI]

Omer Strulovich

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Robust Pseudorandom Generators.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

On Linear-Size Pseudorandom Generators and Hardcore Functions.

[BibT_eX]

[DOI]

Joshua Baron

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Zero Knowledge LTCs and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012

Encoding Functions with Constant Online Rate or How to Compress Keys in Garbled Circuits.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Identifying Cheaters without an Honest Majority.

[BibT_eX]

[DOI]

Hakan Seyalioglu

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

On Efficient Zero-Knowledge PCPs.

[BibT_eX]

[DOI]

Mohammad Mahmoody

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

The complexity of information theoretic secure computation.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

From randomizing polynomials to parallel algorithms.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

Share Conversion and Private Information Retrieval.

[BibT_eX]

[DOI]

Proceedings of the 27th Conference on Computational Complexity, 2012

2011

On Achieving the "Best of Both Worlds" in Secure Multiparty Computation.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

Black-Box Constructions of Protocols for Secure Computation.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

Semantic Security under Related-Key Attacks and Applications.

[BibT_eX]

[DOI]

Danny Harnik

Proceedings of the Innovations in Computer Science, 2011

Correlation Extractors and Their Applications - (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security - 5th International Conference, 2011

How to Garble Arithmetic Circuits.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Efficient Non-interactive Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Constant-Rate Oblivious Transfer from Noisy Channels.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010

On d-Multiplicative Secret Sharing.

[BibT_eX]

[DOI]

Enav Weinreb

J. Cryptol., 2010

Secure Computation and Its Diverse Applications.

[BibT_eX]

[DOI]

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

Founding Cryptography on Tamper-Proof Hardware Tokens.

[BibT_eX]

[DOI]

Vipul Goyal

Ramarathnam Venkatesan

Akshay Wadia

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

On Complete Primitives for Fairness.

[BibT_eX]

[DOI]

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

Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?

[BibT_eX]

[DOI]

Proceedings of the Innovations in Computer Science, 2010

From Secrecy to Soundness: Efficient Verification via Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography.

[BibT_eX]

[DOI]

Mikkel Krøigaard

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

Bounded Key-Dependent Message Security.

[BibT_eX]

[DOI]

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

Secure Multiparty Computation with Minimal Interaction.

[BibT_eX]

[DOI]

Anat Paskin

Proceedings of the Advances in Cryptology, 2010

Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2010

On Invertible Sampling and Adaptive Security.

[BibT_eX]

[DOI]

Abishek Kumarasubramanian

Claudio Orlandi

Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009

Zero-Knowledge Proofs from Secure Multiparty Computation.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

Secure Arithmetic Computation with No Honest Majority.

[BibT_eX]

[DOI]

Manoj Prabhakaran

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

Extracting Correlations.

[BibT_eX]

[DOI]

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

2008

OT-Combiners via Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Basing Weak Public-Key Cryptography on Strong One-Way Functions.

[BibT_eX]

[DOI]

Eli Biham

Yaron J. Goren

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Cryptography with constant computational overhead.

[BibT_eX]

[DOI]

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

Communication in the presence of replication.

[BibT_eX]

[DOI]

Enav Weinreb

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

Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle.

[BibT_eX]

[DOI]

Jens Groth

Proceedings of the Advances in Cryptology, 2008

Founding Cryptography on Oblivious Transfer - Efficiently.

[BibT_eX]

[DOI]

Manoj Prabhakaran

Proceedings of the Advances in Cryptology, 2008

Scalable Multiparty Computation with Nearly Optimal Work and Resilience.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2008

2007

Communication vs. Computation.

[BibT_eX]

[DOI]

Comput. Complex., 2007

Evaluating Branching Programs on Encrypted Data.

[BibT_eX]

[DOI]

Anat Paskin

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

Zero-knowledge from secure multiparty computation.

[BibT_eX]

[DOI]

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

Private Multiparty Sampling and Approximation of Vector Combinations.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?

[BibT_eX]

[DOI]

Danny Harnik

Proceedings of the Advances in Cryptology, 2007

Cryptography with Constant Input Locality.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

Efficient Arguments without Short PCPs.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 2007

On Locally Decodable Codes, Self-correctable Codes, and t -Private PIR.

[BibT_eX]

[DOI]

Enav Weinreb

Proceedings of the Approximation, 2007

2006

Black-box constructions for secure computation.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

On the randomness complexity of efficient sampling.

[BibT_eX]

[DOI]

Bella Dubrov

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Cryptography from Anonymity.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006

Private Circuits II: Keeping Secrets in Tamperable Circuits.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2006

Scalable Secure Multiparty Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2006

On Pseudorandom Generators with Linear Stretch in NC0.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2006

2005

General constructions for information-theoretic private information retrieval.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2005

Sufficient Conditions for Collision-Resistant Hashing.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Keyword Search and Oblivious Pseudorandom Functions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation.

[BibT_eX]

[DOI]

Ronald Cramer

Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

Computationally Private Randomizing Polynomials and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005

2004

Adaptive versus Non-Adaptive Security of Multi-Party Protocols.

[BibT_eX]

[DOI]

J. Cryptol., 2004

Batch codes and their applications.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Communication Versus Computation.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Cryptography in NC0.

[BibT_eX]

[DOI]

Proceedings of the 45th Symposium on Foundations of Computer Science, 2004

On the Hardness of Information-Theoretic Multiparty Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2004

2003

Private computation using a PEZ dispenser.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Efficient Multi-party Computation over Rings.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2003

Private Circuits: Securing Hardware against Probing Attacks.

[BibT_eX]

[DOI]

David A. Wagner

Proceedings of the Advances in Cryptology, 2003

Extending Oblivious Transfers Efficiently.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2003

2002

Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval.

[BibT_eX]

[DOI]

Jean-François Raymond

Proceedings of the 43rd Symposium on Foundations of Computer Science, 2002

On 2-Round Secure Multiparty Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2002

2001

Universal Service-Providers for Private Information Retrieval.

[BibT_eX]

[DOI]

J. Cryptol., 2001

On the Power of Nonlinear Secret-Sharing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2001

The round complexity of verifiable secret sharing and secure multicast.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Selective private function evaluation with applications to private statistics.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

Secure Multiparty Computation of Approximations.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Information-Theoretic Private Information Retrieval: A Unified Construction.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

On Adaptive vs. Non-adaptive Security of Multiparty Protocols.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2001

Priced Oblivious Transfer: How to Sell Digital Goods.

[BibT_eX]

[DOI]

William Aiello

Omer Reingold

Proceedings of the Advances in Cryptology, 2001

On the Power of Nonlinear Secrect-Sharing.

[BibT_eX]

[DOI]

Proceedings of the 16th Annual IEEE Conference on Computational Complexity, 2001

2000

Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing.

[BibT_eX]

[DOI]

Tal Malkin

Proceedings of the Advances in Cryptology, 2000

1999

Private computation and correlated randomness.

[BibT_eX]

[DOI]

PhD thesis, 1999

Improved Upper Bounds on Information-Theoretic Private Information Retrieval (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

One-Way Functions Are Essential for Single-Server Private Information Retrieval.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Compressing Cryptographic Resources.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1999

1998

Universal Service Providers for Database Private Information Retrieval.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 1998

Protecting Data Privacy in Private Information Retrieval Schemes.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Non-Interactive and Non-Malleable Commitment.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Universal Service-Providers for Database Private Information Retrieval (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

1997

Protecting Data Privacy in Private Information Retrieval Schemes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 1997

Private Simultaneous Messages Protocols with Applications.

[BibT_eX]

[DOI]

Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems, 1997

1996

Valid Generalisation from Approximate Interpolation.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1996

On Privacy and Partition Arguments.

[BibT_eX]

Benny Chor