Peihan Miao

Affiliations:
  • Brown University, Providence, RI, USA
  • University of Illinois at Chicago, Chicago, IL, USA
  • Visa Research, Palo Alto, CA, USA
  • University of California, Berkeley, CA, USA
  • Shanghai Jiao Tong University, China


According to our database1, Peihan Miao authored at least 26 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Client-Aided Privacy-Preserving Machine Learning.
IACR Cryptol. ePrint Arch., 2024

Computation Efficient Structure Aware PSI From Incremental Function Secret Sharing.
IACR Cryptol. ePrint Arch., 2024

Laconic Branching Programs from the Diffie-Hellman Assumption.
IACR Cryptol. ePrint Arch., 2024

Updatable Private Set Intersection Revisited: Extended Functionalities, Deletion, and Worst-Case Complexity.
IACR Cryptol. ePrint Arch., 2024

Improved Multi-Party Fixed-Point Multiplication.
IACR Cryptol. ePrint Arch., 2024

2023
Unidirectional Updatable Encryption and Proxy Re-encryption from DDH.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

2022
Updatable Private Set Intersection.
Proc. Priv. Enhancing Technol., 2022

Unidirectional Updatable Encryption and Proxy Re-encryption from DDH or LWE.
IACR Cryptol. ePrint Arch., 2022

2021
Amortizing Rate-1 OT and Applications to PIR and PSI.
IACR Cryptol. ePrint Arch., 2021

On the Round Complexity of Fully Secure Solitary MPC with Honest Majority.
IACR Cryptol. ePrint Arch., 2021

Multi-party Threshold Private Set Intersection with Sublinear Communication.
Proceedings of the Public-Key Cryptography - PKC 2021, 2021

2020
Two-Sided Malicious Security for Private Intersection-Sum with Cardinality.
IACR Cryptol. ePrint Arch., 2020

Private Set Intersection in the Internet Setting From Lightweight Oblivious PRF.
IACR Cryptol. ePrint Arch., 2020

Multi-Party Threshold Private Set Intersection with Sublinear Communication.
IACR Cryptol. ePrint Arch., 2020

2019
Towards Secure Computation with Optimal Complexity.
PhD thesis, 2019

Secretary markets with local information.
Distributed Comput., 2019

2018
Two-Round Multiparty Secure Computation Minimizing Public Key Operations.
IACR Cryptol. ePrint Arch., 2018

PASTA: PASsword-based Threshold Authentication.
IACR Cryptol. ePrint Arch., 2018

2017
Laconic Oblivious Transfer and its Applications.
IACR Cryptol. ePrint Arch., 2017

2016
Cut-and-Choose for Garbled RAM.
IACR Cryptol. ePrint Arch., 2016

Secure Multiparty RAM Computation in Constant Rounds.
IACR Cryptol. ePrint Arch., 2016

Obfuscation from Low Noise Multilinear Maps.
IACR Cryptol. ePrint Arch., 2016

Decentralized Anonymous Micropayments.
IACR Cryptol. ePrint Arch., 2016

Nordhaus-Gaddum-type problems for lines in hypergraphs.
Discret. Appl. Math., 2016

2015
Graph metric with no proper inclusion between lines.
Discret. Appl. Math., 2015

2014
Number of lines in hypergraphs.
Discret. Appl. Math., 2014


  Loading...