Dakshita Khurana

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

COA-Secure Obfuscation and Applications.

[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

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

[BibT_eX]

[DOI]

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

2021

Two-Round Maliciously Secure Computation with Super-Polynomial Simulation.

[BibT_eX]

[DOI]

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

SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE.

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

On the CCA Compatibility of Public-Key Infrastructure.

[BibT_eX]

[DOI]

Brent Waters

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

Non-interactive Distributional Indistinguishability (NIDI) and Non-malleable Commitments.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Black-Box Non-interactive Non-malleable Commitments.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Post-Quantum Multi-Party Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Improved Computational Extractors and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

On the Round Complexity of Black-Box Secure MPC.

[BibT_eX]

[DOI]

Yuval Ishai

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Compact Ring Signatures from Learning with Errors.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

One-Way Functions Imply Secure Computation in a Quantum World.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

On the Round Complexity of Secure Quantum Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020

Lossy Correlation Intractability and PPAD Hardness from Sub-exponential LWE.

[BibT_eX]

[DOI]

Ruta Jawale

IACR Cryptol. ePrint Arch., 2020

On The Round Complexity of Two-Party Quantum Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Post-Quantum Multi-Party Computation in Constant Rounds.

[BibT_eX]

[DOI]

CoRR, 2020

On Statistical Security in Two-Party Computation.

[BibT_eX]

[DOI]

Muhammad Haris Mughees

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

Low Error Efficient Computational Extractors in the CRS Model.

[BibT_eX]

[DOI]

Ankit Garg

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Statistical ZAP Arguments.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

2019

Computational Extractors with Negligible Error in the CRS Model.

[BibT_eX]

[DOI]

Ankit Garg

IACR Cryptol. ePrint Arch., 2019

Weak zero-knowledge beyond the black-box barrier.

[BibT_eX]

[DOI]

Nir Bitansky

Omer Paneth

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Non-interactive Non-malleability from Quantum Supremacy.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018

How to Rewind with Minimal Interaction.

[BibT_eX]

[DOI]

PhD thesis, 2018

Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Non-Interactive Delegation for Low-Space Non-Deterministic Computation.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2018

Round Optimal Black-Box "Commit-and-Prove".

[BibT_eX]

[DOI]

Rafail Ostrovsky

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

Upgrading to Functional Encryption.

[BibT_eX]

[DOI]

Brent Waters

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

Succinct delegation for low-space non-deterministic computation.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Statistical Witness Indistinguishability (and more) in Two Messages.

[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

Promise Zero Knowledge and Its Applications to Round Optimal MPC.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017

Two-Message Non-Malleable Commitments from Standard Sub-exponential Assumptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Round Optimal Concurrent Non-malleability from Polynomial Hardness.

[BibT_eX]

[DOI]

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

Round Optimal Concurrent MPC via Strong Simulation.

[BibT_eX]

[DOI]

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

How to Achieve Non-Malleability in One or Two Rounds.

[BibT_eX]

[DOI]

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs.

[BibT_eX]

[DOI]

Rafail Ostrovsky

Ivan Visconti

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

Distinguisher-Dependent Simulation in Two Rounds and its Applications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016

New Feasibility Results in Unconditional UC-Secure Computation with (Malicious) PUFs.

[BibT_eX]

[DOI]

Rafail Ostrovsky

Ivan Visconti

IACR Cryptol. ePrint Arch., 2016

Do Distributed Differentially-Private Protocols Require Oblivious Transfer?.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Breaking the Three Round Barrier for Non-malleable Commitments.

[BibT_eX]

[DOI]

Vipul Goyal

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

Secure Computation from Elastic Noisy Channels.

[BibT_eX]

[DOI]

Hemanta K. Maji

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

All Complete Functionalities are Reversible.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

How to Generate and Use Universal Samplers.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015

Witness Signatures and Non-Malleable Multi-Prover Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

Vipul Goyal

Aayush Jain

IACR Cryptol. ePrint Arch., 2015

Statistical Randomized Encodings: A Complexity Theoretic View.

[BibT_eX]

[DOI]

Shweta Agrawal

Yuval Ishai

Anat Paskin-Cherniavsky

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

Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation.

[BibT_eX]

[DOI]

Vanishree Rao

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

How to Generate and use Universal Parameters.

[BibT_eX]

[DOI]

Brent Waters

IACR Cryptol. ePrint Arch., 2014

Black-Box Separations for Differentially Private Protocols.

[BibT_eX]

[DOI]