Constant-rate Non-malleable Codes in the Split-state Model. - Divya Gupta 001; Hemanta K. Maji; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2017)

Non-malleable Codes Against Lookahead Tampering. - Divya Gupta 001; Hemanta K. Maji; Mingyuan Wang 001 (INDOCRYPT, 2018)

Explicit Rate-1 Non-malleable Codes for Local Tampering. - Divya Gupta 001; Hemanta K. Maji; Mingyuan Wang 001 (CRYPTO (1), 2019)

Coin Tossing with Lazy Defense: Hardness of Computation Results. - Hamidreza Amini Khorasgani; Hemanta K. Maji; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2020)

Design & Analysis of Optimal Coin-tossing: New Techniques. - Hamidreza Amini Khorasgani; Hemanta K. Maji; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2020)

On Leakage-Resilient Secret Sharing. - Hemanta K. Maji; Anat Paskin-Cherniavsky; Tom Suad; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2020)

Black-box use of One-way Functions is Useless for Optimal Fair Coin-Tossing. - Hemanta K. Maji; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2020)

Constructing Locally Leakage-Resilient Linear Secret-Sharing Schemes. - Hemanta K. Maji; Anat Paskin-Cherniavsky; Tom Suad; Mingyuan Wang 001 (CRYPTO (3), 2021)

Computational Hardness of Optimal Fair Computation: Beyond Minicrypt. - Hemanta K. Maji; Mingyuan Wang 001 (CRYPTO (2), 2021)

Lower Bounds for Leakage-Resilient Secret-Sharing Schemes against Probing Attacks. - Donald Q. Adams; Hemanta K. Maji; Hai H. Nguyen; Minh L. Nguyen; Anat Paskin-Cherniavsky; Tom Suad; Mingyuan Wang 001 (ISIT, 2021)

Efficient Distributed Coin-tossing Protocols. - Hamidreza Amini Khorasgani; Hemanta K. Maji; Himanshi K. Mehta; Mingyuan Wang 001 (ISIT, 2021)

Optimally-secure Coin-tossing against a Byzantine Adversary. - Hamidreza Amini Khorasgani; Hemanta K. Maji; Mingyuan Wang 001 (ISIT, 2021)

Leakage-resilience of the Shamir Secret-sharing Scheme against Physical-bit Leakages. - Hemanta K. Maji; Hai H. Nguyen; Anat Paskin-Cherniavsky; Tom Suad; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2021)

Computational Hardness of Optimal FairComputation: Beyond Minicrypt. - Hemanta K. Maji; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2021)

Tight Estimate of the Local Leakage Resilience of the Additive Secret-Sharing Scheme & Its Consequences. - Hemanta K. Maji; Hai H. Nguyen; Anat Paskin-Cherniavsky; Tom Suad; Mingyuan Wang 001; Xiuyu Ye; Albert Yu 003 (ITC, 2022)

Improved Bound on the Local Leakage-resilience of Shamir's Secret Sharing. - Hemanta K. Maji; Hai H. Nguyen; Anat Paskin-Cherniavsky; Mingyuan Wang 001 (ISIT, 2022)

Overparameterization from Computational Constraints. - Sanjam Garg; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Mingyuan Wang 001 (NeurIPS, 2022)

Leakage-resilient Linear Secret-sharing Against Arbitrary Bounded-size Leakage Family. - Hemanta K. Maji; Hai H. Nguyen; Anat Paskin-Cherniavsky; Tom Suad; Mingyuan Wang 001; Xiuyu Ye; Albert Yu 003 (TCC (1), 2022)

Overparameterized (robust) models from computational constraints. - Sanjam Garg; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Mingyuan Wang 001 (CoRR, 2022)

IBE with Incompressible Master Secret and Small Identity Secrets. - Nico Döttling; Sanjam Garg; Sruthi Sekar; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2022)

Cryptography with Weights: MPC, Encryption and Signatures. - Sanjam Garg; Abhishek Jain 002; Pratyay Mukherjee; Rohit Sinha 001; Mingyuan Wang 001; Yinuo Zhang (IACR Cryptol. ePrint Arch., 2022)

Threshold Signatures in the Multiverse. - Leemon Baird; Sanjam Garg; Abhishek Jain 002; Pratyay Mukherjee; Rohit Sinha 001; Mingyuan Wang 001; Yinuo Zhang (IACR Cryptol. ePrint Arch., 2023)

Experimenting with Zero-Knowledge Proofs of Training. - Sanjam Garg; Aarushi Goel; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Guru-Vamsi Policharla; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2023)

How to Prove Statements Obliviously? - Sanjam Garg; Aarushi Goel; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2023)

hinTS: Threshold Signatures with Silent Setup. - Sanjam Garg; Abhishek Jain 002; Pratyay Mukherjee; Rohit Sinha 001; Mingyuan Wang 001; Yinuo Zhang (IACR Cryptol. ePrint Arch., 2023)

Reusable Secure Computation in the Plain Model. - Vipul Goyal; Akshayaram Srinivasan; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2023)

On the Black-Box Complexity of Private-Key Inner-Product Functional Encryption. - Mohammad Hajiabadi; Roman Langrehr; Adam O'Neill; Mingyuan Wang 001 (TCC (3), 2024)

Publicly-Detectable Watermarking for Language Models. - Jaiden Fairoze; Sanjam Garg; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Mingyuan Wang 001 (IACR Commun. Cryptol., 2024)

Practical Mempool Privacy via One-time Setup Batched Threshold Encryption. - Arka Rai Choudhuri; Sanjam Garg; Guru-Vamsi Policharla; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2024)

Threshold Encryption with Silent Setup. - Sanjam Garg; Dimitris Kolonelos; Guru-Vamsi Policharla; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2024)

Black-Box Crypto is Useless for Pseudorandom Codes. - Sanjam Garg; Sam Gunn; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2025)

Scalable Multiparty Computation from Non-linear Secret Sharing. - Sanjam Garg; Abhishek Jain 002; Pratyay Mukherjee; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2025)

Multiparty Distributed Point Functions. - Aarushi Goel; Mingyuan Wang 001; Zhiheng Wang (IACR Cryptol. ePrint Arch., 2025)