On the public citation graph

A new multi‐use multi‐secret sharing scheme based on the duals of minimal linear codes

https://doi.org/10.1002/sec.972
0 signed · 34 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/sec.758openalex-snapshot
Secure secret reconstruction and multi‐secret sharing schemes with unconditional security
inferredcites →https://doi.org/10.1007/3-540-45066-1_2openalex-snapshot
Covering and Secret Sharing with Linear Codes
inferredcites →https://doi.org/10.1007/3-540-48658-5_17openalex-snapshot
Multi-Secret Sharing Schemes
inferredcites →https://doi.org/10.1007/s10623-011-9540-yopenalex-snapshot
On-line secret sharing
inferredcites →https://doi.org/10.1007/s10623-013-9831-6openalex-snapshot
New results and applications for multi-secret sharing schemes
inferredcites →https://doi.org/10.1007/s12095-012-0076-4openalex-snapshot
Cheating-immune secret sharing schemes from codes and cumulative arrays
inferredcites →https://doi.org/10.1016/j.amc.2004.06.120openalex-snapshot
A new (t,n) multi-secret sharing scheme based on Shamir’s secret sharing
inferredcites →https://doi.org/10.1016/j.csi.2006.02.004openalex-snapshot
A practical verifiable multi-secret sharing scheme
inferredcites →https://doi.org/10.1016/j.csi.2007.08.004openalex-snapshot
An efficient threshold verifiable multi-secret sharing
inferredcites →https://doi.org/10.1016/j.disc.2009.11.040openalex-snapshot
Three-level secret sharing schemes from the twisted cubic
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.2010.07.029openalex-snapshot
Secret sharing schemes from binary linear codes
inferredcites →https://doi.org/10.1016/j.ins.2010.09.013openalex-snapshot
Space efficient secret sharing for implicit data security
inferredcites →https://doi.org/10.1016/j.mcm.2011.07.024openalex-snapshot
A note on ramp secret sharing schemes from error-correcting codes
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.1109/mark.1979.8817296openalex-snapshot
Safeguarding cryptographic keys
inferredcites →https://doi.org/10.1109/tit.2005.860412openalex-snapshot
Secret sharing schemes from three classes of linear codes
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.1002/dac.3399openalex-snapshot
Efficient multisecret sharing scheme using new proposed computational security model
inferred← citeshttps://doi.org/10.1007/978-3-031-06764-8_39openalex-snapshot
A Privacy-Preserving Scheme by Combining Compressed Sensing and Secret Sharing in Cloud Environment
inferred← citeshttps://doi.org/10.1007/978-981-10-6890-4_60openalex-snapshot
A (t, n) Multi-secret Sharing Scheme with Updated Secret Shadows
inferred← citeshttps://doi.org/10.1007/978-981-15-8462-6_91openalex-snapshot
Verifiable Multi-use Multi-secret Sharing Scheme on Monotone Span Program
inferred← citeshttps://doi.org/10.1007/s11280-018-0575-0openalex-snapshot
E-voting scheme using secret sharing and K-anonymity
inferred← citeshttps://doi.org/10.1007/s12095-024-00768-1openalex-snapshot
Construction of minimal binary linear codes with dimension $$n+3$$
inferred← citeshttps://doi.org/10.1016/j.ins.2017.06.033openalex-snapshot
Attribute-based signcryption scheme based on linear codes
inferred← citeshttps://doi.org/10.1080/00207160.2015.1075986openalex-snapshot
Ideal access structures based on a class of minimal linear codes
inferred← citeshttps://doi.org/10.1088/1742-6596/1631/1/012139openalex-snapshot
Attribute-Based Identity Authentication Scheme Based on Linear Codes
inferred← citeshttps://doi.org/10.1109/access.2018.2877177openalex-snapshot
A Compact Ciphertext-Policy Attribute-Based Encryption Scheme for the Information-Centric Internet of Things
inferred← citeshttps://doi.org/10.1109/access.2020.2965732openalex-snapshot
Multi-Receiver Authentication Scheme for General Access Structure
inferred← citeshttps://doi.org/10.1109/iucc/dsci/smartcns.2019.00045openalex-snapshot
Verification in Mobile Communication During The Change of IP Address
inferred← citeshttps://doi.org/10.1109/tifs.2014.2384393openalex-snapshot
Randomized Component and Its Application to ( $t$ , $m$ , $n$ )-Group Oriented Secret Sharing
inferred← citeshttps://doi.org/10.3390/sym12010166openalex-snapshot
Efficient Lattice CP-ABE AC Scheme Supporting Reduced-OBDD Structure for CCN/NDN
inferred← citeshttps://doi.org/10.3934/amc.2016.10.53openalex-snapshot
Yet another variation on minimal linear codes
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.