On the public citation graph

A Construction for Multisecret Threshold Schemes

https://doi.org/10.1007/bf00129770
0 signed · 29 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/3-540-39757-4_22openalex-snapshot
An Optimal Class of Symmetric Key Generation Systems
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/bf00125203openalex-snapshot
An explication of secret sharing schemes
inferredcites →https://doi.org/10.1007/bf01388562openalex-snapshot
Geometric secret sharing schemes and their duals
inferredcites →https://doi.org/10.1093/oso/9780198502951.001.0001openalex-snapshot
Projective Geometries over Finite Fields
inferredcites →https://doi.org/10.1109/9780470544327openalex-snapshot
Contemporary Cryptology: The Science of Information Integrity

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-44683-4_26openalex-snapshot
Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio
inferred← citeshttps://doi.org/10.1007/978-3-031-37586-6_4openalex-snapshot
New Results on Distributed Secret Sharing Protocols
inferred← citeshttps://doi.org/10.1007/bf00189262openalex-snapshot
Ideal Secret Sharing Schemes with Multiple Secrets
inferred← citeshttps://doi.org/10.1007/s00022-003-1633-yopenalex-snapshot
Geometrical contributions to secret sharing theory
inferred← citeshttps://doi.org/10.1007/s10623-004-4031-zopenalex-snapshot
An Optimal Multisecret Threshold Scheme Construction
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-013-9831-6openalex-snapshot
New results and applications for multi-secret sharing schemes
inferred← citeshttps://doi.org/10.1007/s11277-013-1511-3openalex-snapshot
An Ideal Multi-secret Sharing Scheme Based on Connectivity of Graphs
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.ins.2010.11.032openalex-snapshot
An ideal multi-secret sharing scheme based on MSP
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.05.008openalex-snapshot
Linear threshold multisecret sharing schemes
inferred← citeshttps://doi.org/10.1016/j.sigpro.2013.12.022openalex-snapshot
Lossless and unlimited multi-image sharing based on Chinese remainder theorem and Lagrange interpolation
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00399-7openalex-snapshot
Sharing one secret vs. sharing many secrets
inferred← citeshttps://doi.org/10.1017/cbo9780511666209.009openalex-snapshot
The combinatorics of cryptographic key establishment
inferred← citeshttps://doi.org/10.1051/matecconf/20167101003openalex-snapshot
Optimal Improvement Ratios of Multi-Secret Sharing Schemes Can Be Achieved
inferred← citeshttps://doi.org/10.1109/compsac.2009.60openalex-snapshot
A Multiple Secret Sharing Scheme based on Matrix Projection
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619205openalex-snapshot
A Monotone Circuit Construction for Individually-Secure Multi-Secret Sharing
inferred← citeshttps://doi.org/10.1109/sutc.2006.125openalex-snapshot
Simple Multi-Secret Sharing Schemes to Achieve the Optimal Maximum Improvement Ratio
inferred← citeshttps://doi.org/10.3923/rjit.2013.67.72openalex-snapshot
A Review of Secret Sharing Schemes
inferred← citeshttps://doi.org/10.5555/338219.338262openalex-snapshot
Sharing one secret vs. sharing many secrets: tight bounds on the average improvement ratio
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95115openalex-snapshot
Contributions to secret sharing and other distributed cryptosystems
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.