default search action
Mingyuan Wang 0001
Person information
- affiliation: University of California Berkeley, CA, USA
- affiliation (Ph.D.): Purdue University, West Lafayette, IN, USA
Other persons with the same name
- Mingyuan Wang 0002
— Shanghai University of Engineering Science, Shanghai, China
- Mingyuan Wang 0003
- Mingyuan Wang 0004
- Mingyuan Wang 0005
- Mingyuan Wang 0006 — Shandong Jianzhu University, Jinan, China
- Mingyuan Wang 0007 — Key Laboratory of Lunar and Deep-Space Exploration, Chinese Academy of Sciences, Beijing, China
- Mingyuan Wang 0008
- Mingyuan Wang 0009
- Mingyuan Wang 0010 — Shandong Normal University, Business School, Jinan, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c22]Sanjam Garg, Dimitris Kolonelos, Guru-Vamsi Policharla, Mingyuan Wang:
Threshold Encryption with Silent Setup. CRYPTO (7) 2024: 352-386 - [c21]Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Mingyuan Wang:
Scalable Multiparty Computation from Non-linear Secret Sharing. CRYPTO (8) 2024: 384-417 - [c20]Sanjam Garg, Aarushi Goel, Mingyuan Wang:
How to Prove Statements Obliviously? CRYPTO (10) 2024: 449-487 - [c19]Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Rohit Sinha, Mingyuan Wang, Yinuo Zhang:
hinTS: Threshold Signatures with Silent Setup. SP 2024: 3034-3052 - [i19]Sanjam Garg
Threshold Encryption with Silent Setup. IACR Cryptol. ePrint Arch. 2024: 263 (2024) - [i18]Arka Rai Choudhuri, Sanjam Garg, Guru-Vamsi Policharla, Mingyuan Wang:
Practical Mempool Privacy via One-time Setup Batched Threshold Encryption. IACR Cryptol. ePrint Arch. 2024: 1516 (2024) - 2023
- [c18]Sanjam Garg
Experimenting with Zero-Knowledge Proofs of Training. CCS 2023: 1880-1894 - [c17]Sanjam Garg, Abhishek Jain, Pratyay Mukherjee
Cryptography with Weights: MPC, Encryption and Signatures. CRYPTO (1) 2023: 295-327 - [c16]Vipul Goyal, Akshayaram Srinivasan, Mingyuan Wang:
Reusable Secure Computation in the Plain Model. CRYPTO (1) 2023: 427-458 - [c15]Leemon Baird, Sanjam Garg
Threshold Signatures in the Multiverse. SP 2023: 1454-1470 - [i17]Jaiden Fairoze, Sanjam Garg
Publicly Detectable Watermarking for Language Models. CoRR abs/2310.18491 (2023) - [i16]Leemon Baird, Sanjam Garg
Threshold Signatures in the Multiverse. IACR Cryptol. ePrint Arch. 2023: 63 (2023) - [i15]Sanjam Garg
hinTS: Threshold Signatures with Silent Setup. IACR Cryptol. ePrint Arch. 2023: 567 (2023) - [i14]Vipul Goyal, Akshayaram Srinivasan, Mingyuan Wang:
Reusable Secure Computation in the Plain Model. IACR Cryptol. ePrint Arch. 2023: 1006 (2023) - [i13]Sanjam Garg
Experimenting with Zero-Knowledge Proofs of Training. IACR Cryptol. ePrint Arch. 2023: 1345 (2023) - [i12]Sanjam Garg
How to Prove Statements Obliviously? IACR Cryptol. ePrint Arch. 2023: 1609 (2023) - [i11]Jaiden Fairoze, Sanjam Garg
Publicly Detectable Watermarking for Language Models. IACR Cryptol. ePrint Arch. 2023: 1661 (2023) - 2022
- [c14]Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang, Xiuyu Ye, Albert Yu:
Tight Estimate of the Local Leakage Resilience of the Additive Secret-Sharing Scheme & Its Consequences. ITC 2022: 16:1-16:19 - [c13]Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Mingyuan Wang:
Improved Bound on the Local Leakage-resilience of Shamir's Secret Sharing. ISIT 2022: 2678-2683 - [c12]Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Mingyuan Wang:
Overparameterization from Computational Constraints. NeurIPS 2022 - [c11]Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang, Xiuyu Ye, Albert Yu:
Leakage-resilient Linear Secret-sharing Against Arbitrary Bounded-size Leakage Family. TCC (1) 2022: 355-383 - [c10]Nico Döttling, Sanjam Garg, Sruthi Sekar, Mingyuan Wang:
IBE with Incompressible Master Secret and Small Identity Secrets. TCC (1) 2022: 588-617 - [i10]Sanjam Garg
Overparameterized (robust) models from computational constraints. CoRR abs/2208.12926 (2022) - [i9]Nico Döttling, Sanjam Garg
IBE with Incompressible Master Secret and Small Identity Secrets. IACR Cryptol. ePrint Arch. 2022: 649 (2022) - [i8]Sanjam Garg
Cryptography with Weights: MPC, Encryption and Signatures. IACR Cryptol. ePrint Arch. 2022: 1632 (2022) - 2021
- [c9]Hemanta K. Maji, Mingyuan Wang:
Computational Hardness of Optimal Fair Computation: Beyond Minicrypt. CRYPTO (2) 2021: 33-63 - [c8]Hemanta K. Maji, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang:
Constructing Locally Leakage-Resilient Linear Secret-Sharing Schemes. CRYPTO (3) 2021: 779-808 - [c7]Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang:
Leakage-Resilience of the Shamir Secret-Sharing Scheme Against Physical-Bit Leakages. EUROCRYPT (2) 2021: 344-374 - [c6]Donald Q. Adams, Hemanta K. Maji, Hai H. Nguyen, Minh L. Nguyen, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang:
Lower Bounds for Leakage-Resilient Secret-Sharing Schemes against Probing Attacks. ISIT 2021: 976-981 - [c5]Hamidreza Amini Khorasgani, Hemanta K. Maji, Himanshi K. Mehta, Mingyuan Wang:
Efficient Distributed Coin-tossing Protocols. ISIT 2021: 2852-2857 - [c4]Hamidreza Amini Khorasgani, Hemanta K. Maji, Mingyuan Wang:
Optimally-secure Coin-tossing against a Byzantine Adversary. ISIT 2021: 2858-2863 - [i7]Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang:
Leakage-resilience of the Shamir Secret-sharing Scheme against Physical-bit Leakages. IACR Cryptol. ePrint Arch. 2021: 186 (2021) - [i6]Hemanta K. Maji, Mingyuan Wang:
Computational Hardness of Optimal FairComputation: Beyond Minicrypt. IACR Cryptol. ePrint Arch. 2021: 882 (2021) - 2020
- [c3]Hemanta K. Maji, Mingyuan Wang:
Black-Box Use of One-Way Functions is Useless for Optimal Fair Coin-Tossing. CRYPTO (2) 2020: 593-617 - [i5]Hamidreza Amini Khorasgani, Hemanta K. Maji, Mingyuan Wang:
Coin Tossing with Lazy Defense: Hardness of Computation Results. IACR Cryptol. ePrint Arch. 2020: 131 (2020) - [i4]Hemanta K. Maji, Mingyuan Wang:
Black-box use of One-way Functions is Useless for Optimal Fair Coin-Tossing. IACR Cryptol. ePrint Arch. 2020: 253 (2020) - [i3]Hamidreza Amini Khorasgani, Hemanta K. Maji, Mingyuan Wang:
Design & Analysis of Optimal Coin-tossing: New Techniques. IACR Cryptol. ePrint Arch. 2020: 519 (2020) - [i2]Hemanta K. Maji, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang:
On Leakage-Resilient Secret Sharing. IACR Cryptol. ePrint Arch. 2020: 1517 (2020)
2010 – 2019
- 2019
- [c2]Divya Gupta, Hemanta K. Maji, Mingyuan Wang:
Explicit Rate-1 Non-malleable Codes for Local Tampering. CRYPTO (1) 2019: 435-466 - 2018
- [c1]Divya Gupta, Hemanta K. Maji, Mingyuan Wang:
Non-malleable Codes Against Lookahead Tampering. INDOCRYPT 2018: 307-328 - 2017
- [i1]Divya Gupta, Hemanta K. Maji, Mingyuan Wang:
Constant-rate Non-malleable Codes in the Split-state Model. IACR Cryptol. ePrint Arch. 2017: 1048 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 21:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: