On the public citation graph

The access structure of some secret-sharing schemes

https://doi.org/10.1007/bfb0023288
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.
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/0-387-34799-2openalex-snapshot
Advances in Cryptology — CRYPTO’ 88
inferredcites →https://doi.org/10.1007/0-387-34799-2_30openalex-snapshot
How to (Really) Share a Secret
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-46877-3openalex-snapshot
Advances in Cryptology – EUROCRYPT 2017
inferredcites →https://doi.org/10.1007/3-540-46885-4_45openalex-snapshot
Some Ideal 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/bfb0053421openalex-snapshot
A linear construction of perfect secret sharing schemes
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1093/comjnl/37.3.199openalex-snapshot
Reusing Shares in Secret Sharing Schemes
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/191177.191196openalex-snapshot
Conditionally secure secret sharing schemes with disenrollment capability
inferredcites →https://doi.org/10.1145/358746.358762openalex-snapshot
On sharing secrets and Reed-Solomon codes
inferredcites →https://doi.org/10.1145/359168.359176openalex-snapshot
How to share a secret
inferredcites →https://doi.org/10.61091/jcmccopenalex-snapshot
Journal of Combinatorial Mathematics and Combinatorial Computing

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-45066-1_2openalex-snapshot
Covering and Secret Sharing with Linear Codes
inferred← citeshttps://doi.org/10.1007/s10255-014-0431-7openalex-snapshot
The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures
inferred← citeshttps://doi.org/10.1007/s10623-024-01478-8openalex-snapshot
On Boolean functions derived from linear maps over $$\mathbb {Z}_4$$ and their application to secret sharing
inferred← citeshttps://doi.org/10.1007/s11424-013-2131-4openalex-snapshot
The optimal linear secret sharing scheme for any given access structure
inferred← citeshttps://doi.org/10.1007/s12095-012-0076-4openalex-snapshot
Cheating-immune secret sharing schemes from codes and cumulative arrays
inferred← citeshttps://doi.org/10.1007/s12095-025-00850-2openalex-snapshot
Hamming weight enumerators and hulls of linear codes with new parameters associated with simplicial complexes
inferred← citeshttps://doi.org/10.1016/j.disc.2013.03.023openalex-snapshot
The maximum number of minimal codewords in an [n,k] -code
inferred← citeshttps://doi.org/10.1016/j.ins.2010.07.029openalex-snapshot
Secret sharing schemes from binary linear codes
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00207-3openalex-snapshot
Secret-sharing with a class of ternary codes
inferred← citeshttps://doi.org/10.1049/cje.2021.06.012openalex-snapshot
Secret Sharing Schemes from Linear Codes over F2+vF2+v2F2
inferred← citeshttps://doi.org/10.1109/gcwkshps56602.2022.10008706openalex-snapshot
Nonlinear Secret Sharing Schemes based on Z4 Linear Codes
inferred← citeshttps://doi.org/10.1109/iccea.2010.29openalex-snapshot
The Existence of Linear Code for Any Access Structure
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174044openalex-snapshot
Secret sharing schemes based on Nonlinear codes
inferred← citeshttps://doi.org/10.1109/tit.2005.847722openalex-snapshot
Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1109/tit.2005.860412openalex-snapshot
Secret sharing schemes from three classes of linear codes
inferred← citeshttps://doi.org/10.1142/s179383091450013xopenalex-snapshot
ON THE COMPOSITION OF SECRET SHARING SCHEMES RELATED TO CODES
inferred← citeshttps://doi.org/10.1145/2070425.2070435openalex-snapshot
The optimal linear multi-secret sharing scheme for non-threshold access structure(student contribution)
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.e95.a.1193openalex-snapshot
Secret Sharing Schemes from Linear Codes over Finite Rings
inferred← citeshttps://doi.org/10.17265/1934-7332/2015.02.005openalex-snapshot
A New Method to Construct Secret Sharing Schemes Based on Linear Codes
inferred← citeshttps://doi.org/10.18500/1816-9791-2024-24-3-330-341openalex-snapshot
Constructions of some secret sharing schemes based on linear codes
inferred← citeshttps://doi.org/10.21203/rs.3.rs-4824482/v1openalex-snapshot
Minimal linear codes based on weakly regular bent functions over finite fields
inferred← citeshttps://doi.org/10.32657/10356/54695openalex-snapshot
On secret sharing schemes and linear codes
inferred← citeshttps://doi.org/10.3390/math8081200openalex-snapshot
A New Secret Sharing Scheme Based on Polynomials over Finite Fields
inferred← citeshttps://doi.org/10.46298/jgcc.2023.14.2.10150openalex-snapshot
Multi-recipient and threshold encryption based on hidden multipliers
inferred← citeshttps://doi.org/10.48550/arxiv.2108.06967openalex-snapshot
Multiparty secret sharing based on hidden multipliers
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.