default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWei Dai 0011
Person information
- affiliation (PhD 2021): University of California, San Diego, USA
Other persons with the same name
- Wei Dai — disambiguation page
- Wei Dai 0001
![[0000-0002-4781-3485]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-4781-3485")
— Imperial College London, Department of Electrical and Electronic Engineering, UK (and 2 more) - Wei Dai 0002 — Agora.io, Inc. (and 1 more)
- Wei Dai 0003 — Petuum Inc., Pittsburgh, PA, USA (and 1 more)
- Wei Dai 0004 — China University of Mining Technology, School of Information and Electrical Engineering, Xuzhou, China (and 1 more)
- Wei Dai 0005 — Beihang University, School of Reliability and System Engineering, Beijing, China
- Wei Dai 0006 — New York University School of Medicine, NY, USA (and 1 more)
- Wei Dai 0007 — Microsoft Research, Redmond, WA, USA (and 1 more)
- Wei Dai 0008 — University of California, Santa Barbara, USA
- Wei Dai 0009 — Victoria University, Melbourne, Australia
- Wei Dai 0010 — University of California Irvine, Irvine, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[b1]Wei Dai:
On the Concrete Security of Identification and Signature Schemes. University of California, San Diego, USA, 2021- [c4]Mihir Bellare, Wei Dai:
Chain Reductions for Multi-signatures and the HBMS Scheme. ASIACRYPT (4) 2021: 650-678 - [i6]Mihir Bellare, Wei Dai:
Chain Reductions for Multi-Signatures. IACR Cryptol. ePrint Arch. 2021: 404 (2021) - 2020
- [j1]Mihir Bellare, Wei Dai, Phillip Rogaway:
Reimagining Secret Sharing: Creating a Safer and More Versatile Primitive by Adding Authenticity, Correcting Errors, and Reducing Randomness Requirements. Proc. Priv. Enhancing Technol. 2020(4): 461-490 (2020) - [c3]Mihir Bellare, Wei Dai:
The Multi-Base Discrete Logarithm Problem: Tight Reductions and Non-rewinding Proofs for Schnorr Identification and Signatures. INDOCRYPT 2020: 529-552 - [i5]Mihir Bellare, Wei Dai:
The Multi-Base Discrete Logarithm Problem: Concrete Security Improvements for Schnorr Identification, Signatures and Multi-Signatures. IACR Cryptol. ePrint Arch. 2020: 416 (2020) - [i4]Mihir Bellare, Wei Dai, Phillip Rogaway:
Reimagining Secret Sharing: Creating a Safer and More Versatile Primitive by Adding Authenticity, Correcting Errors, and Reducing Randomness Requirements. IACR Cryptol. ePrint Arch. 2020: 800 (2020)
2010 – 2019
- 2019
- [c2]Mihir Bellare, Wei Dai, Lucy Li:
The Local Forking Lemma and Its Application to Deterministic Encryption. ASIACRYPT (3) 2019: 607-636 - [i3]Mihir Bellare, Wei Dai, Lucy Li:
The Local Forking Lemma and its Application to Deterministic Encryption. IACR Cryptol. ePrint Arch. 2019: 1017 (2019) - 2018
- [i2]Mihir Bellare, Wei Dai:
Defending Against Key Exfiltration: Efficiency Improvements for Big-Key Cryptography via Large-Alphabet Subkey Prediction. IACR Cryptol. ePrint Arch. 2018: 217 (2018) - 2017
- [c1]Mihir Bellare, Wei Dai:
Defending Against Key Exfiltration: Efficiency Improvements for Big-Key Cryptography via Large-Alphabet Subkey Prediction. CCS 2017: 923-940
2000 – 2009
- 2007
- [i1]Wei Dai, Ted Krovetz:
VHASH Security. IACR Cryptol. ePrint Arch. 2007: 338 (2007)
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-12-17 21:52 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:
