On the public citation graph

Perfect Secret Sharing Schemes on Five Participants

https://doi.org/10.1007/bf00129769
0 signed · 104 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-39757-4_22openalex-snapshot
An Optimal Class of Symmetric Key Generation Systems
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-48071-4_33openalex-snapshot
Perfectly-Secure Key Distribution for Dynamic Conferences
inferredcites →https://doi.org/10.1007/3-540-48184-2_14openalex-snapshot
On the KEY PREDISTRIBUTION SYSTEM: A Practical Solution to the Key Distribution Problem
inferredcites →https://doi.org/10.1007/3-540-48329-2_11openalex-snapshot
Multisecret Threshold Schemes
inferredcites →https://doi.org/10.1007/978-1-4613-9323-8_25openalex-snapshot
A Note on Secret Sharing Schemes
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/bf00198463openalex-snapshot
On the size of shares for secret sharing schemes
inferredcites →https://doi.org/10.1007/bf00204801openalex-snapshot
Graph decompositions and 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.1093/oso/9780198502951.001.0001openalex-snapshot
Projective Geometries over Finite Fields
inferredcites →https://doi.org/10.1109/18.272461openalex-snapshot
Decomposition constructions for secret-sharing schemes
inferredcites →https://doi.org/10.1109/9780470544327openalex-snapshot
Contemporary Cryptology: The Science of Information Integrity
inferredcites →https://doi.org/10.1109/mark.1979.8817296openalex-snapshot
Safeguarding cryptographic keys
inferredcites →https://doi.org/10.1145/359168.359176openalex-snapshot
How to share a secret
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/11681878_25openalex-snapshot
On Matroids and Non-ideal Secret Sharing
inferred← citeshttps://doi.org/10.1007/11832072_14openalex-snapshot
Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants
inferred← citeshttps://doi.org/10.1007/3-540-36413-7_26openalex-snapshot
Secret Sharing Schemes on Access Structures with Intersection Number Equal to One
inferred← citeshttps://doi.org/10.1007/978-3-030-00434-7_23openalex-snapshot
Secret Sharing Schemes for (k, n)-Consecutive Access Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-56583-0_4openalex-snapshot
Lattice-Based Secret Sharing Scheme (Chinese Remainder Theorem)
inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_15openalex-snapshot
On Secret Sharing Schemes, Matroids and Polymatroids
inferred← citeshttps://doi.org/10.1007/978-3-540-72540-4_26openalex-snapshot
Ideal Multipartite Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_31openalex-snapshot
Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-14496-7_8openalex-snapshot
On the Optimization of Bipartite Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-20901-7_6openalex-snapshot
Ideal Secret Sharing Schemes for Useful Multipartite Access Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-40084-1_16openalex-snapshot
Secret Sharing, Rank Inequalities and Information Inequalities
inferred← citeshttps://doi.org/10.1007/s00022-003-1633-yopenalex-snapshot
Geometrical contributions to secret sharing theory
inferred← citeshttps://doi.org/10.1007/s00145-011-9101-6openalex-snapshot
Ideal Multipartite Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/s001459900031openalex-snapshot
Mutually Trusted Authority-Free Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/s00607-009-0039-6openalex-snapshot
On an infinite family of graphs with information ratio 2 − 1/k
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-003-4192-1openalex-snapshot
Secret Sharing Schemes with Three or Four Minimal Qualified Subsets
inferred← citeshttps://doi.org/10.1007/s10623-005-2761-1openalex-snapshot
Sharing Multiple Secrets: Models, Schemes and Analysis
inferred← citeshttps://doi.org/10.1007/s10623-008-9264-9openalex-snapshot
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
inferred← citeshttps://doi.org/10.1007/s10623-009-9304-0openalex-snapshot
An impossibility result on graph secret sharing
inferred← citeshttps://doi.org/10.1007/s10623-010-9446-0openalex-snapshot
Optimal complexity of secret sharing schemes with four minimal qualified subsets
inferred← citeshttps://doi.org/10.1007/s10623-011-9552-7openalex-snapshot
On the optimization of bipartite secret sharing schemes
inferred← citeshttps://doi.org/10.1007/s10623-013-9879-3openalex-snapshot
Optimal assignment schemes for general access structures based on linear programming
inferred← citeshttps://doi.org/10.1007/s10623-013-9888-2openalex-snapshot
Secret sharing on the d-dimensional cube
inferred← citeshttps://doi.org/10.1007/s10623-020-00811-1openalex-snapshot
Common information, matroid representation, and secret sharing for matroid ports
inferred← citeshttps://doi.org/10.1007/s10623-023-01187-8openalex-snapshot
Secret sharing on regular bipartite access structures
inferred← citeshttps://doi.org/10.1007/s10623-025-01651-7openalex-snapshot
(k, n)-Consecutive access structures
inferred← citeshttps://doi.org/10.1007/s10773-016-3121-9openalex-snapshot
A Generalized Information Theoretical Model for Quantum Secret Sharing
inferred← citeshttps://doi.org/10.1007/s11704-015-3255-6openalex-snapshot
The optimal information rate for graph access structures of nine participants
inferred← citeshttps://doi.org/10.1016/j.dam.2005.09.003openalex-snapshot
Secret sharing schemes on access structures with intersection number equal to one
inferred← citeshttps://doi.org/10.1016/j.dam.2012.10.020openalex-snapshot
Finding lower bounds on the complexity of secret sharing schemes by linear programming
inferred← citeshttps://doi.org/10.1016/j.dam.2017.08.006openalex-snapshot
The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.07.011openalex-snapshot
On the information ratio of graphs without high-degree neighbors
inferred← citeshttps://doi.org/10.1016/j.dam.2025.06.028openalex-snapshot
A note on extension properties and representations of matroids
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113445openalex-snapshot
Approximation and decomposition in lattices of clutters
inferred← citeshttps://doi.org/10.1016/j.ins.2013.03.047openalex-snapshot
New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.08.016openalex-snapshot
A note on secret sharing schemes with three homogeneous access structure
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.11.007openalex-snapshot
Optimal linear secret sharing schemes for graph access structures on six participants
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.08.032openalex-snapshot
On group-characterizability of homomorphic secret sharing schemes
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00213-2openalex-snapshot
Lower bounds on the information rate of secret sharing schemes with homogeneous access structure
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00086-0openalex-snapshot
More information theoretical inequalities to be used in secret sharing?
inferred← citeshttps://doi.org/10.1016/s0898-1221(01)00328-5openalex-snapshot
Weighted decomposition construction for perfect secret sharing schemes
inferred← citeshttps://doi.org/10.1023/a:1008259214236openalex-snapshot
A Linear Construction of Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1023/a:1008381427667openalex-snapshot
A General Decomposition Construction for Incomplete Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1023/a:1011225330458openalex-snapshot
On the Composition of Matroids and Ideal Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1109/icbmei.2011.5917883openalex-snapshot
The optimal information rate of perfect secret sharing schemes
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174121openalex-snapshot
An Ideal Secret Sharing Scheme Realizing an Access Structure Based on a Finite Projective Plane of Order 3
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834347openalex-snapshot
Construction of the Visual Cryptography Scheme with the Maximum Relative Difference under a Strong General Access Structure
inferred← citeshttps://doi.org/10.1109/tifs.2024.3484666openalex-snapshot
The Capacity Region of Distributed Multi-User Secret Sharing Under Perfect Secrecy
inferred← citeshttps://doi.org/10.1109/tit.2004.840857openalex-snapshot
Updating the Parameters of a Threshold Scheme by Minimal Broadcast
inferred← citeshttps://doi.org/10.1109/tit.2006.887090openalex-snapshot
Two Constructions on Limits of Entropy Functions
inferred← citeshttps://doi.org/10.1109/tit.2008.921708openalex-snapshot
On Matroids and Nonideal Secret Sharing
inferred← citeshttps://doi.org/10.1109/tit.2013.2264504openalex-snapshot
Bounds on the Threshold Gap in Secret Sharing and its Applications
inferred← citeshttps://doi.org/10.1109/tit.2015.2500232openalex-snapshot
Secret Sharing, Rank Inequalities, and Information Inequalities
inferred← citeshttps://doi.org/10.1109/tit.2020.2965102openalex-snapshot
Smallest Graphs Achieving the Stinson Bound
inferred← citeshttps://doi.org/10.1109/tit.2020.3005706openalex-snapshot
Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing
inferred← citeshttps://doi.org/10.1109/tit.2023.3265093openalex-snapshot
Partial Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1109/tit.2023.3322601openalex-snapshot
Information Ratio of Unicyclic Graphs
inferred← citeshttps://doi.org/10.1137/080733802openalex-snapshot
Decomposition Construction for Secret Sharing Schemes with Graph Access Structures in Polynomial Time
inferred← citeshttps://doi.org/10.1140/epjd/e2017-80286-3openalex-snapshot
Quantum secret sharing for a general quantum access structure
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.12720/jait.6.3.124-129openalex-snapshot
The Average Information Ratio of Secret-Sharing Schemes for Access Structures Based on Coalescence of Graphs
inferred← citeshttps://doi.org/10.1515/jmc-2016-0017openalex-snapshot
The complexity of the connected graph access structure on seven participants
inferred← citeshttps://doi.org/10.1515/jmc-2018-0024openalex-snapshot
Exact information ratios for secret sharing on small graphs with girth at least 5
inferred← citeshttps://doi.org/10.1515/jmc.2010.004openalex-snapshot
On secret sharing schemes, matroids and polymatroids
inferred← citeshttps://doi.org/10.1587/transfun.2020dmp0010openalex-snapshot
Optimal Basis Matrices of a Visual Cryptography Scheme with Meaningful Shares and Analysis of Its Security
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.2139/ssrn.6056665openalex-snapshot
The efficiency quantum secret sharing schemes on hypercyclic quantum structures
inferred← citeshttps://doi.org/10.2478/tmmp-2019-0008openalex-snapshot
On the Information Ratio of Graphs with Many Leaves
inferred← citeshttps://doi.org/10.3139/124.110489openalex-snapshot
Shamir Secret Sharing Scheme with Dynamic Access Structure (SSSDAS): case study on nuclear power plant
inferred← citeshttps://doi.org/10.32657/10356/59108openalex-snapshot
Secret sharing schemes and polymatroids
inferred← citeshttps://doi.org/10.3390/e25121566openalex-snapshot
A Numerical Study on the Capacity Region of a Three-Layer Wiretap Network
inferred← citeshttps://doi.org/10.37236/1825openalex-snapshot
Secret Sharing Schemes on Sparse Homogeneous Access Structures with Rank Three
inferred← citeshttps://doi.org/10.3934/amc.2013.7.311openalex-snapshot
Average complexities of access structures on five participants
inferred← citeshttps://doi.org/10.3934/amc.2019005openalex-snapshot
Optimal information ratio of secret sharing schemes on Dutch windmill graphs
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.859.596openalex-snapshot
The Optimal Information Rates of the Graph Access Structures on Seven Participants
inferred← citeshttps://doi.org/10.5281/zenodo.1080629openalex-snapshot
A Study On The Average Information Ratio Of Perfect Secret-Sharing Schemes For Access Structures Based On Bipartite Graphs
inferred← citeshttps://doi.org/10.5281/zenodo.2661336openalex-snapshot
A New Bound on the Average Information Ratio of Perfect Secret-Sharing Schemes for Access Structures Based on Bipartite Graphs of Larger Girth
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94536openalex-snapshot
Multipartite secret sharing schemes
inferred← citeshttps://doi.org/10.70675/d24b82c3z5e34z4b0azb979z5fe1bd1ec2b4openalex-snapshot
Partage de secret et théorie algorithmique de l'information
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.