On the public citation graph

Computationally Secure Multiple Secret Sharing: Models, Schemes, and Formal Security Analysis

0 signed · 26 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/11563952_24openalex-snapshot
An Improved Multi-stage (t, n)-Threshold Secret Sharing Scheme
inferredcites →https://doi.org/10.1007/3-540-45539-6_18openalex-snapshot
Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements
inferredcites →https://doi.org/10.1007/3-540-48329-2_12openalex-snapshot
Secret Sharing Made Short
inferredcites →https://doi.org/10.1007/3-540-60693-9_22openalex-snapshot
On-line secret sharing
inferredcites →https://doi.org/10.1007/s00145-005-0310-8openalex-snapshot
Characterization of Security Notions for Probabilistic Private-Key Encryption
inferredcites →https://doi.org/10.1007/s10623-005-2761-1openalex-snapshot
Sharing Multiple Secrets: Models, Schemes and Analysis
inferredcites →https://doi.org/10.1016/j.ins.2007.11.031openalex-snapshot
New efficient and practical verifiable multi-secret sharing schemes
inferredcites →https://doi.org/10.1016/j.ins.2014.08.046openalex-snapshot
Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem
inferredcites →https://doi.org/10.1016/j.ipl.2013.05.003openalex-snapshot
Sharing many secrets with computational provable security
inferredcites →https://doi.org/10.1016/j.tcs.2012.05.006openalex-snapshot
Verifiable multi-secret sharing based on LFSR sequences
inferredcites →https://doi.org/10.1016/s0096-3003(03)00355-2openalex-snapshot
A (t,n) multi-secret sharing scheme
inferredcites →https://doi.org/10.1049/el:19941076openalex-snapshot
Multistage secret sharing based on one-way function
inferredcites →https://doi.org/10.1109/sct.1993.336536openalex-snapshot
On span programs
inferredcites →https://doi.org/10.1145/1044552.1044557openalex-snapshot
A new multi-stage secret sharing scheme using one-way function
inferredcites →https://doi.org/10.1145/359168.359176openalex-snapshot
How to share a secret
inferredcites →https://doi.org/10.1201/b17668openalex-snapshot
Introduction to Modern Cryptography

What points at this work

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

inferred← citeshttps://doi.org/10.1002/sec.1641openalex-snapshot
Share secrets stage by stage with homogeneous linear feedback shift register in the standard model
inferred← citeshttps://doi.org/10.1007/s11277-016-3332-7openalex-snapshot
How to Fairly Share Multiple Secrets Stage by Stage
inferred← citeshttps://doi.org/10.1016/j.cosrev.2023.100608openalex-snapshot
Secret sharing: A comprehensive survey, taxonomy and applications
inferred← citeshttps://doi.org/10.1016/j.ins.2016.10.040openalex-snapshot
Secure publicly verifiable and proactive secret sharing schemes with general access structure
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.07.002openalex-snapshot
New multi-stage secret sharing in the standard model
inferred← citeshttps://doi.org/10.1038/s41598-021-96634-8openalex-snapshot
Enhanced (t, n) threshold d-level quantum secret sharing
inferred← citeshttps://doi.org/10.1049/iet-ifs.2017.0111openalex-snapshot
Provably secure verifiable multi‐stage secret sharing scheme based on monotone span program
inferred← citeshttps://doi.org/10.1049/iet-ifs.2018.5306openalex-snapshot
How to construct a verifiable multi‐secret sharing scheme based on graded encoding schemes
inferred← citeshttps://doi.org/10.1049/ipr2.13006openalex-snapshot
LWE‐based verifiable essential secret image sharing scheme ((t,s,k,n)$( {t,s,k,n} )$ ‐ VESIS)
inferred← citeshttps://doi.org/10.48550/arxiv.2103.11206openalex-snapshot
An Efficient Simulation of Quantum Secret Sharing
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.