default search action
Mingxun Zhou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c8]Ashrujit Ghoshal, Mingxun Zhou, Elaine Shi:
Efficient Pre-processing PIR Without Public-Key Cryptography. EUROCRYPT (6) 2024: 210-240 - [c7]Mingxun Zhou, Mengshi Zhao, T.-H. Hubert Chan, Elaine Shi:
Advanced Composition Theorems for Differential Obliviousness. ITCS 2024: 103:1-103:24 - [c6]Mingxun Zhou, Andrew Park, Wenting Zheng, Elaine Shi:
Piano: Extremely Simple, Single-Server PIR with Sublinear Server Computation. SP 2024: 4296-4314 - 2023
- [c5]Mingxun Zhou, Elaine Shi, T.-H. Hubert Chan, Shir Maimon:
A Theory of Composition for Differential Obliviousness. EUROCRYPT (3) 2023: 3-34 - [c4]Mingxun Zhou, Wei-Kai Lin, Yiannis Tselekounis, Elaine Shi:
Optimal Single-Server Private Information Retrieval. EUROCRYPT (1) 2023: 395-425 - [c3]Mingxun Zhou, Liyi Zeng, Yilin Han, Peilun Li, Fan Long, Dong Zhou, Ivan Beschastnikh, Ming Wu:
Mercury: Fast Transaction Broadcast in High Performance Blockchain Systems. INFOCOM 2023: 1-10 - [i9]Mingxun Zhou, Andrew Park, Elaine Shi, Wenting Zheng:
Piano: Extremely Simple, Single-Server PIR with Sublinear Server Computation. IACR Cryptol. ePrint Arch. 2023: 452 (2023) - [i8]Mingxun Zhou, Mengshi Zhao, T.-H. Hubert Chan, Elaine Shi:
Advanced Composition Theorems for Differential Obliviousness. IACR Cryptol. ePrint Arch. 2023: 842 (2023) - [i7]Ashrujit Ghoshal, Mingxun Zhou, Elaine Shi:
Efficient Pre-processing PIR Without Public-Key Cryptography. IACR Cryptol. ePrint Arch. 2023: 1574 (2023) - [i6]Mingxun Zhou, Elaine Shi, Giulia Fanti:
Proof of Compliance for Anonymous, Unlinkable Messages. IACR Cryptol. ePrint Arch. 2023: 1900 (2023) - 2022
- [c2]Mingxun Zhou, Tianhao Wang, T.-H. Hubert Chan, Giulia Fanti, Elaine Shi:
Locally Differentially Private Sparse Vector Aggregation. SP 2022: 422-439 - [i5]Mingxun Zhou, Elaine Shi:
The Power of the Differentially Oblivious Shuffle in Distributed Privacy Mechanisms. IACR Cryptol. ePrint Arch. 2022: 177 (2022) - [i4]Mingxun Zhou, Wei-Kai Lin, Yiannis Tselekounis, Elaine Shi:
Optimal Single-Server Private Information Retrieval. IACR Cryptol. ePrint Arch. 2022: 609 (2022) - [i3]Mingxun Zhou, Elaine Shi, T.-H. Hubert Chan, Shir Maimon:
A Theory of Composition for Differential Obliviousness. IACR Cryptol. ePrint Arch. 2022: 1357 (2022) - 2021
- [c1]Charlie Hou, Mingxun Zhou, Yan Ji, Phil Daian, Florian Tramèr, Giulia Fanti, Ari Juels:
SquirRL: Automating Attack Analysis on Blockchain Incentive Mechanisms with Deep Reinforcement Learning. NDSS 2021 - [i2]Mingxun Zhou, Tianhao Wang, T.-H. Hubert Chan, Giulia Fanti, Elaine Shi:
Locally Differentially Private Sparse Vector Aggregation. CoRR abs/2112.03449 (2021)
2010 – 2019
- 2019
- [j1]Minmei Wang, Mingxun Zhou, Shouqian Shi, Chen Qian:
Vacuum Filters: More Space-Efficient and Faster Replacement for Bloom and Cuckoo Filters. Proc. VLDB Endow. 13(2): 197-210 (2019) - [i1]Charlie Hou, Mingxun Zhou, Yan Ji, Phil Daian, Florian Tramèr, Giulia Fanti, Ari Juels:
SquirRL: Automating Attack Discovery on Blockchain Incentive Mechanisms with Deep Reinforcement Learning. CoRR abs/1912.01798 (2019)
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-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint