On the public citation graph
A New Quantum Private Protocol for Set Intersection Cardinality Based on a Quantum Homomorphic Encryption Scheme for Toffoli Gate
0 signed · 36 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/sec.988openalex-snapshot
Private set intersection via public key encryption with keywords search
inferredcites →https://doi.org/10.1007/978-3-319-23318-5_12openalex-snapshot
Secure and Efficient Private Set Intersection Cardinality Using Bloom Filter
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-642-20465-4_24openalex-snapshot
Towards a Game Theoretic View of Secure Computation
inferredcites →https://doi.org/10.1007/s00145-011-9098-xopenalex-snapshot
Efficient Set Operations in the Presence of Malicious Adversaries
inferredcites →https://doi.org/10.1007/s00145-017-9263-yopenalex-snapshot
Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
inferredcites →https://doi.org/10.1007/s11128-015-1165-zopenalex-snapshot
An efficient quantum scheme for Private Set Intersection
inferredcites →https://doi.org/10.1007/s11128-018-1968-9openalex-snapshot
Quantum secure two-party computation for set intersection with rational players
inferredcites →https://doi.org/10.1007/s11227-012-0829-zopenalex-snapshot
Privacy-aware searching with oblivious term matching for cloud storage
inferredcites →https://doi.org/10.1007/s11433-022-1921-yopenalex-snapshot
Novel quantum circuit implementation of Advanced Encryption Standard with low costs
inferredcites →https://doi.org/10.1016/j.ins.2011.07.003openalex-snapshot
Privacy-preserving disjunctive normal form operations on distributed sets
inferredcites →https://doi.org/10.1016/j.ins.2014.01.016openalex-snapshot
A communication-efficient private matching scheme in Client–Server model
inferredcites →https://doi.org/10.1016/j.ins.2016.07.071openalex-snapshot
Quantum private set intersection cardinality and its application to anonymous authentication
inferredcites →https://doi.org/10.1038/srep15914openalex-snapshot
Two Quantum Protocols for Oblivious Set-member Decision Problem
inferredcites →https://doi.org/10.1103/physreva.92.022309openalex-snapshot
Quantum oblivious set-member decision protocol
inferredcites →https://doi.org/10.1109/access.2018.2872741openalex-snapshot
Efficient Quantum Protocol for Private Set Intersection Cardinality
inferredcites →https://doi.org/10.1109/tsc.2016.2514338openalex-snapshot
Privacy-Preserving Location Sharing Services for Social Networks
inferredcites →https://doi.org/10.1137/s0036144598347011openalex-snapshot
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
inferredcites →https://doi.org/10.1140/epjd/e2018-90380-7openalex-snapshot
Quantum private computation of cardinality of set intersection and union
inferredcites →https://doi.org/10.1145/1374376.1374436openalex-snapshot
Complete fairness in secure two-party computation
inferredcites →https://doi.org/10.1145/237814.237866openalex-snapshot
A fast quantum mechanical algorithm for database search
inferredcites →https://doi.org/10.26421/qic7.4-4openalex-snapshot
A simple participant attack on the Bradler-Dusek protocol
inferredcites →https://doi.org/10.3233/jcs-2005-13401openalex-snapshot
Secure set intersection cardinality with application to association rule mining
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.70126openalex-snapshot
Verifiable Cloud‐Assisted Multi‐Party Private Set Intersection Cardinality
inferred← citeshttps://doi.org/10.1002/qute.202400137openalex-snapshot
A New Protocol for Semi‐quantum Private Set of Intersection and Union Mixed Cardinality for Any Tripartite Based on Bell States
inferred← citeshttps://doi.org/10.1007/s10773-024-05672-1openalex-snapshot
A Secure Quantum Private Set Computation Protocol with Identity Authentication Utilizing GHZ States
inferred← citeshttps://doi.org/10.1007/s10773-024-05676-xopenalex-snapshot
Quantum Secure Clockwise Sorting
inferred← citeshttps://doi.org/10.1007/s10773-024-05773-xopenalex-snapshot
Secure Multiparty Logical AND Based on Quantum Homomorphic Encryption and Its Applications
inferred← citeshttps://doi.org/10.1007/s11128-024-04528-1openalex-snapshot
Secure multiparty quantum computation for summation and data sorting
inferred← citeshttps://doi.org/10.1016/j.cjph.2025.09.014openalex-snapshot
Quantum scheme for private set intersection and union cardinality based on quantum homomorphic encryption
inferred← citeshttps://doi.org/10.1016/j.dcan.2025.05.010openalex-snapshot
Privacy-preserving computation meets quantum computing: A scoping review
inferred← citeshttps://doi.org/10.1016/j.physa.2024.129529openalex-snapshot
Quantum one-time pad-based quantum homomorphic encryption schemes for circuits of the non-Clifford gates
inferred← citeshttps://doi.org/10.1088/1402-4896/ad6aeeopenalex-snapshot
A novel quantum security multi-party extremum protocol in a d-dimensional quantum system
inferred← citeshttps://doi.org/10.1140/epjqt/s40507-024-00268-4openalex-snapshot
Efficient quantum secure multi-party greatest common divisor protocol and its applications in private set operations
inferred← citeshttps://doi.org/10.1142/s0217732324501839openalex-snapshot
Quantum private set intersection with correlated sum using single photons
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.