Mingyuan Wang

IACR Cryptol. ePrint Arch., 2024

2023

Reusable Secure Computation in the Plain Model.

[BibT_eX]

[DOI]

Vipul Goyal

Akshayaram Srinivasan

IACR Cryptol. ePrint Arch., 2023

hinTS: Threshold Signatures with Silent Setup.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

How to Prove Statements Obliviously?

[BibT_eX]

[DOI]

Sanjam Garg

Aarushi Goel

IACR Cryptol. ePrint Arch., 2023

Experimenting with Zero-Knowledge Proofs of Training.

[BibT_eX]

[DOI]

Guru-Vamsi Policharla

IACR Cryptol. ePrint Arch., 2023

Publicly Detectable Watermarking for Language Models.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Threshold Signatures in the Multiverse.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

2022

Cryptography with Weights: MPC, Encryption and Signatures.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

IBE with Incompressible Master Secret and Small Identity Secrets.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Overparameterized (robust) models from computational constraints.

[BibT_eX]

[DOI]

CoRR, 2022

Leakage-resilient Linear Secret-sharing Against Arbitrary Bounded-size Leakage Family.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Overparameterization from Computational Constraints.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Improved Bound on the Local Leakage-resilience of Shamir's Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Tight Estimate of the Local Leakage Resilience of the Additive Secret-Sharing Scheme & Its Consequences.

[BibT_eX]

[DOI]

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

2021

Computational Hardness of Optimal FairComputation: Beyond Minicrypt.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Leakage-resilience of the Shamir Secret-sharing Scheme against Physical-bit Leakages.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Optimally-secure Coin-tossing against a Byzantine Adversary.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Efficient Distributed Coin-tossing Protocols.

[BibT_eX]

[DOI]

Himanshi K. Mehta

Proceedings of the IEEE International Symposium on Information Theory, 2021

Lower Bounds for Leakage-Resilient Secret-Sharing Schemes against Probing Attacks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Computational Hardness of Optimal Fair Computation: Beyond Minicrypt.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Constructing Locally Leakage-Resilient Linear Secret-Sharing Schemes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020

Black-box use of One-way Functions is Useless for Optimal Fair Coin-Tossing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

On Leakage-Resilient Secret Sharing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Design & Analysis of Optimal Coin-tossing: New Techniques.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Coin Tossing with Lazy Defense: Hardness of Computation Results.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

2019

Explicit Rate-1 Non-malleable Codes for Local Tampering.

[BibT_eX]

[DOI]

Divya Gupta

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018

Non-malleable Codes Against Lookahead Tampering.

[BibT_eX]

[DOI]

Divya Gupta

Proceedings of the Progress in Cryptology - INDOCRYPT 2018, 2018

2017

Constant-rate Non-malleable Codes in the Split-state Model.

[BibT_eX]

[DOI]

Divya Gupta