On the public citation graph
A linear construction of perfect secret sharing schemes
0 signed · 39 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-46885-4_45openalex-snapshot
Some Ideal Secret Sharing Schemes
inferredcites →https://doi.org/10.1007/3-540-57220-1_53openalex-snapshot
A construction of practical secret sharing schemes using linear block codes
inferredcites →https://doi.org/10.1007/3-540-58265-7_5openalex-snapshot
Linear algebra approach to 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/bf00198463openalex-snapshot
On the size of shares for secret sharing schemes
inferredcites →https://doi.org/10.1007/bf01388562openalex-snapshot
Geometric secret sharing schemes and their duals
inferredcites →https://doi.org/10.1007/bf01398012openalex-snapshot
On the information rate of perfect 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.1007/bfb0053421openalex-snapshot
A linear construction of perfect secret sharing schemes
inferredcites →https://doi.org/10.1109/18.272461openalex-snapshot
Decomposition constructions for secret-sharing schemes
inferredcites →https://doi.org/10.2307/2344305openalex-snapshot
Information Theory and Reliable Communication.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11599548_32openalex-snapshot
Classification of Universally Ideal Homomorphic Secret Sharing Schemes and Ideal Black-Box Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/978-3-030-43120-4_18openalex-snapshot
Generalized Secret Sharing Schemes Using N$$^\mu $$MDS Codes
inferred← citeshttps://doi.org/10.1007/978-3-032-12293-3_14openalex-snapshot
Polynomial Secret Sharing Schemes and Algebraic Matroids
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-981-13-2095-8_32openalex-snapshot
Fourier-Based Function Secret Sharing with General Access Structure
inferred← citeshttps://doi.org/10.1007/bf01202040openalex-snapshot
Lower bounds for monotone span programs
inferred← citeshttps://doi.org/10.1007/bf01398012openalex-snapshot
On the information rate of perfect secret sharing schemes
inferred← citeshttps://doi.org/10.1007/bfb0023288openalex-snapshot
The access structure of some secret-sharing schemes
inferred← citeshttps://doi.org/10.1007/bfb0028469openalex-snapshot
Multisender authentication systems with unconditional security
inferred← citeshttps://doi.org/10.1007/s10623-003-1158-2openalex-snapshot
A General Approach to Robust Web Metering
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.1016/s0304-3975(00)00207-3openalex-snapshot
Secret-sharing with a class of ternary codes
inferred← citeshttps://doi.org/10.1023/a:1008259214236openalex-snapshot
A Linear Construction of Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1023/a:1008261021505openalex-snapshot
Unconditionally Secure Group Authentication
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.8.2138openalex-snapshot
On Increasing the Number of Users in (t, n) Threshold Secret Sharing Schemes
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/isit44484.2020.9174044openalex-snapshot
Secret sharing schemes based on Nonlinear codes
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/isita.2008.4895378openalex-snapshot
On some properties of the (t, n) threshold secret sharing schemes based on the generalized vector space construction
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/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.2023.3282940openalex-snapshot
Unified Approach to Secret Sharing and Symmetric Private Information Retrieval With Colluding Servers in Quantum Systems
inferred← citeshttps://doi.org/10.4213/mvk212openalex-snapshot
Схема разделения секрета типа схемы Блэкли, основанная на пересечении подпространств
showing the first 27 of 28 · page through all 28
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.