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

Lucas Piske

dblp:379/1986 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
0009-0003-1698-2176ORCID · corroborated

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

Security and privacy · 2 · 2 first-author · 2 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
2 papers
Cryptographic protocols and secure computation · 96% Privacy and data protection · 4%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
oblivious transfer
1.922026
Is PSI Really Faster Than PSU? Achieving Efficient PSU with Invertible Bloom Filters · EUROCRYPT (2) 2026
Distance-Aware OT with Application to Fuzzy PSI · CCS 2025
Cryptographic protocols and secure computation
private set intersection
1.922026
Is PSI Really Faster Than PSU? Achieving Efficient PSU with Invertible Bloom Filters · EUROCRYPT (2) 2026
Distance-Aware OT with Application to Fuzzy PSI · CCS 2025
Cryptographic protocols and secure computation › secure multiparty computation › private set operations
private set union
1.012026
Is PSI Really Faster Than PSU? Achieving Efficient PSU with Invertible Bloom Filters · EUROCRYPT (2) 2026
Cryptographic protocols and secure computation › private set intersection
fuzzy private set intersection
0.912025
Distance-Aware OT with Application to Fuzzy PSI · CCS 2025
Privacy and data protection
privacy-preserving computation
0.312025
Distance-Aware OT with Application to Fuzzy PSI · CCS 2025

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

invertible bloom filter · 1.0symmetric-key primitives · 0.9garbled circuits · 0.9function secret sharing · 0.9
YearPublicationVenuePosition
2026 Is PSI Really Faster Than PSU? Achieving Efficient PSU with Invertible Bloom Filters
Lucas Piske, Ni Trieu
EUROCRYPT (2)1
2025 Distance-Aware OT with Application to Fuzzy PSI
abstract
A two-party fuzzy private set intersection (PSI) protocol between Alice and Bob with input sets A and B allows Alice to learn nothing more than the points of Bob that are ''δ-close'' to its points in some metric space dist . More formally, Alice learns only the set {b | dist (a,b) ≤ δ, a ∈ A, b ∈ B} for a predefined threshold δ and distance metric dist, while Bob learns nothing about Alice's set. Fuzzy PSI is a valuable privacy tool in scenarios where private set intersection needs to be computed over imprecise or measurement-based data, such as GPS coordinates or healthcare data. Previous approaches to fuzzy PSI rely on asymmetric cryptographic primitives, generic two-party computation (2PC) techniques like garbled circuits, or function secret sharing methods, all of which are computationally intensive and lead to poor concrete efficiency. This work introduces a new modular framework for fuzzy PSI, primarily built on efficient symmetric key primitives. Our framework reduces the design of efficient fuzzy PSI to a novel variant of oblivious transfer (OT), which we term distance-aware random OT (da-ROT). This variant enables the sender to obtain two random strings (r0, r1), while the receiver obtains one of these values rb, depending on whether the receiver's input keyword a and the sender's input keyword b are close in some metric space i.e., dist (a,b) ≤ δ. The da-ROT can be viewed as a natural extension of traditional OT, where the condition (choice bit) is known to the receiver. We propose efficient constructions for da-ROT based on standard OT techniques tailored for small domains, supporting distance metrics such as the Chebyshev norm, the Euclidean norm, and the Manhattan norm. By integrating these da-ROT constructions, our fuzzy PSI framework achieves up to a 14× reduction in communication cost and up to a 54× reduction in computation cost compared to previous state-of-the-art protocols, across input set sizes ranging from 28 to 216. Additionally, we extend our framework to compute fuzzy PSI cardinality and fuzzy join from traditional PSI-related functionalities. All proposed protocols are secure in the semi-honest model.
Lucas Piske, Jaspal Singh, Ni Trieu, Vladimir Kolesnikov, Vassilis Zikas
CCS1