On the public citation graph

Towards fair mutual private set intersection with linear complexity

https://doi.org/10.1002/sec.1450
0 signed · 45 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11535218_15openalex-snapshot
Privacy-Preserving Set Operations
inferredcites →https://doi.org/10.1007/3-540-36178-2_2openalex-snapshot
A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order
inferredcites →https://doi.org/10.1007/3-540-44586-2_9openalex-snapshot
A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System
inferredcites →https://doi.org/10.1007/3-540-45539-6openalex-snapshot
Advances in Cryptology — EUROCRYPT 2000
inferredcites →https://doi.org/10.1007/3-540-48071-4openalex-snapshot
Advances in Cryptology — CRYPTO’ 92
inferredcites →https://doi.org/10.1007/3-540-48071-4_28openalex-snapshot
On Defining Proofs of Knowledge
inferredcites →https://doi.org/10.1007/3-540-48184-2openalex-snapshot
Advances in cryptology -- CRYPTO '87 : proceedings
inferredcites →https://doi.org/10.1007/978-3-319-63715-0openalex-snapshot
Advances in Cryptology – CRYPTO 2017
inferredcites →https://doi.org/10.1007/978-3-540-24676-3_1openalex-snapshot
Efficient Private Matching and Set Intersection
inferredcites →https://doi.org/10.1007/978-3-540-30576-7_17openalex-snapshot
Keyword Search and Oblivious Pseudorandom Functions
inferredcites →https://doi.org/10.1007/978-3-540-45146-4_8openalex-snapshot
Practical Verifiable Encryption and Decryption of Discrete Logarithms
inferredcites →https://doi.org/10.1007/978-3-540-78524-8_10openalex-snapshot
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
inferredcites →https://doi.org/10.1007/978-3-642-00457-5_34openalex-snapshot
Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
inferredcites →https://doi.org/10.1007/978-3-642-03549-4_7openalex-snapshot
Private Intersection of Certified Sets
inferredcites →https://doi.org/10.1007/978-3-642-13013-7_19openalex-snapshot
Efficient Set Operations in the Presence of Malicious Adversaries
inferredcites →https://doi.org/10.1007/978-3-642-14577-3_13openalex-snapshot
Practical Private Set Intersection Protocols with Linear Complexity
inferredcites →https://doi.org/10.1007/978-3-642-15317-4_25openalex-snapshot
Group Message Authentication
inferredcites →https://doi.org/10.1007/978-3-642-15317-4_26openalex-snapshot
Fast Secure Computation of Set Intersection
inferredcites →https://doi.org/10.1007/978-3-642-17373-8_13openalex-snapshot
Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
inferredcites →https://doi.org/10.1007/978-3-642-27890-7_18openalex-snapshot
Mutual Private Set Intersection with Linear Complexity
inferredcites →https://doi.org/10.1007/978-3-642-30921-2_4openalex-snapshot
Experimenting with Fast Private Set Intersection
inferredcites →https://doi.org/10.1007/978-3-642-39256-6_9openalex-snapshot
Fair Private Set Intersection with a Semi-trusted Arbiter
inferredcites →https://doi.org/10.1007/978-3-662-46497-7_4openalex-snapshot
Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
inferredcites →https://doi.org/10.1007/bfb0052252openalex-snapshot
Efficient group signature schemes for large groups
inferredcites →https://doi.org/10.1007/bfb0054851openalex-snapshot
The Decision Diffie-Hellman problem
inferredcites →https://doi.org/10.1007/bfb0055717openalex-snapshot
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
inferredcites →https://doi.org/10.1007/s001459910006openalex-snapshot
Security and Composition of Multiparty Cryptographic Protocols
inferredcites →https://doi.org/10.1017/cbo9780511721656openalex-snapshot
Foundations of Cryptography
inferredcites →https://doi.org/10.1145/168588.168596openalex-snapshot
Random oracles are practical
inferredcites →https://doi.org/10.1145/2508859.2516701openalex-snapshot
When private set intersection meets big data
inferredcites →https://doi.org/10.1145/362686.362692openalex-snapshot
Space/time trade-offs in hash coding with allowable errors
inferredcites →https://doi.org/10.1145/6490.6503openalex-snapshot
How to construct random functions
inferredcites →https://doi.org/10.3929/ethz-a-006651937openalex-snapshot
Proof systems for general statements about discrete logarithms

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-54776-8_4openalex-snapshot
Fair Private Set Intersection Using Smart Contracts
inferred← citeshttps://doi.org/10.1007/978-3-319-53177-9_14openalex-snapshot
New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness
inferred← citeshttps://doi.org/10.1007/978-3-319-54705-3_31openalex-snapshot
Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter
inferred← citeshttps://doi.org/10.1007/978-3-662-58387-6_11openalex-snapshot
Faster Unbalanced Private Set Intersection
inferred← citeshttps://doi.org/10.1007/s11432-022-3717-9openalex-snapshot
Unbalanced private set intersection with linear communication complexity
inferred← citeshttps://doi.org/10.1109/icicc63565.2024.10780695openalex-snapshot
An Efficient Multi-Party Private Set Intersection Protocol
inferred← citeshttps://doi.org/10.1109/ipccc66453.2025.11304678openalex-snapshot
Adaptive Hash Ring-Based Efficient Fuzzy and Over-Threshold Multi-Party PSI
inferred← citeshttps://doi.org/10.1145/3338466.3358927openalex-snapshot
Efficient Multi-Party Private Set Intersection Against Malicious Adversaries
inferred← citeshttps://doi.org/10.1145/3576915.3623158openalex-snapshot
Efficient Multiparty Probabilistic Threshold Private Set Intersection
inferred← citeshttps://doi.org/10.1155/2021/3159269openalex-snapshot
Outsourced Mutual Private Set Intersection Protocol for Edge-Assisted IoT
inferred← citeshttps://doi.org/10.22531/muglajsci.1387499openalex-snapshot
NEW THRESHOLD PRIVATE SET INTERSECTION PROTOCOLS
inferred← citeshttps://doi.org/10.3934/amc.2020071openalex-snapshot
Secure and efficient multiparty private set intersection cardinality
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.