On the public citation graph

Practical secret sharing scheme realizing generalized adversary structure

https://doi.org/10.1007/bf02944759
0 signed · 18 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-2_3openalex-snapshot
Generalized Secret Sharing and Monotone Functions
inferredcites →https://doi.org/10.1007/3-540-45539-6_22openalex-snapshot
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
inferredcites →https://doi.org/10.1007/bf02620229openalex-snapshot
Multiple assignment scheme for sharing secret
inferredcites →https://doi.org/10.1007/s004460050050openalex-snapshot
Byzantine quorum systems
inferredcites →https://doi.org/10.1016/s0140-3664(99)00041-9openalex-snapshot
General secret sharing scheme
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

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s10207-009-0085-2openalex-snapshot
A secret sharing scheme based on (t, n) threshold and adversary structure
inferred← citeshttps://doi.org/10.1007/s11042-016-4065-zopenalex-snapshot
(t, n) Threshold secret image sharing scheme with adversary structure
inferred← citeshttps://doi.org/10.1007/s11277-015-2310-9openalex-snapshot
A New Verifiable Multi-secret Sharing Scheme Realizing Adversary Structure
inferred← citeshttps://doi.org/10.1016/j.camwa.2011.12.067openalex-snapshot
A secret sharing scheme with a short share realizing the (t,n) threshold and the adversary structure
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.06.006openalex-snapshot
Recursive hiding of biometrics-based secret sharing scheme using adversary structure
inferred← citeshttps://doi.org/10.1109/icsess.2014.6933560openalex-snapshot
Cloud data security access with privacy-preserving
inferred← citeshttps://doi.org/10.3837/tiis.2014.12.018openalex-snapshot
A (k,t,n) Verifiable Multi-secret Sharing Scheme Based on Adversary Structure
inferred← citeshttps://doi.org/10.4018/978-1-60566-262-6.ch011openalex-snapshot
Secret Sharing with k-Dimensional Access Structure
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.571-572.63openalex-snapshot
A Secret Sharing Scheme on Access Structure
inferred← citeshttps://doi.org/10.5815/ijisa.2011.01.08openalex-snapshot
Sensitive Data Protection Based on Intrusion Tolerance in Cloud Computing
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.