On the public citation graph

The Detection of Cheaters in Thershold Schemes

0 signed · 43 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.1002/nme.1620270117openalex-snapshot
F.E. solution of a vertically averaged model for regional land subsidence
inferredcites →https://doi.org/10.1007/3-540-47721-7_19openalex-snapshot
Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret (Extended Abstract)
inferredcites →https://doi.org/10.1007/bf02252871openalex-snapshot
How to share a secret with cheaters
inferredcites →https://doi.org/10.1145/358746.358762openalex-snapshot
On sharing secrets and Reed-Solomon codes
inferredcites →https://doi.org/10.1145/359168.359176openalex-snapshot
How to share a secret

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-44750-4_33openalex-snapshot
t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/3-540-47555-9_1openalex-snapshot
Graph Decompositions and Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/3-540-48285-7_10openalex-snapshot
Size of Shares and Probability of Cheating in Threshold Schemes
inferred← citeshttps://doi.org/10.1007/3-540-48329-2_12openalex-snapshot
Secret Sharing Made Short
inferred← citeshttps://doi.org/10.1007/3-540-57843-9_11openalex-snapshot
Secret sharing schemes with veto capabilities
inferred← citeshttps://doi.org/10.1007/3-540-68339-9_18openalex-snapshot
Optimum Secret Sharing Scheme Secure against Cheating
inferred← citeshttps://doi.org/10.1007/978-3-319-09843-2_7openalex-snapshot
Cheating Detectable Secret Sharing Schemes Supporting an Arbitrary Finite Field
inferred← citeshttps://doi.org/10.1007/978-3-319-22425-1_13openalex-snapshot
Almost Optimum Secret Sharing Schemes with Cheating Detection for Random Bit Strings
inferred← citeshttps://doi.org/10.1007/978-3-540-24691-6_28openalex-snapshot
A New Algorithm for Searching a Consistent Set of Shares in a Threshold Scheme with Cheaters
inferred← citeshttps://doi.org/10.1007/978-3-642-20465-4_17openalex-snapshot
Almost Optimum t-Cheater Identifiable Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-28914-9_2openalex-snapshot
Identifying Cheaters without an Honest Majority
inferred← citeshttps://doi.org/10.1007/978-3-642-39884-1_9openalex-snapshot
Unconditionally-Secure Robust Secret Sharing with Minimum Share Size
inferred← citeshttps://doi.org/10.1007/bf00125203openalex-snapshot
An explication of secret sharing schemes
inferred← citeshttps://doi.org/10.1007/bf00204801openalex-snapshot
Graph decompositions and secret sharing schemes
inferred← citeshttps://doi.org/10.1007/bf01388382openalex-snapshot
A perfect threshold secret sharing scheme to identify cheaters
inferred← citeshttps://doi.org/10.1007/bfb0028469openalex-snapshot
Multisender authentication systems with unconditional security
inferred← citeshttps://doi.org/10.1007/s00022-003-1633-yopenalex-snapshot
Geometrical contributions to secret sharing theory
inferred← citeshttps://doi.org/10.1007/s10623-005-6342-0openalex-snapshot
Cheating in Visual Cryptography
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00130-6openalex-snapshot
Some democratic secret sharing schemes
inferred← citeshttps://doi.org/10.1016/0167-4048(94)90097-3openalex-snapshot
The breadth of Shamir's secret-sharing scheme
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00065-8openalex-snapshot
On the information rate of secret sharing schemes
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50024-9openalex-snapshot
Convexity and Discrete Optimization
inferred← citeshttps://doi.org/10.1016/j.endm.2010.05.004openalex-snapshot
Minimum Cost ≤k Edges Connected Subgraph Problems
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00149-5openalex-snapshot
Robust vector space secret sharing schemes
inferred← citeshttps://doi.org/10.1023/a:1008378426278openalex-snapshot
Detection of Cheaters in Vector Space Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1049/iet-ifs.2013.0046openalex-snapshot
Efficient multistage secret sharing scheme using bilinear map
inferred← citeshttps://doi.org/10.1109/18.841188openalex-snapshot
MDS secret-sharing scheme secure against cheaters
inferred← citeshttps://doi.org/10.1109/candar.2016.0112openalex-snapshot
Cheating Detectable Secret Sharing Scheme Suitable for Implementation
inferred← citeshttps://doi.org/10.1109/candarw.2018.00081openalex-snapshot
Verifiable Secret Sharing Scheme Using Hash Values
inferred← citeshttps://doi.org/10.1109/compsacw.2012.79openalex-snapshot
Notice of Removal: Database as a Service: Towards a Unified Solution for Security Requirements
inferred← citeshttps://doi.org/10.1109/isit.1994.395105openalex-snapshot
Subliminal-free sharing schemes
inferred← citeshttps://doi.org/10.1109/npc.2008.61openalex-snapshot
A Scheme of Detecting Cheaters Wholly in Threshold Secret Sharing for Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/tip.2006.884916openalex-snapshot
Cheating Prevention in Visual Cryptography
inferred← citeshttps://doi.org/10.1137/s0895480100378689openalex-snapshot
Optimum Secret Sharing Scheme Secure against Cheating
inferred← citeshttps://doi.org/10.1137/s0895480192224713openalex-snapshot
Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group
inferred← citeshttps://doi.org/10.1145/1315245.1315268openalex-snapshot
Robust computational secret sharing and a unified account of classical secret-sharing goals
inferred← citeshttps://doi.org/10.1587/transfun.e98.a.1814openalex-snapshot
Note on Some Recent Cheater Identifiable Secret Sharing Schemes
inferred← citeshttps://doi.org/10.28945/1223openalex-snapshot
A Novel Visual Cryptography Coding System for Jam Resistant Communications
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.