On the public citation graph

Decomposition Construction for Secret Sharing Schemes with Graph Access Structures in Polynomial Time

https://doi.org/10.1137/080733802
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.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-48071-4_38openalex-snapshot
Threshold Schemes with Disenrollment
inferredcites →https://doi.org/10.1007/bf00125203openalex-snapshot
An explication of secret sharing schemes
inferredcites →https://doi.org/10.1007/bf00129769openalex-snapshot
Perfect Secret Sharing Schemes on Five Participants
inferredcites →https://doi.org/10.1007/bf00196772openalex-snapshot
On the classification of ideal secret sharing schemes
inferredcites →https://doi.org/10.1007/bf00204801openalex-snapshot
Graph decompositions and secret sharing schemes
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/bf02579150openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1007/bf02620229openalex-snapshot
Multiple assignment scheme for sharing secret
inferredcites →https://doi.org/10.1007/s00607-009-0039-6openalex-snapshot
On an infinite family of graphs with information ratio 2 − 1/k
inferredcites →https://doi.org/10.1007/s10623-003-4192-1openalex-snapshot
Secret Sharing Schemes with Three or Four Minimal Qualified Subsets
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1016/j.dam.2008.04.001openalex-snapshot
Hypergraph decomposition and secret sharing
inferredcites →https://doi.org/10.1016/j.ipl.2006.01.016openalex-snapshot
Improved constructions of secret sharing schemes by applying -decompositions
inferredcites →https://doi.org/10.1016/s0020-0190(02)00213-2openalex-snapshot
Lower bounds on the information rate of secret sharing schemes with homogeneous access structure
inferredcites →https://doi.org/10.1016/s0898-1221(01)00328-5openalex-snapshot
Weighted decomposition construction for perfect secret sharing schemes
inferredcites →https://doi.org/10.1016/s0898-1221(99)00049-8openalex-snapshot
Recursive constructions for perfect secret sharing schemes
inferredcites →https://doi.org/10.1023/a:1008216403325openalex-snapshot
Tight Bounds on the Information Rate of Secret Sharing Schemes
inferredcites →https://doi.org/10.1023/a:1008381427667openalex-snapshot
A General Decomposition Construction for Incomplete Secret Sharing Schemes
inferredcites →https://doi.org/10.1109/18.272461openalex-snapshot
Decomposition constructions for secret-sharing schemes
inferredcites →https://doi.org/10.1109/18.887867openalex-snapshot
Secret sharing schemes with bipartite access structure
inferredcites →https://doi.org/10.1109/mark.1979.8817296openalex-snapshot
Safeguarding cryptographic keys
inferredcites →https://doi.org/10.1109/tit.2005.860412openalex-snapshot
Secret sharing schemes from three classes of linear codes
inferredcites →https://doi.org/10.1109/tit.2006.871050openalex-snapshot
Disenrollment with perfect forward secrecy in threshold schemes
inferredcites →https://doi.org/10.1109/tit.2007.899541openalex-snapshot
Lattice-Based Threshold Changeability for Standard Shamir Secret-Sharing Schemes
inferredcites →https://doi.org/10.1109/tit.2007.907505openalex-snapshot
Multiplicative Linear Secret Sharing Schemes Based on Connectivity of Graphs
inferredcites →https://doi.org/10.1137/s0895480104445654openalex-snapshot
Characterizing Ideal Weighted Threshold Secret Sharing
inferredcites →https://doi.org/10.1145/28395.28399openalex-snapshot
An algorithm for linear programming which requires O ((( m + n ) n z +( m + n ) 1 n )) arithmetic operations
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

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-642-32009-5_10openalex-snapshot
Secret Sharing Schemes for Very Dense Graphs
inferred← citeshttps://doi.org/10.1007/s00145-014-9195-8openalex-snapshot
Secret-Sharing Schemes for Very Dense Graphs
inferred← citeshttps://doi.org/10.1080/00207160.2014.941360openalex-snapshot
Perfect secret sharing scheme based on vertex domination set
inferred← citeshttps://doi.org/10.1080/09720529.2021.1923920openalex-snapshot
A new ideal secret sharing scheme based on a tree
inferred← citeshttps://doi.org/10.1088/1402-4896/ae5aeaopenalex-snapshot
Hierarchical quantum secret sharing protocol based on two-direction quantum walks on a circle
inferred← citeshttps://doi.org/10.18178/ijmlc.2019.9.1.768openalex-snapshot
Recursive General Secret Sharing Scheme Based on Authorized Subsets
inferred← citeshttps://doi.org/10.23919/icitst.2017.8356447openalex-snapshot
Multiple assignment secret sharing scheme using hierarchical threshold scheme
inferred← citeshttps://doi.org/10.30684/etj.32.5b.13openalex-snapshot
Construction of a Uniform Access Structure Using Minimum Independent Dominating Vertices
inferred← citeshttps://doi.org/10.3934/amc.2018014openalex-snapshot
Reduced access structures with four minimal qualified subsets on six participants
inferred← citeshttps://doi.org/10.48550/arxiv.2003.12651openalex-snapshot
An ideal hierarchical secret sharing scheme
inferred← citeshttps://doi.org/10.61091/jcmcc123-05openalex-snapshot
A Comprehensive Review of Graph Theory Applications in Secret Sharing Schemes
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.