Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sihang Pu

dblp:195/8301 · DBLP profile ↗
← Back
11ranked-venue papers
3as first author
8since 2021 · last 2026
0009-0003-2056-6079ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 11 · 3 first-author · 8 since 2021Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
7 papers
Cryptographic protocols and secure computation · 64% Cryptographic primitives and cryptanalysis · 34% Blockchain and cryptocurrency security · 2%
Theoretical computer science
1 paper
Quantum computing and quantum information · 100%

Topics — the 13 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › private set intersection
fuzzy private set intersection
1.622025
Fuzzy Private Set Intersection from VOLE · ASIACRYPT (5) 2025
Fuzzy Private Set Intersection with Large Hyperballs · EUROCRYPT (5) 2024
Cryptographic protocols and secure computation
private set intersection
1.622025
Fuzzy Private Set Intersection from VOLE · ASIACRYPT (5) 2025
Fuzzy Private Set Intersection with Large Hyperballs · EUROCRYPT (5) 2024
Cryptographic protocols and secure computation
malicious security
1.012026
Malicious Private Set Union with Two-Sided Output · EUROCRYPT (2) 2026
Cryptographic protocols and secure computation › secure multiparty computation › private set operations
private set union
1.012026
Malicious Private Set Union with Two-Sided Output · EUROCRYPT (2) 2026
Cryptographic protocols and secure computation
secure multiparty computation
1.012026
Malicious Private Set Union with Two-Sided Output · EUROCRYPT (2) 2026
Cryptographic primitives and cryptanalysis › hash functions
chameleon hash
0.912025
Enhanced Trapdoor Hashing from DDH and DCR · EUROCRYPT (6) 2025
Cryptographic primitives and cryptanalysis
cryptographic assumptions
0.912025
Enhanced Trapdoor Hashing from DDH and DCR · EUROCRYPT (6) 2025
Cryptographic primitives and cryptanalysis
hash functions
0.912025
Enhanced Trapdoor Hashing from DDH and DCR · EUROCRYPT (6) 2025
Cryptographic primitives and cryptanalysis
post-quantum cryptography
0.712023
Post Quantum Fuzzy Stealth Signatures and Applications · CCS 2023
Cryptographic protocols and secure computation
oblivious transfer
0.612022
Batch-OT with Optimal Rate · EUROCRYPT (2) 2022
Cryptographic primitives and cryptanalysis
quantum cryptography
0.412020
A Combinatorial Approach to Quantum Random Functions · ASIACRYPT (2) 2020
Cryptographic protocols and secure computation
oblivious pseudorandom function
0.312025
Fuzzy Private Set Intersection from VOLE · ASIACRYPT (5) 2025
Quantum computing and quantum information
quantum pseudorandomness
0.112020
A Combinatorial Approach to Quantum Random Functions · ASIACRYPT (2) 2020

Methods — techniques the papers use, named apart from their topics

secure computation protocols · 1.0vector oblivious linear evaluation · 0.9oblivious pseudorandom function · 0.9quantum oracle separation · 0.9combinatorial construction · 0.9post-quantum cryptography · 0.7
YearPublicationVenuePosition
2026 Malicious Private Set Union with Two-Sided Output
Sihang Pu, Jiahui Gao 0001, Ni Trieu
EUROCRYPT (2)1
2025 Fuzzy Private Set Intersection from VOLE
abstract
Private set intersection (PSI) is a well-researched cryptographic primitive that allows two parties to compute the intersection of their input sets without revealing any information about items outside of the intersection. Fuzzy private set intersection is a relatively new variant of PSI, where items are not matched exactly but “fuzzily”. Most commonly, items are points $$\textbf{q},\textbf{w}$$ in d-dimensional integer space $$\mathbb {Z}^d$$ and a point is a fuzzy match to another if it lies within a ball of radius $$\delta $$ centered at this point, with respect to some distance metric. Previous works either only support infinity $$(L_{\infty }$$ ) distance metric and standard PSI functionality, or support general Minkowski ( $$L_{\textsf{p}}$$ , $$\textsf{p}\in [1,\infty ]$$ ) distance metrics and realize richer functionalities but rely on expensive homomorphic encryptions. Our work aims to bridge this gap by giving the first construction of a fuzzy PSI protocol for general Minkowski distance metrics relying on significantly cheaper operations during the online phase. Our main building block is a novel fuzzy matching protocol based on an oblivious pseudorandom function (OPRF), which can be realized very efficiently from vector oblivious linear evaluation (VOLE). Our protocol is able to preserve the asymptotic complexity as well as the simplicity of the fuzzy matching protocol from van Baarsen and Pu (Eurocrypt ’24), while being much more concretely efficient. Additionally, we achieve several asymptotic improvements by representing intervals succinctly. Finally, we present the first fuzzy PSI protocol for infinity distance that places no assumptions on the sets of points, while maintaining asymptotic complexities comparable to the state-of-the-art fuzzy PSI protocol.
Aron van Baarsen, Sihang Pu
ASIACRYPT (5)2
2025 Enhanced Trapdoor Hashing from DDH and DCR
Geoffroy Couteau, Aditya Hegde 0003, Sihang Pu
EUROCRYPT (6)3
2024 Practical Lattice-Based Distributed Signatures for a Small Number of Signers
Nabil Alkeilani Alkadri, Nico Döttling, Sihang Pu
ACNS (1)3
2024 Fuzzy Private Set Intersection with Large Hyperballs
Aron van Baarsen, Sihang Pu
EUROCRYPT (5)2
2023 Post Quantum Fuzzy Stealth Signatures and Applications
abstract
Private payments in blockchain-based cryptocurrencies have been a topic of research, both academic and industrial, ever since the advent of Bitcoin. Stealth address payments were proposed as a solution to improve payment privacy for users and are, in fact, deployed in several major cryptocurrencies today. The mechanism lets users receive payments so that none of these payments are linkable to each other or the recipient. Currently known stealth address mechanisms either (1) are insecure in certain reasonable adversarial models, (2) are inefficient in practice or (3) are incompatible with many existing currencies.
Sihang Pu, Sri Aravinda Krishnan Thyagarajan, Nico Döttling, Lucjan Hanzlik
CCS1
2022 Batch-OT with Optimal Rate
Zvika Brakerski, Pedro Branco 0005, Nico Döttling, Sihang Pu
EUROCRYPT (2)4
2021 Laconic Private Set Intersection and Applications
Navid Alamati, Pedro Branco 0005, Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Sihang Pu
TCC (3)6
2020 A Combinatorial Approach to Quantum Random Functions
Nico Döttling, Giulio Malavolta, Sihang Pu
ASIACRYPT (2)3
2017 Trace Augmentation: What Can Be Done Even Before Preprocessing in a Profiled SCA?
Sihang Pu, Yu Yu 0001, Weijia Wang 0003, Zheng Guo 0001, Dawu Gu
CARDIS1
2016 Inner Product Masking for Bitslice Ciphers and Security Order Amplification for Linear Leakages
Weijia Wang 0003, François-Xavier Standaert, Yu Yu 0001, Sihang Pu, Zheng Guo 0001, Dawu Gu
CARDIS4