Abhishek Jain

Yinuo Zhang

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

2021

SNARGs for <i>P</i> from LWE.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

On Communication Models and Best-Achievable Security in Two-Round MPC.

[BibT_eX]

[DOI]

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

Oblivious Transfer from Trapdoor Permutations in Minimal Rounds.

[BibT_eX]

[DOI]

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

SNARGs for $\mathcal{P}$ from LWE.

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Order-C Secure Multiparty Computation for Highly Repetitive Circuits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Unbounded Multi-party Computation from Learning with Errors.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Non-interactive Zero Knowledge from Sub-exponential DDH.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Non-interactive Batch Arguments for NP from Standard Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Fluid MPC: Secure Multiparty Computation with Dynamic Participants.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020

Self-Processing Private Sensor Data via Garbled Encryption.

[BibT_eX]

[DOI]

Nathan Manohar

IACR Cryptol. ePrint Arch., 2020

Multikey FHE in the Plain Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Multiparty Homomorphic Encryption (or: On Removing Setup in Multi-Key FHE).

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Round Optimal Secure Multiparty Computation from Minimal Assumptions.

[BibT_eX]

[DOI]

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

Multi-key Fully-Homomorphic Encryption in the Plain Model.

[BibT_eX]

[DOI]

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

The Round Complexity of Secure Computation Against Covert Adversaries.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Statistical Zaps and New Oblivious Transfer Protocols.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Towards Efficiency-Preserving Round Compression in MPC - Do Fewer Rounds Mean More Computation?

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019

Statistical Zap Arguments from Quasi-Polynomial LWE.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Interactive Non-malleable Codes.

[BibT_eX]

[DOI]

Nils Fleischhacker

Anat Paskin-Cherniavsky

Slava Radune

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

Founding Secure Computation on Blockchains.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Two Round Information-Theoretic MPC with Malicious Security.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

The Broadcast Message Complexity of Secure Multiparty Computation.

[BibT_eX]

[DOI]

Sanjam Garg

Aarushi Goel

Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

Public-Key Function-Private Hidden Vector Encryption (and More).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

UC-Secure Multiparty Computation from One-Way Functions Using Stateless Tokens.

[BibT_eX]

[DOI]

Rafail Ostrovsky

Ivan Visconti

Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018

Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

The Bottleneck Complexity of Secure Multiparty Computation.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

On the Existence of Three Round Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

Nils Fleischhacker

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

Promise Zero Knowledge and Its Applications to Round Optimal MPC.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Round-Optimal Secure Multiparty Computation with Honest Majority.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Non-interactive Secure Computation from One-Way Functions.

[BibT_eX]

[DOI]

Rafail Ostrovsky

Ivan Visconti

Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017

Round Optimal Concurrent MPC via Strong Simulation.

[BibT_eX]

[DOI]

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

On Secure Two-Party Computation in Three Rounds.

[BibT_eX]

[DOI]

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

Patchable Indistinguishability Obfuscation: i<i>O</i> for Evolving Software.

[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

Cryptography with Updates.

[BibT_eX]

[DOI]

Aloni Cohen

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

A New Approach to Round-Optimal Secure Multiparty Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Distinguisher-Dependent Simulation in Two Rounds and its Applications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Fairness in an Unfair World: Fair Multiparty Computation from Public Bulletin Boards.

[BibT_eX]

[DOI]

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

2016

Secure Multiparty Computation with General Interaction Patterns.

[BibT_eX]

[DOI]

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

Time-Lock Puzzles from Randomized Encodings.

[BibT_eX]

[DOI]

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

2015

Patchable Obfuscation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Indistinguishability Obfuscation with Constant Size Overhead.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Achieving Compactness Generically: Indistinguishability Obfuscation from Non-Compact Functional Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Functional Encryption for Randomized Functionalities.

[BibT_eX]

[DOI]

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

Succinct Garbling and Indistinguishability Obfuscation for RAM Programs.

[BibT_eX]

[DOI]

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Interactive Coding for Multiparty Protocols.

[BibT_eX]

[DOI]

Yael Tauman Kalai

Allison Bishop Lewko

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Concurrent Secure Computation with Optimal Query Complexity.

[BibT_eX]

[DOI]

Ran Canetti

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Indistinguishability Obfuscation from Compact Functional Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Function-Hiding Inner Product Encryption.

[BibT_eX]

[DOI]

Allison Bishop

Lucas Kowalczyk

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.

[BibT_eX]

[DOI]

Divya Gupta

2014

Indistinguishability Obfuscation of Iterated Circuits and RAM Programs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Non-Malleable Zero Knowledge: Black-Box Constructions and Definitional Relationships.

[BibT_eX]

[DOI]

Omkant Pandey

Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Multi-input Functional Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity.

[BibT_eX]

[DOI]

Ran Canetti

Omer Paneth

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Practical UC security with a Global Random Oracle.

[BibT_eX]

[DOI]

Ran Canetti

Alessandra Scafuro

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

2013

The IPS Compiler.

[BibT_eX]

[DOI]

Proceedings of the Secure Multi-Party Computation, 2013

Multi-Input Functional Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Concurrent Zero Knowledge in the Bounded Player Model.

[BibT_eX]

[DOI]

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

Why "Fiat-Shamir for Proofs" Lacks a Proof.

[BibT_eX]

[DOI]

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

On Concurrently Secure Computation in the Multiple Ideal Query Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2013

What Information Is Leaked under Concurrent Composition?

[BibT_eX]

[DOI]

Divya Gupta

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

On the Achievability of Simulation-Based Security for Functional Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Secure Computation against Adaptive Auxiliary Information.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Constant-Round Concurrent Zero Knowledge in the Bounded Player Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012

New Frontiers in Secure Computation.

[BibT_eX]

[DOI]

PhD thesis, 2012

Concurrent Zero Knowledge in the Bounded Player Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

On the (In)security of the Fiat-Shamir Paradigm, Revisited.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Commitments and Efficient Zero-Knowledge Proofs from Hard Learning Problems.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Hardness Preserving Constructions of Pseudorandom Functions.

[BibT_eX]

[DOI]

Krzysztof Pietrzak

Aris Tentes

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

Counterexamples to Hardness Amplification beyond Negligible.

[BibT_eX]

[DOI]

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

Multiparty computation secure against continual memory leakage.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Concurrently Secure Computation in Constant Rounds.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE.

[BibT_eX]

[DOI]

Gilad Asharov

Daniel Wichs

IACR Cryptol. ePrint Arch., 2011

Parallel Repetition for Leakage Resilience Amplification Revisited.

[BibT_eX]

[DOI]

Krzysztof Pietrzak

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Bringing People of Different Beliefs Together to Do UC.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Efficient Authentication from Hard Learning Problems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Leakage-Resilient Zero Knowledge.

[BibT_eX]

[DOI]

Sanjam Garg

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010

On the round complexity of covert computation.

[BibT_eX]

[DOI]

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

Password-Authenticated Session-Key Generation on the Internet in the Plain Model.

[BibT_eX]

[DOI]

Rafail Ostrovsky

Proceedings of the Advances in Cryptology, 2010

2008

Bounded Ciphertext Policy Attribute Based Encryption.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Packet-dropping adversary identification for data plane security.

[BibT_eX]

[DOI]

Xin Zhang

Adrian Perrig

Proceedings of the 2008 ACM Conference on Emerging Network Experiment and Technology, 2008

2005

Improvements to Mitchell's Remote User Authentication Protocol.

[BibT_eX]

[DOI]