On the public citation graph
Secret sharing schemes with bipartite access structure
0 signed · 28 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/3-540-38424-3_16openalex-snapshot
Geometric Shared Secret and/or Shared Control Schemes
inferredcites →https://doi.org/10.1007/3-540-46766-1_7openalex-snapshot
On the Size of Shares for 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-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/bf00191319openalex-snapshot
An interactive identification scheme based on discrete logarithms and factoring
inferredcites →https://doi.org/10.1007/bf00196772openalex-snapshot
On the classification of ideal 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.1016/0304-3975(95)00065-8openalex-snapshot
On the information rate of secret sharing schemes
inferredcites →https://doi.org/10.1016/0898-1221(95)90225-2openalex-snapshot
Cryptography: Theory and practice
inferredcites →https://doi.org/10.1023/a:1008216403325openalex-snapshot
Tight Bounds on the Information Rate of Secret Sharing Schemes
inferredcites →https://doi.org/10.1109/18.272461openalex-snapshot
Decomposition constructions for secret-sharing schemes
inferredcites →https://doi.org/10.1109/mark.1979.8817296openalex-snapshot
Safeguarding cryptographic keys
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/sec.1668openalex-snapshot
Ideal social secret sharing using Birkhoff interpolation method
inferred← citeshttps://doi.org/10.1007/11535218_20openalex-snapshot
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_14openalex-snapshot
Secret sharing schemes with detection of cheaters for a general access structure
inferred← citeshttps://doi.org/10.1007/978-3-540-24638-1_26openalex-snapshot
Hierarchical Threshold Secret Sharing
inferred← citeshttps://doi.org/10.1007/s00145-006-0334-8openalex-snapshot
Hierarchical Threshold Secret Sharing
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00149-5openalex-snapshot
Robust vector space secret sharing schemes
inferred← citeshttps://doi.org/10.1109/cads.2015.7377795openalex-snapshot
Hierarchical threshold multi-secret sharing scheme based on Birkhoff interpolation and cellular automata
inferred← citeshttps://doi.org/10.1142/s179383091450013xopenalex-snapshot
ON THE COMPOSITION OF SECRET SHARING SCHEMES RELATED TO CODES
inferred← citeshttps://doi.org/10.1515/jmc-2015-0002openalex-snapshot
A characterisation of ideal weighted secret sharing schemes
inferred← citeshttps://doi.org/10.48550/arxiv.1211.5566openalex-snapshot
On the Composition of Secret Sharing Schemes Related to Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1308.3763openalex-snapshot
A Characterization of Ideal Weighted Secret Sharing Schemes
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.