On the public citation graph
The size of a share must be large
0 signed · 42 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-48071-4_11openalex-snapshot
On the Information Rate of Secret Sharing Schemes
inferredcites →https://doi.org/10.1007/3-540-48285-7_11openalex-snapshot
Nonperfect Secret Sharing Schemes and Matroids
inferredcites →https://doi.org/10.1007/bf00198463openalex-snapshot
On the size of shares for secret sharing schemes
inferredcites →https://doi.org/10.1007/bf01171114openalex-snapshot
Ein Satz �ber Untermengen einer endlichen Menge
inferredcites →https://doi.org/10.1007/bf01398012openalex-snapshot
On the information rate of perfect secret sharing schemes
inferredcites →https://doi.org/10.1007/bf02620229openalex-snapshot
Multiple assignment scheme for sharing secret
inferredcites →https://doi.org/10.1016/s0019-9958(78)91063-xopenalex-snapshot
Polymatroidal dependence structure of a set of random variables
inferredcites →https://doi.org/10.1109/18.370169openalex-snapshot
New bounds on the information rate of secret sharing schemes
inferredcites →https://doi.org/10.1109/isit.1994.395104openalex-snapshot
On the information rate of perfect secret sharing schemes
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-030-17659-4_15openalex-snapshot
Secret-Sharing Schemes for General and Uniform Access Structures
inferred← citeshttps://doi.org/10.1007/978-3-030-57990-6_28openalex-snapshot
Secret Sharing Lower Bound: Either Reconstruction is Hard or Shares are Long
inferred← citeshttps://doi.org/10.1007/978-3-031-49187-0_17openalex-snapshot
Evolving Conditional Disclosure of Secrets
inferred← citeshttps://doi.org/10.1007/978-3-031-91092-0_2openalex-snapshot
Disincentivize Collusion in Verifiable Secret Sharing
inferred← citeshttps://doi.org/10.1007/978-3-032-01884-7_19openalex-snapshot
Lower Bounds for Garbled Circuits from Shannon-Type Information Inequalities
inferred← citeshttps://doi.org/10.1007/978-3-032-12290-2_14openalex-snapshot
Cryptography with Weak Privacy
inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_14openalex-snapshot
Weakly-Private Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/978-3-540-85855-3_12openalex-snapshot
On Linear Secret Sharing for Connectivity in Directed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_32openalex-snapshot
Secret Sharing and Non-Shannon Information Inequalities
inferred← citeshttps://doi.org/10.1007/978-3-642-20901-7_2openalex-snapshot
Secret-Sharing Schemes: A Survey
inferred← citeshttps://doi.org/10.1007/978-88-470-2481-6_14openalex-snapshot
Computazione a parti multiple
inferred← citeshttps://doi.org/10.1007/978-981-96-0941-3_3openalex-snapshot
Evolving Secret Sharing Made Short
inferred← citeshttps://doi.org/10.1007/bf01202040openalex-snapshot
Lower bounds for monotone span programs
inferred← citeshttps://doi.org/10.1007/bfb0028171openalex-snapshot
On ideal non-perfect secret sharing schemes
inferred← citeshttps://doi.org/10.1007/s004930050058openalex-snapshot
Superpolynomial Lower Bounds for Monotone Span Programs
inferred← citeshttps://doi.org/10.1007/s10623-025-01658-0openalex-snapshot
Evolving secret sharing revisited: computational security and succinctness
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/s0020-0190(97)00194-4openalex-snapshot
On secret sharing schemes
inferred← citeshttps://doi.org/10.1016/s0140-3664(98)00191-1openalex-snapshot
An on-line secret sharing scheme for multi-secrets
inferred← citeshttps://doi.org/10.1109/18.370169openalex-snapshot
New bounds on the information rate of secret sharing schemes
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00039openalex-snapshot
Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography
inferred← citeshttps://doi.org/10.1109/nca.2014.26openalex-snapshot
SDN-Based Private Interconnection
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492669openalex-snapshot
Lower bounds for monotone span programs
inferred← citeshttps://doi.org/10.1109/tit.2011.2162183openalex-snapshot
Secret Sharing and Non-Shannon Information Inequalities
inferred← citeshttps://doi.org/10.1109/tit.2021.3132917openalex-snapshot
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures
inferred← citeshttps://doi.org/10.1109/tit.2024.3373780openalex-snapshot
Secure Distributed Storage: Optimal Trade-Off Between Storage Rate and Privacy Leakage
inferred← citeshttps://doi.org/10.1145/1998412.1998437openalex-snapshot
How secret-sharing can defeat terrorist fraud
inferred← citeshttps://doi.org/10.1145/237814.238010openalex-snapshot
Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs
inferred← citeshttps://doi.org/10.7146/brics.v1i46.21596openalex-snapshot
Lower Bounds for Monotone Span Programs
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.