On the public citation graph
Efficient Polynomial Operations in the Shared-Coefficients Setting
0 signed · 40 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.1007/11535218openalex-snapshot
Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings
inferredcites →https://doi.org/10.1007/11535218_15openalex-snapshot
Privacy-Preserving Set Operations
inferredcites →https://doi.org/10.1007/3-540-44647-8_4openalex-snapshot
Self Protecting Pirates and Black-Box Traitor Tracing
inferredcites →https://doi.org/10.1007/3-540-44647-8_7openalex-snapshot
Secure Distributed Linear Algebra in a Constant Number of Rounds
inferredcites →https://doi.org/10.1007/3-540-44987-6_18openalex-snapshot
Multiparty Computation from Threshold Homomorphic Encryption
inferredcites →https://doi.org/10.1007/3-540-45682-1_21openalex-snapshot
Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks
inferredcites →https://doi.org/10.1007/3-540-48910-x_16openalex-snapshot
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
inferredcites →https://doi.org/10.1007/978-3-031-07085-3openalex-snapshot
Advances in Cryptology – EUROCRYPT 2022
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.1109/istcs.1997.595170openalex-snapshot
Private simultaneous messages protocols with applications
inferredcites →https://doi.org/10.1109/sfcs.1982.38openalex-snapshot
Protocols for secure computations
inferredcites →https://doi.org/10.1109/sfcs.1982.88openalex-snapshot
Protocols for secure computations
inferredcites →https://doi.org/10.1109/sfcs.1986.25openalex-snapshot
How to generate and exchange secrets
inferredcites →https://doi.org/10.1109/sfcs.2000.892118openalex-snapshot
Randomizing polynomials: A new representation with applications to round-efficient secure computation
inferredcites →https://doi.org/10.1145/100216.100287openalex-snapshot
The round complexity of secure protocols
inferredcites →https://doi.org/10.1145/195058.195408openalex-snapshot
A minimal model for secure computation (extended abstract)
inferredcites →https://doi.org/10.1145/277697.277716openalex-snapshot
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
inferredcites →https://doi.org/10.1145/62212.62213openalex-snapshot
Completeness theorems for non-cryptographic fault-tolerant distributed computation
inferredcites →https://doi.org/10.1145/62212.62214openalex-snapshot
Multiparty unconditionally secure protocols
inferredcites →https://doi.org/10.1145/72981.72995openalex-snapshot
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
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-540-70500-0_12openalex-snapshot
Efficient Disjointness Tests for Private Datasets
inferred← citeshttps://doi.org/10.1007/978-3-540-85174-5_27openalex-snapshot
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
inferred← citeshttps://doi.org/10.1007/978-3-642-25513-7_17openalex-snapshot
Fast Computation on Encrypted Polynomials and Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-54970-4_12openalex-snapshot
Fast Optimistically Fair Cut-and-Choose 2PC
inferred← citeshttps://doi.org/10.1007/s10623-023-01309-2openalex-snapshot
Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext
inferred← citeshttps://doi.org/10.1007/s10623-025-01795-6openalex-snapshot
Threshold Niederreiter: chosen-ciphertext security and improved distributed decoding
inferred← citeshttps://doi.org/10.1109/ares.2008.134openalex-snapshot
Privacy-Preserving Distributed Set Intersection
inferred← citeshttps://doi.org/10.1109/dsc63484.2024.00084openalex-snapshot
Secure Two-party Newton Interpolation
inferred← citeshttps://doi.org/10.1109/sp.2015.31openalex-snapshot
Malicious-Client Security in Blind Seer: A Scalable Private DBMS
inferred← citeshttps://doi.org/10.1145/1609956.1609965openalex-snapshot
Efficient and secure protocols for privacy-preserving set operations
inferred← citeshttps://doi.org/10.1145/2732516.2732524openalex-snapshot
Entangled Encodings and Data Entanglement
inferred← citeshttps://doi.org/10.1504/ijact.2009.023471openalex-snapshot
Unconditionally secure disjointness tests for private datasets
inferred← citeshttps://doi.org/10.2478/popets-2022-0020openalex-snapshot
Polymath: Low-Latency MPC via Secure Polynomial Evaluations and Its Applications
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.