On the public citation graph

On ideal non-perfect secret sharing schemes

https://doi.org/10.1007/bfb0028171
0 signed · 30 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/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-44750-4_29openalex-snapshot
On General Perfect 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-68697-5_30openalex-snapshot
New Results on Visual Cryptography
inferredcites →https://doi.org/10.1007/bf00125203openalex-snapshot
An explication of 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/bfb0000421openalex-snapshot
Multiplicative non-abelian sharing schemes and their application to threshold cryptography
inferredcites →https://doi.org/10.1007/bfb0000422openalex-snapshot
Lower bound on the size of shares of nonperfect secret sharing schemes
inferredcites →https://doi.org/10.1007/bfb0000423openalex-snapshot
On sharing many secrets
inferredcites →https://doi.org/10.1007/bfb0053420openalex-snapshot
The size of a share must be large
inferredcites →https://doi.org/10.1109/mark.1979.8817296openalex-snapshot
Safeguarding cryptographic keys
inferredcites →https://doi.org/10.1109/tit.1983.1056621openalex-snapshot
On secret sharing systems
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/978-3-319-40189-8_9openalex-snapshot
Recent Advances in Non-perfect Secret Sharing Schemes
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/s00371-019-01703-9openalex-snapshot
A new multi-secret image sharing scheme based on DCT
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.1007/s10623-013-9858-8openalex-snapshot
Extending Brickell–Davenport theorem to non-perfect secret sharing schemes
inferred← citeshttps://doi.org/10.1051/e3sconf/202453802024openalex-snapshot
RETRACTED: Ways to explore cryptography methods
inferred← citeshttps://doi.org/10.1109/dasc.2006.11openalex-snapshot
A Reliable (k, n) Image Secret Sharing Scheme
inferred← citeshttps://doi.org/10.1109/icc51166.2024.10623016openalex-snapshot
Secret Sharing for DNA Probability Vectors
inferred← citeshttps://doi.org/10.1109/icif.2006.301805openalex-snapshot
An Image Secret Sharing Method
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/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/jsait.2025.3593447openalex-snapshot
Ramp Secret Sharing for Composite DNA
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.1109/wowmom.2006.17openalex-snapshot
A Strong Ramp Secret Sharing Scheme Using Matrix Projection
inferred← citeshttps://doi.org/10.32474/ctcsa.2018.01.000106openalex-snapshot
An Image Secret Sharing Method Based on Shamir Secret Sharing
inferred← citeshttps://doi.org/10.48550/arxiv.2104.05405openalex-snapshot
Additive Tridiagonal Codes over $\mathbb{F}_{4}$
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.