On the public citation graph

On the dealer's randomness required in secret sharing schemes

https://doi.org/10.1007/bfb0053422
0 signed · 35 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-38424-3_16openalex-snapshot
Geometric Shared Secret and/or Shared Control Schemes
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-58201-0_99openalex-snapshot
Randomness in distribution protocols
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/bf02451112openalex-snapshot
Some improved bounds on the information rate of perfect secret sharing schemes
inferredcites →https://doi.org/10.1017/cbo9780511662089.010openalex-snapshot
Combinatorial designs and cryptography
inferredcites →https://doi.org/10.1090/pspum/019/9959openalex-snapshot
Solution of Kirkman’s schoolgirl problem
inferredcites →https://doi.org/10.1109/18.272461openalex-snapshot
Decomposition constructions for secret-sharing schemes
inferredcites →https://doi.org/10.1109/mark.1979.8817296openalex-snapshot
Safeguarding cryptographic keys
inferredcites →https://doi.org/10.1109/sfcs.1989.63486openalex-snapshot
How to recycle random bits
inferredcites →https://doi.org/10.1109/tit.1983.1056621openalex-snapshot
On secret sharing systems
inferredcites →https://doi.org/10.1137/0401024openalex-snapshot
A Combinatorial Approach to Threshold Schemes
inferredcites →https://doi.org/10.1145/28395.28420openalex-snapshot
How to play ANY mental game
inferredcites →https://doi.org/10.1145/359168.359176openalex-snapshot
How to share a secret
inferredcites →https://doi.org/10.1145/62212.62221openalex-snapshot
A time-randomness tradeoff for oblivious routing
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/3-540-58201-0_99openalex-snapshot
Randomness in distribution protocols
inferred← citeshttps://doi.org/10.1007/s001459910005openalex-snapshot
Randomness versus Fault-Tolerance
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00003-5openalex-snapshot
Fully dynamic secret sharing schemes
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00153-2openalex-snapshot
Probability of shares in secret sharing schemes
inferred← citeshttps://doi.org/10.1023/a:1008242111272openalex-snapshot
On the Dealer's Randomness Required in Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1137/s089548019427634xopenalex-snapshot
A Randomness-Rounds Tradeoff in Private Computation
inferred← citeshttps://doi.org/10.1145/248052.248089openalex-snapshot
Randomness in private computations
inferred← citeshttps://doi.org/10.1145/277697.277710openalex-snapshot
Amortizing randomness in private multiparty computations
inferred← citeshttps://doi.org/10.1587/transfun.e92.a.1808openalex-snapshot
A Fast (k,L,n)-Threshold Ramp Secret Sharing Scheme
inferred← citeshttps://doi.org/10.26190/unsworks/2617openalex-snapshot
Enabling Private Real-Time Applications by Exploiting the Links Between Erasure Coding and Secret Sharing Mechanisms
inferred← citeshttps://doi.org/10.4018/978-1-7998-1763-5.ch031openalex-snapshot
On the Pixel Expansion of Visual Cryptography Scheme
inferred← citeshttps://doi.org/10.4018/ijdcf.2017040104openalex-snapshot
On the Pixel Expansion of Visual Cryptography Scheme
inferred← citeshttps://doi.org/10.70675/917917aazea0dz4e59za473z4fe715be2b1bopenalex-snapshot
Enabling private real-time applications by exploiting the links between erasure coding and secret sharing mechanisms
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.