On the public citation graph

Secret Sharing Schemes on Sparse Homogeneous Access Structures with Rank Three

https://doi.org/10.37236/1825
0 signed · 34 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/3-540-36413-7_26openalex-snapshot
Secret Sharing Schemes on Access Structures with Intersection Number Equal to One
inferredcites →https://doi.org/10.1007/3-540-38424-3_17openalex-snapshot
Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes
inferredcites →https://doi.org/10.1007/3-540-46885-4_45openalex-snapshot
Some Ideal Secret Sharing Schemes
inferredcites →https://doi.org/10.1007/3-540-47555-9_1openalex-snapshot
Graph Decompositions and Secret Sharing Schemes
inferredcites →https://doi.org/10.1007/3-540-48071-4_11openalex-snapshot
On the Information Rate of Secret Sharing Schemes
inferredcites →https://doi.org/10.1007/bf00125203openalex-snapshot
An explication of secret sharing schemes
inferredcites →https://doi.org/10.1007/bf00129769openalex-snapshot
Perfect Secret Sharing Schemes on Five Participants
inferredcites →https://doi.org/10.1007/bf00196772openalex-snapshot
On the classification of ideal secret sharing schemes
inferredcites →https://doi.org/10.1007/bf00198463openalex-snapshot
On the size of shares for secret sharing schemes
inferredcites →https://doi.org/10.1007/bf00204801openalex-snapshot
Graph decompositions and secret sharing schemes
inferredcites →https://doi.org/10.1007/bf02451112openalex-snapshot
Some improved bounds on the information rate of perfect secret sharing schemes
inferredcites →https://doi.org/10.1007/s10623-003-4192-1openalex-snapshot
Secret Sharing Schemes with Three or Four Minimal Qualified Subsets
inferredcites →https://doi.org/10.1016/0095-8956(92)90007-kopenalex-snapshot
On secret-sharing matroids
inferredcites →https://doi.org/10.1016/s0020-0190(02)00213-2openalex-snapshot
Lower bounds on the information rate of secret sharing schemes with homogeneous access structure
inferredcites →https://doi.org/10.1023/a:1008216403325openalex-snapshot
Tight Bounds on the Information Rate of Secret Sharing Schemes
inferredcites →https://doi.org/10.1023/a:1008244215660openalex-snapshot
Almost Affine Codes
inferredcites →https://doi.org/10.1109/18.272461openalex-snapshot
Decomposition constructions for secret-sharing schemes
inferredcites →https://doi.org/10.1109/18.887867openalex-snapshot
Secret sharing schemes with bipartite access structure
inferredcites →https://doi.org/10.1109/mark.1979.8817296openalex-snapshot
Safeguarding cryptographic keys
inferredcites →https://doi.org/10.1109/sct.1993.336536openalex-snapshot
On span programs
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/11832072_14openalex-snapshot
Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants
inferred← citeshttps://doi.org/10.1007/978-3-030-00434-7_23openalex-snapshot
Secret Sharing Schemes for (k, n)-Consecutive Access Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-44618-9_27openalex-snapshot
Secret Sharing Schemes for Dense Forbidden Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_15openalex-snapshot
On Secret Sharing Schemes, Matroids and Polymatroids
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_10openalex-snapshot
Secret Sharing Schemes for Very Dense Graphs
inferred← citeshttps://doi.org/10.1007/s00145-014-9195-8openalex-snapshot
Secret-Sharing Schemes for Very Dense Graphs
inferred← citeshttps://doi.org/10.1007/s10623-008-9264-9openalex-snapshot
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
inferred← citeshttps://doi.org/10.1007/s10623-025-01651-7openalex-snapshot
(k, n)-Consecutive access structures
inferred← citeshttps://doi.org/10.1016/j.dam.2008.04.001openalex-snapshot
Hypergraph decomposition and secret sharing
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.08.016openalex-snapshot
A note on secret sharing schemes with three homogeneous access structure
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174121openalex-snapshot
An Ideal Secret Sharing Scheme Realizing an Access Structure Based on a Finite Projective Plane of Order 3
inferred← citeshttps://doi.org/10.2478/v10065-012-0020-4openalex-snapshot
A Remark on Hierarchical Threshold Secret Sharing
inferred← citeshttps://doi.org/10.48550/arxiv.2106.14833openalex-snapshot
Linear Secret-Sharing Schemes for $k$-uniform access structures
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.