Element distinctness and bounded input size in private set intersection and related protocols

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Efficient set intersection with simulation-based security
Efficient circuit-based PSI via cuckoo hashing
Nothing refreshes like a RePSI: reactive private set intersection
Secure and efficient private set intersection cardinality using Bloom filter
VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
Two-sided malicious security for private intersection-sum with cardinality
Private set intersection in the internet setting from lightweight oblivious PRF
PSI from PaXoS: fast, malicious private set intersection
Efficient circuit-based PSI with linear communication
An algebraic approach to maliciously secure private set intersection
SpOT-light: lightweight private set intersection from sparse OT extension
An efficient protocol for secure two-party computation in the presence of malicious adversaries
SWiM: secure wildcard pattern matching from OT extension
\textsf{Catalic}: delegated PSI cardinality with applications to contact tracing
Bounded Size-Hiding Private Set Intersection
Policy-Enhanced Private Set Intersection: Sharing Information While Enforcing Privacy Policies
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
(If) Size Matters: Size-Hiding Private Set Intersection
Efficient Set Operations in the Presence of Malicious Adversaries
Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security
A public key cryptosystem and a signature scheme based on discrete logarithms
On the power of commutativity in cryptography
A method for obtaining digital signatures and public-key cryptosystems
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
The knowledge complexity of interactive proof-systems
Foundations of Cryptography
Advances in Cryptology - EUROCRYPT 2004
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
Privacy-Preserving Set Operations
Theory of Cryptography
Multi-bit Cryptosystems Based on Lattice Problems

This page was built for publication: Element distinctness and bounded input size in private set intersection and related protocols