On the public citation graph
Geometric secret sharing schemes and their duals
0 signed · 78 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.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/0-387-34799-2_30openalex-snapshot
How to (Really) Share a Secret
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/bf01578872openalex-snapshot
Contemporary cryptology—The science of information integrity
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/mark.1979.8817296openalex-snapshot
Safeguarding cryptographic keys
inferredcites →https://doi.org/10.1112/blms/13.2.179openalex-snapshot
PROJECTIVE GEOMETRIES OVER FINITE FIELDS
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11533719_59openalex-snapshot
Error-Set Codes and Related Objects
inferred← citeshttps://doi.org/10.1007/11535218_20openalex-snapshot
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
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/3-540-36413-7_26openalex-snapshot
Secret Sharing Schemes on Access Structures with Intersection Number Equal to One
inferred← citeshttps://doi.org/10.1007/3-540-36563-x_19openalex-snapshot
Shared Generation of Pseudo-Random Functions with Cumulative Maps
inferred← citeshttps://doi.org/10.1007/3-540-36563-x_20openalex-snapshot
Authenticated Data Structures for Graph and Geometric Searching
inferred← citeshttps://doi.org/10.1007/3-540-45439-x_1openalex-snapshot
Bounds and Constructions for Unconditionally Secure Distributed Key Distribution Schemes for General Access Structures
inferred← citeshttps://doi.org/10.1007/3-540-48970-3_15openalex-snapshot
Changing Thresholds in the Absence of Secure Channels
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-319-70503-3_13openalex-snapshot
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-78381-9_22openalex-snapshot
Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing
inferred← citeshttps://doi.org/10.1007/978-3-540-24691-6_27openalex-snapshot
Group Oriented Cryptosystems Based on Linear Access Structures
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-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-662-44381-1_13openalex-snapshot
Optimal Non-perfect Uniform Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/bf00129769openalex-snapshot
Perfect Secret Sharing Schemes on Five Participants
inferred← citeshttps://doi.org/10.1007/bf00129770openalex-snapshot
A Construction for Multisecret Threshold Schemes
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/bfb0053421openalex-snapshot
A linear construction of perfect secret sharing schemes
inferred← citeshttps://doi.org/10.1007/s00022-003-1633-yopenalex-snapshot
Geometrical contributions to secret sharing theory
inferred← citeshttps://doi.org/10.1007/s00145-021-09410-2openalex-snapshot
On Abelian and Homomorphic Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/s001459900031openalex-snapshot
Mutually Trusted Authority-Free Secret Sharing Schemes
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-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-6667-8openalex-snapshot
Distributed Ring Signatures from General Dual Access Structures
inferred← citeshttps://doi.org/10.1007/s10623-006-0007-5openalex-snapshot
Generalised Cumulative Arrays in 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-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.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.2020.03.030openalex-snapshot
Multilevel secret sharing schemes arising from the normal rational curve
inferred← citeshttps://doi.org/10.1016/j.jco.2003.08.021openalex-snapshot
Shared generation of pseudo-random functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.02.030openalex-snapshot
Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures
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/s0012-365x(99)00004-7openalex-snapshot
Matroid representations by partitions
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00448-1openalex-snapshot
Generation of key predistribution schemes using secret sharing schemes
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00173-8openalex-snapshot
Generation of Key Predistribution Schemes using 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:1008261021505openalex-snapshot
Unconditionally Secure Group Authentication
inferred← citeshttps://doi.org/10.1023/a:1008378426278openalex-snapshot
Detection of Cheaters in Vector Space Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1023/a:1013856431727openalex-snapshot
Secret Sharing Schemes with Detection of Cheaters for a General Access Structure
inferred← citeshttps://doi.org/10.1023/a:1014939630572openalex-snapshot
Linear Key Predistribution Schemes
inferred← citeshttps://doi.org/10.1023/b:desi.0000036249.86262.d5openalex-snapshot
A Linear Algebraic Approach to Metering Schemes
inferred← citeshttps://doi.org/10.1109/fgcn.2008.89openalex-snapshot
Linguistic Approach to Cryptographic Data Sharing
inferred← citeshttps://doi.org/10.1109/isit.1997.613004openalex-snapshot
The optimal linear worst-case information rate
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492669openalex-snapshot
Lower bounds for monotone span programs
inferred← citeshttps://doi.org/10.1109/tit.2008.921692openalex-snapshot
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
inferred← citeshttps://doi.org/10.1109/tit.2014.2300113openalex-snapshot
Natural Generalizations of Threshold Secret Sharing
inferred← citeshttps://doi.org/10.1109/tit.2017.2654456openalex-snapshot
Generalized Hamming Weights for Almost Affine Codes
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.2021.3132917openalex-snapshot
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures
inferred← citeshttps://doi.org/10.1109/tit.2023.3265093openalex-snapshot
Partial Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1109/wowmom.2006.17openalex-snapshot
A Strong Ramp Secret Sharing Scheme Using Matrix Projection
inferred← citeshttps://doi.org/10.1515/jmc.2010.004openalex-snapshot
On secret sharing schemes, matroids and polymatroids
inferred← citeshttps://doi.org/10.32657/10356/59108openalex-snapshot
Secret sharing schemes and polymatroids
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.2018014openalex-snapshot
Reduced access structures with four minimal qualified subsets on six participants
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94334openalex-snapshot
Some digital signature schemes with collective signers
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.