On the public citation graph
Lower bound on the size of shares of nonperfect secret sharing 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.
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.1002/ecjc.4430720906openalex-snapshot
Secret sharing scheme realizing general access structure
inferredcites →https://doi.org/10.1007/0-387-34799-2_3openalex-snapshot
Generalized Secret Sharing and Monotone Functions
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-46766-1_7openalex-snapshot
On the Size of Shares for 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/3-540-48071-4_12openalex-snapshot
New General Lower Bounds 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/3-540-56503-5_68openalex-snapshot
Efficient sharing of many secrets
inferredcites →https://doi.org/10.1007/3-540-57220-1_52openalex-snapshot
Nonperfect secret sharing schemes
inferredcites →https://doi.org/10.1007/bf00196772openalex-snapshot
On the classification of ideal secret sharing schemes
inferredcites →https://doi.org/10.1007/bf02620229openalex-snapshot
Multiple assignment scheme for sharing secret
inferredcites →https://doi.org/10.1109/mark.1979.8817296openalex-snapshot
Safeguarding cryptographic keys
inferredcites →https://doi.org/10.1145/129712.129780openalex-snapshot
Communication complexity of secure computation (extended abstract)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1520-6440(199807)81:7<55::aid-ecjc7>3.0.co;2-#openalex-snapshot
An extended construction method for visual secret sharing schemes
inferred← citeshttps://doi.org/10.1007/978-3-030-65610-2_11openalex-snapshot
Cheating Detectable Ramp Secret Sharing with Optimal Cheating Resiliency
inferred← citeshttps://doi.org/10.1007/978-3-319-19713-5_30openalex-snapshot
SW-SSS: Slepian-Wolf Coding-Based Secret Sharing Scheme
inferred← citeshttps://doi.org/10.1007/978-3-319-40189-8_9openalex-snapshot
Recent Advances in Non-perfect Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/978-3-540-85886-7_31openalex-snapshot
A New (k,n)-Threshold Secret Sharing Scheme and Its Extension
inferred← citeshttps://doi.org/10.1007/978-3-642-32284-6_11openalex-snapshot
Optimum General Threshold Secret Sharing
inferred← citeshttps://doi.org/10.1007/978-3-662-44381-1_13openalex-snapshot
Optimal Non-perfect Uniform Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/bfb0028171openalex-snapshot
On ideal non-perfect secret sharing schemes
inferred← citeshttps://doi.org/10.1007/s00453-016-0217-9openalex-snapshot
On the Information Ratio of Non-perfect Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.09.012openalex-snapshot
Strongly secure ramp secret sharing schemes for general access structures
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.106018openalex-snapshot
Strong security of linear ramp secret sharing schemes with general access structures
inferred← citeshttps://doi.org/10.1023/a:1008381427667openalex-snapshot
A General Decomposition Construction for Incomplete Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.1.127openalex-snapshot
A Fast (3,n)-Threshold Secret Sharing Scheme Using Exclusive-OR Operations
inferred← citeshttps://doi.org/10.1109/candarw.2018.00081openalex-snapshot
Verifiable Secret Sharing Scheme Using Hash Values
inferred← citeshttps://doi.org/10.1109/isit.2005.1523536openalex-snapshot
Strongly secure ramp secret sharing schemes
inferred← citeshttps://doi.org/10.1109/isit.2007.4557361openalex-snapshot
Secure Construction for Nonlinear Function Threshold Ramp Secret Sharing
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517803openalex-snapshot
Equivalence of Non-Perfect Secret Sharing and Symmetric Private Information Retrieval with General Access Structure
inferred← citeshttps://doi.org/10.1109/itw62417.2025.11240272openalex-snapshot
On the Size of a Share for Non-perfect Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1109/jsac.2022.3142375openalex-snapshot
Equivalence of Non-Perfect Secret Sharing and Symmetric Private Information Retrieval With General Access Structure
inferred← citeshttps://doi.org/10.1109/tit.2018.2852276openalex-snapshot
Optimal Uniform Secret Sharing
inferred← citeshttps://doi.org/10.1109/tit.2023.3282940openalex-snapshot
Unified Approach to Secret Sharing and Symmetric Private Information Retrieval With Colluding Servers in Quantum Systems
inferred← citeshttps://doi.org/10.1201/9781420049503-c42openalex-snapshot
Crypto Topics and Applications II
inferred← citeshttps://doi.org/10.1201/9781584888215-c12openalex-snapshot
Crypto Topics and Applications I
inferred← citeshttps://doi.org/10.1201/9781584888215-c13openalex-snapshot
Crypto Topics and Applications II
inferred← citeshttps://doi.org/10.1587/transfun.e92.a.1808openalex-snapshot
A Fast (k,L,n)-Threshold Ramp Secret Sharing Scheme
inferred← citeshttps://doi.org/10.59287/icpis.813openalex-snapshot
A ramp secret sharing scheme from finite fields
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.