On the public citation graph

Ideal Secret Sharing Schemes with Multiple Secrets

https://doi.org/10.1007/bf00189262
0 signed · 62 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-34805-0_26openalex-snapshot
Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimensional Linear Space
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-46885-4_45openalex-snapshot
Some Ideal Secret Sharing Schemes
inferredcites →https://doi.org/10.1007/3-540-48071-4_13openalex-snapshot
Universally Ideal 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-48071-4_38openalex-snapshot
Threshold Schemes with Disenrollment
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_10openalex-snapshot
Fully Dynamic Secret Sharing Schemes
inferredcites →https://doi.org/10.1007/3-540-48329-2_11openalex-snapshot
Multisecret Threshold Schemes
inferredcites →https://doi.org/10.1007/3-540-48658-5_17openalex-snapshot
Multi-Secret Sharing Schemes
inferredcites →https://doi.org/10.1007/3-540-56503-5_68openalex-snapshot
Efficient sharing of many secrets
inferredcites →https://doi.org/10.1007/bf00129770openalex-snapshot
A Construction for Multisecret Threshold Schemes
inferredcites →https://doi.org/10.1007/bf00196772openalex-snapshot
On the classification of ideal secret sharing schemes
inferredcites →https://doi.org/10.1007/bfb0053444openalex-snapshot
Space requirements for broadcast encryption
inferredcites →https://doi.org/10.1016/0020-0190(94)90127-9openalex-snapshot
On dynamic threshold schemes
inferredcites →https://doi.org/10.1016/0095-8956(92)90007-kopenalex-snapshot
On secret-sharing matroids
inferredcites →https://doi.org/10.1016/0304-3975(96)00003-5openalex-snapshot
Fully dynamic secret sharing schemes
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/18.335890openalex-snapshot
Universally ideal secret-sharing schemes
inferredcites →https://doi.org/10.1109/9780470544327openalex-snapshot
Contemporary Cryptology: The Science of Information Integrity
inferredcites →https://doi.org/10.1109/tit.1983.1056621openalex-snapshot
On secret sharing systems
inferredcites →https://doi.org/10.1145/129712.129780openalex-snapshot
Communication complexity of secure computation (extended abstract)
inferredcites →https://doi.org/10.1145/358746.358762openalex-snapshot
On sharing secrets and Reed-Solomon codes
inferredcites →https://doi.org/10.5860/choice.26-5690aopenalex-snapshot
Codes and cryptography

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/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-540-30576-7_32openalex-snapshot
Characterizing Ideal Weighted Threshold Secret Sharing
inferred← citeshttps://doi.org/10.1007/978-3-642-02937-0_2openalex-snapshot
Security of Linguistic Threshold Schemes in Multimedia Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-03958-4_28openalex-snapshot
Secure Information Splitting Using Grammar Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-10242-4_12openalex-snapshot
New Approach to Information Sharing Using Linguistic Threshold Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-10847-1_5openalex-snapshot
Shadow Generation Protocol in Linguistic Threshold Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-13577-4_15openalex-snapshot
Grammar Encoding in DNA-Like Secret Sharing Infrastructure
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-005-2761-1openalex-snapshot
Sharing Multiple Secrets: Models, Schemes and Analysis
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.1007/s11416-024-00530-4openalex-snapshot
On modular (CRT-based) secret sharing
inferred← citeshttps://doi.org/10.1016/j.camwa.2010.02.028openalex-snapshot
The use of mathematical linguistic methods in creating secret sharing threshold algorithms
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.jnca.2010.03.020openalex-snapshot
A novel linear multi-secret sharing scheme for group communication in wireless mesh networks
inferred← citeshttps://doi.org/10.1016/j.patrec.2012.04.010openalex-snapshot
A multi-threshold secret image sharing scheme based on MSP
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/s0166-218x(02)00448-1openalex-snapshot
Generation of key predistribution schemes using secret sharing schemes
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00399-7openalex-snapshot
Sharing one secret vs. sharing many secrets
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.1051/matecconf/20167101003openalex-snapshot
Optimal Improvement Ratios of Multi-Secret Sharing Schemes Can Be Achieved
inferred← citeshttps://doi.org/10.1080/00207160.2015.1091071openalex-snapshot
Multisecret-sharing schemes and bounded distance decoding of linear codes
inferred← citeshttps://doi.org/10.1088/1402-4896/adaa2eopenalex-snapshot
(t, m) Threshold quantum secret sharing with group authentication
inferred← citeshttps://doi.org/10.1109/18.771255openalex-snapshot
Multiple ramp schemes
inferred← citeshttps://doi.org/10.1109/globecom42002.2020.9322434openalex-snapshot
Secrecy and Accessibility in Distributed Storage
inferred← citeshttps://doi.org/10.1109/incit66780.2025.11276094openalex-snapshot
A Framework for Decentralized Will Execution Using Smart Contracts and Secret Sharing
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206455openalex-snapshot
Randomness Requirements for Three-Secret Sharing
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/nomsw.2010.5486566openalex-snapshot
Information security management based on grammar threshold schemes
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.1109/tifs.2021.3128822openalex-snapshot
Secure Codes With Accessibility for Distributed Storage
inferred← citeshttps://doi.org/10.1109/tit.2008.921708openalex-snapshot
On Matroids and Nonideal Secret Sharing
inferred← citeshttps://doi.org/10.1137/s0895480104445654openalex-snapshot
Characterizing Ideal Weighted Threshold Secret Sharing
inferred← citeshttps://doi.org/10.1137/s0895480195288819openalex-snapshot
Computing Functions of a Shared Secret
inferred← citeshttps://doi.org/10.1140/epjd/e2020-10010-3openalex-snapshot
A quantum secret sharing scheme with verifiable function
inferred← citeshttps://doi.org/10.1360/n112013-00205openalex-snapshot
极小特权数组上的理想多秘密共享方案
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-94536openalex-snapshot
Multipartite secret sharing schemes
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.