default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeihan Miao 0001
Person information
- affiliation: Brown University, Providence, RI, USA
- affiliation: University of Illinois at Chicago, Chicago, IL, USA
- affiliation: Visa Research, Palo Alto, CA, USA
- affiliation: University of California, Berkeley, CA, USA
- affiliation: Shanghai Jiao Tong University, China
- unicode name: 缪沛晗
Other persons with the same name
- Peihan Miao 0002 — Zhejiang University, School of Software Technology, Ningbo, China
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Gayathri Garimella, Benjamin Goff, Peihan Miao:
Computation Efficient Structure-Aware PSI from Incremental Function Secret Sharing. CRYPTO (8) 2024: 309-345- [c16]Sanjam Garg, Mohammad Hajiabadi, Peihan Miao, Alice Murphy:
Laconic Branching Programs from the Diffie-Hellman Assumption. Public Key Cryptography (3) 2024: 323-355 - [c15]Peihan Miao, Xinyi Shi, Chao Wu, Ruofan Xu:
Client-Aided Privacy-Preserving Machine Learning. SCN (1) 2024: 207-229 - [i19]Sanjam Garg
, Mohammad Hajiabadi, Peihan Miao, Alice Murphy:
Laconic Branching Programs from the Diffie-Hellman Assumption. IACR Cryptol. ePrint Arch. 2024: 102 (2024) - [i18]Gayathri Garimella, Benjamin Goff, Peihan Miao:
Computation Efficient Structure Aware PSI From Incremental Function Secret Sharing. IACR Cryptol. ePrint Arch. 2024: 842 (2024) - [i17]Saikrishna Badrinarayanan, Eysa Lee, Peihan Miao, Peter Rindal:
Improved Multi-Party Fixed-Point Multiplication. IACR Cryptol. ePrint Arch. 2024: 1047 (2024) - [i16]Peihan Miao, Xinyi Shi, Chao Wu, Ruofan Xu:
Client-Aided Privacy-Preserving Machine Learning. IACR Cryptol. ePrint Arch. 2024: 1196 (2024) - [i15]Saikrishna Badrinarayanan, Peihan Miao, Xinyi Shi, Max Tromanhauser, Ruida Zeng:
Updatable Private Set Intersection Revisited: Extended Functionalities, Deletion, and Worst-Case Complexity. IACR Cryptol. ePrint Arch. 2024: 1446 (2024) - 2023
- [c14]Peihan Miao, Sikhar Patranabis, Gaven J. Watson:
Unidirectional Updatable Encryption and Proxy Re-encryption from DDH. Public Key Cryptography (2) 2023: 368-398 - [c13]Saikrishna Badrinarayanan, Peihan Miao, Pratyay Mukherjee, Divya Ravi:
On the Round Complexity of Fully Secure Solitary MPC with Honest Majority. TCC (2) 2023: 124-155 - 2022
- [j5]Saikrishna Badrinarayanan, Peihan Miao, Tiancheng Xie:
Updatable Private Set Intersection. Proc. Priv. Enhancing Technol. 2022(2): 378-406 (2022) - [i14]Peihan Miao, Sikhar Patranabis, Gaven J. Watson:
Unidirectional Updatable Encryption and Proxy Re-encryption from DDH or LWE. IACR Cryptol. ePrint Arch. 2022: 311 (2022) - 2021
- [c12]Saikrishna Badrinarayanan, Peihan Miao, Srinivasan Raghuraman, Peter Rindal:
Multi-party Threshold Private Set Intersection with Sublinear Communication. Public Key Cryptography (2) 2021: 349-379 - [c11]Melissa Chase, Sanjam Garg, Mohammad Hajiabadi, Jialin Li, Peihan Miao:
Amortizing Rate-1 OT and Applications to PIR and PSI. TCC (3) 2021: 126-156 - [i13]Saikrishna Badrinarayanan, Peihan Miao, Pratyay Mukherjee, Divya Ravi:
On the Round Complexity of Fully Secure Solitary MPC with Honest Majority. IACR Cryptol. ePrint Arch. 2021: 241 (2021) - [i12]Saikrishna Badrinarayanan, Peihan Miao, Tiancheng Xie:
Updatable Private Set Intersection. IACR Cryptol. ePrint Arch. 2021: 1349 (2021) - [i11]Melissa Chase, Sanjam Garg, Mohammad Hajiabadi, Jialin Li, Peihan Miao:
Amortizing Rate-1 OT and Applications to PIR and PSI. IACR Cryptol. ePrint Arch. 2021: 1525 (2021) - 2020
- [c10]Peihan Miao, Sarvar Patel, Mariana Raykova, Karn Seth, Moti Yung:
Two-Sided Malicious Security for Private Intersection-Sum with Cardinality. CRYPTO (3) 2020: 3-33 - [c9]Melissa Chase, Peihan Miao:
Private Set Intersection in the Internet Setting from Lightweight Oblivious PRF. CRYPTO (3) 2020: 34-63 - [c8]Peihan Miao:
Cut-and-Choose for Garbled RAM. CT-RSA 2020: 610-637 - [i10]Peihan Miao, Sarvar Patel, Mariana Raykova, Karn Seth, Moti Yung:
Two-Sided Malicious Security for Private Intersection-Sum with Cardinality. IACR Cryptol. ePrint Arch. 2020: 385 (2020) - [i9]Saikrishna Badrinarayanan, Peihan Miao, Peter Rindal:
Multi-Party Threshold Private Set Intersection with Sublinear Communication. IACR Cryptol. ePrint Arch. 2020: 600 (2020) - [i8]Melissa Chase, Peihan Miao:
Private Set Intersection in the Internet Setting From Lightweight Oblivious PRF. IACR Cryptol. ePrint Arch. 2020: 729 (2020)
2010 – 2019
- 2019
- [b1]Peihan Miao:
Towards Secure Computation with Optimal Complexity. University of California, Berkeley, USA, 2019 - [j4]Ning Chen, Martin Hoefer, Marvin Künnemann, Chengyu Lin, Peihan Miao:
Secretary markets with local information. Distributed Comput. 32(5): 361-378 (2019) - 2018
- [c7]Shashank Agrawal, Peihan Miao, Payman Mohassel, Pratyay Mukherjee:
PASTA: PASsword-based Threshold Authentication. CCS 2018: 2042-2059 - [c6]Sanjam Garg, Peihan Miao, Akshayaram Srinivasan:
Two-Round Multiparty Secure Computation Minimizing Public Key Operations. CRYPTO (3) 2018: 273-301 - [c5]Nico Döttling, Sanjam Garg, Divya Gupta, Peihan Miao, Pratyay Mukherjee:
Obfuscation from Low Noise Multilinear Maps. INDOCRYPT 2018: 329-352 - [i7]Sanjam Garg, Peihan Miao, Akshayaram Srinivasan:
Two-Round Multiparty Secure Computation Minimizing Public Key Operations. IACR Cryptol. ePrint Arch. 2018: 180 (2018) - [i6]Shashank Agrawal, Peihan Miao, Payman Mohassel, Pratyay Mukherjee:
PASTA: PASsword-based Threshold Authentication. IACR Cryptol. ePrint Arch. 2018: 885 (2018) - 2017
- [c4]Chongwon Cho, Nico Döttling, Sanjam Garg, Divya Gupta, Peihan Miao, Antigoni Polychroniadou:
Laconic Oblivious Transfer and Its Applications. CRYPTO (2) 2017: 33-65 - [c3]Alessandro Chiesa, Matthew Green, Jingcheng Liu, Peihan Miao, Ian Miers, Pratyush Mishra:
Decentralized Anonymous Micropayments. EUROCRYPT (2) 2017: 609-642 - [i5]Chongwon Cho, Nico Döttling, Sanjam Garg, Divya Gupta, Peihan Miao, Antigoni Polychroniadou:
Laconic Oblivious Transfer and its Applications. IACR Cryptol. ePrint Arch. 2017: 491 (2017) - 2016
- [j3]Xiaomin Chen, Peihan Miao:
Nordhaus-Gaddum-type problems for lines in hypergraphs. Discret. Appl. Math. 198: 297-302 (2016) - [c2]Sanjam Garg, Divya Gupta, Peihan Miao, Omkant Pandey:
Secure Multiparty RAM Computation in Constant Rounds. TCC (B1) 2016: 491-520 - [i4]Nico Döttling, Sanjam Garg, Divya Gupta, Peihan Miao, Pratyay Mukherjee:
Obfuscation from Low Noise Multilinear Maps. IACR Cryptol. ePrint Arch. 2016: 599 (2016) - [i3]Sanjam Garg, Divya Gupta, Peihan Miao, Omkant Pandey:
Secure Multiparty RAM Computation in Constant Rounds. IACR Cryptol. ePrint Arch. 2016: 815 (2016) - [i2]Peihan Miao:
Cut-and-Choose for Garbled RAM. IACR Cryptol. ePrint Arch. 2016: 907 (2016) - [i1]Alessandro Chiesa, Matthew Green, Jingcheng Liu, Peihan Miao, Ian Miers, Pratyush Mishra:
Decentralized Anonymous Micropayments. IACR Cryptol. ePrint Arch. 2016: 1033 (2016) - 2015
- [j2]Xiaomin Chen, Guangda Huzhang, Peihan Miao, Kuan Yang:
Graph metric with no proper inclusion between lines. Discret. Appl. Math. 185: 59-70 (2015) - [c1]Ning Chen, Martin Hoefer, Marvin Künnemann, Chengyu Lin, Peihan Miao:
Secretary Markets with Local Information. ICALP (2) 2015: 552-563 - 2014
- [j1]Pierre Aboulker, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Vasek Chvátal, Peihan Miao:
Number of lines in hypergraphs. Discret. Appl. Math. 171: 137-140 (2014)
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-08 20:29 CEST 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:
