On the public citation graph

Multiple assignment scheme for sharing secret

https://doi.org/10.1007/bf02620229

0 signed · 121 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-48184-2_28openalex-snapshot

A Combinatorial Approach to Threshold Schemes

inferredcites →https://doi.org/10.1007/bf01171114openalex-snapshot

Ein Satz �ber Untermengen einer endlichen Menge

inferredcites →https://doi.org/10.1137/0401024openalex-snapshot

A Combinatorial Approach to Threshold Schemes

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.1007/11681878_25openalex-snapshot

On Matroids and Non-ideal Secret Sharing

inferred← citeshttps://doi.org/10.1007/3-540-36563-x_19openalex-snapshot

Shared Generation of Pseudo-Random Functions with Cumulative Maps

inferred← citeshttps://doi.org/10.1007/978-1-4419-5906-5_389openalex-snapshot

Secret Sharing Schemes

inferred← citeshttps://doi.org/10.1007/978-3-030-01689-0_13openalex-snapshot

On the Equivalence of 2-Threshold Secret Sharing Schemes and Prefix Codes

inferred← citeshttps://doi.org/10.1007/978-3-030-03332-3_13openalex-snapshot

Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols

inferred← citeshttps://doi.org/10.1007/978-3-030-17659-4_15openalex-snapshot

Secret-Sharing Schemes for General and Uniform Access Structures

inferred← citeshttps://doi.org/10.1007/978-3-030-31578-8_16openalex-snapshot

Evolving Perfect Hash Families: A Combinatorial Viewpoint of Evolving Secret Sharing

inferred← citeshttps://doi.org/10.1007/978-3-030-39303-8_14openalex-snapshot

Secret Sharing on Evolving Multi-level Access Structure

inferred← citeshttps://doi.org/10.1007/978-3-030-64381-2_18openalex-snapshot

The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs

inferred← citeshttps://doi.org/10.1007/978-3-030-65745-1_17openalex-snapshot

$$AC^0$$ Constructions of Secret Sharing Schemes – Accommodating New Parties

inferred← citeshttps://doi.org/10.1007/978-3-030-84252-9_21openalex-snapshot

Upslices, Downslices, and Secret-Sharing with Complexity of $$1.5^n$$

inferred← citeshttps://doi.org/10.1007/978-3-030-84252-9_25openalex-snapshot

Quadratic Secret Sharing and Conditional Disclosure of Secrets

inferred← citeshttps://doi.org/10.1007/978-3-030-90567-5_1openalex-snapshot

Leakage Resilient Cheating Detectable Secret Sharing Schemes

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/978-3-031-48618-0_13openalex-snapshot

Improved Polynomial Secret-Sharing Schemes

inferred← citeshttps://doi.org/10.1007/978-3-031-49187-0_17openalex-snapshot

Evolving Conditional Disclosure of Secrets

inferred← citeshttps://doi.org/10.1007/978-3-032-12290-2_14openalex-snapshot

Cryptography with Weak Privacy

inferred← citeshttps://doi.org/10.1007/978-3-032-12293-3_12openalex-snapshot

Simplified PIR and CDS Protocols and Improved Linear Secret-Sharing Schemes

inferred← citeshttps://doi.org/10.1007/978-3-032-12293-3_14openalex-snapshot

Polynomial Secret Sharing Schemes and Algebraic Matroids

inferred← citeshttps://doi.org/10.1007/978-3-032-25324-8_1openalex-snapshot

Traceable Secret Sharing Schemes for General Access Structures

inferred← citeshttps://doi.org/10.1007/978-3-032-35428-0_18openalex-snapshot

Private Information Retrieval: Share Conversions vs Decoding Polynomials

inferred← citeshttps://doi.org/10.1007/978-3-319-19962-7_5openalex-snapshot

Dynamic Threshold Public-Key Encryption with Decryption Consistency from Static Assumptions

inferred← citeshttps://doi.org/10.1007/978-3-319-44618-9_27openalex-snapshot

Secret Sharing Schemes for Dense Forbidden Graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-70503-3_12openalex-snapshot

Evolving Secret Sharing: Dynamic Thresholds and Robustness

inferred← citeshttps://doi.org/10.1007/978-3-319-70503-3_13openalex-snapshot

Linear Secret-Sharing Schemes for Forbidden Graph Access Structures

inferred← citeshttps://doi.org/10.1007/978-3-540-24660-2_27openalex-snapshot

Almost Ideal Contrast Visual Cryptography with Reversing

inferred← citeshttps://doi.org/10.1007/978-3-540-24691-6_29openalex-snapshot

Non-interactive Deniable Ring Authentication

inferred← citeshttps://doi.org/10.1007/978-3-540-85855-3_12openalex-snapshot

On Linear Secret Sharing for Connectivity in Directed Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-20901-7_2openalex-snapshot

Secret-Sharing Schemes: A Survey

inferred← citeshttps://doi.org/10.1007/978-3-642-39059-3_29openalex-snapshot

Secret Sharing Schemes with Conversion Protocol to Achieve Short Share-Size and Extendibility to Multiparty Computation

inferred← citeshttps://doi.org/10.1007/978-3-642-54242-8_17openalex-snapshot

Multi-linear Secret-Sharing Schemes

inferred← citeshttps://doi.org/10.1007/978-3-662-45608-8_14openalex-snapshot

Secret-Sharing for NP

inferred← citeshttps://doi.org/10.1007/978-3-662-48797-6_27openalex-snapshot

Secret Sharing and Statistical Zero Knowledge

inferred← citeshttps://doi.org/10.1007/978-3-662-53644-5_18openalex-snapshot

Threshold Secret Sharing Requires a Linear Size Alphabet

inferred← citeshttps://doi.org/10.1007/978-3-662-53644-5_19openalex-snapshot

How to Share a Secret, Infinitely

inferred← citeshttps://doi.org/10.1007/978-88-470-2481-6_14openalex-snapshot

Computazione a parti multiple

inferred← citeshttps://doi.org/10.1007/978-981-96-9435-8_6openalex-snapshot

Secret Sharing Schemes for General Access Structures with Leakage Resilience

inferred← citeshttps://doi.org/10.1007/bf00204801openalex-snapshot

Graph decompositions and secret sharing schemes

inferred← citeshttps://doi.org/10.1007/bf02944759openalex-snapshot

Practical secret sharing scheme realizing generalized adversary structure

inferred← citeshttps://doi.org/10.1007/bfb0000422openalex-snapshot

Lower bound on the size of shares of nonperfect secret sharing schemes

inferred← citeshttps://doi.org/10.1007/bfb0028461openalex-snapshot

On the decomposition constructions for perfect secret sharing schemes

inferred← citeshttps://doi.org/10.1007/bfb0053420openalex-snapshot

The size of a share must be large

inferred← citeshttps://doi.org/10.1007/s00022-003-1633-yopenalex-snapshot

Geometrical contributions to secret sharing theory

inferred← citeshttps://doi.org/10.1007/s00145-010-9056-zopenalex-snapshot

On d-Multiplicative Secret Sharing

inferred← citeshttps://doi.org/10.1007/s00145-014-9195-8openalex-snapshot

Secret-Sharing Schemes for Very Dense Graphs

inferred← citeshttps://doi.org/10.1007/s00145-015-9226-0openalex-snapshot

Secret-Sharing for NP

inferred← citeshttps://doi.org/10.1007/s00145-024-09515-4openalex-snapshot

Randomness Recoverable Secret Sharing Schemes

inferred← citeshttps://doi.org/10.1007/s001459900029openalex-snapshot

The Size of a Share Must Be Large

inferred← citeshttps://doi.org/10.1007/s10255-004-0206-7openalex-snapshot

Linear Secret Sharing Schemes and Rearrangements of Access Structures

inferred← citeshttps://doi.org/10.1007/s10623-003-1719-4openalex-snapshot

Distributing the Encryption and Decryption of a Block Cipher

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-006-0007-5openalex-snapshot

Generalised Cumulative Arrays in Secret Sharing

inferred← citeshttps://doi.org/10.1007/s10623-011-9546-5openalex-snapshot

Round-efficient perfectly secure message transmission scheme against general adversary

inferred← citeshttps://doi.org/10.1007/s12095-010-0039-6openalex-snapshot

Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures

inferred← citeshttps://doi.org/10.1007/s12095-016-0205-6openalex-snapshot

Secret sharing schemes for compartmented access structures

inferred← citeshttps://doi.org/10.1007/s12095-021-00531-wopenalex-snapshot

Secret sharing schemes based on the dual of Golay codes

inferred← citeshttps://doi.org/10.1016/0898-1221(96)00022-3openalex-snapshot

An efficient construction of perfect secret sharing schemes for graph-based structures

inferred← citeshttps://doi.org/10.1016/j.ifacol.2020.12.260openalex-snapshot

On the Secret Sharing Scheme Based on Supercodes Decoding

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.ins.2016.06.006openalex-snapshot

Realizing secret sharing with general access structure

inferred← citeshttps://doi.org/10.1016/j.jco.2003.08.021openalex-snapshot

Shared generation of pseudo-random functions

inferred← citeshttps://doi.org/10.1016/j.jcss.2005.03.002openalex-snapshot

General constructions for information-theoretic private information retrieval

inferred← citeshttps://doi.org/10.1016/j.jss.2006.03.046openalex-snapshot

New results on non-perfect sharing of multiple secrets

inferred← citeshttps://doi.org/10.1016/j.promfg.2018.03.149openalex-snapshot

An algebraic topology based secret sharing scheme

inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.003openalex-snapshot

Constructions of dynamic and non-dynamic threshold public-key encryption schemes with decryption consistency

inferred← citeshttps://doi.org/10.1016/s0045-7906(99)00012-9openalex-snapshot

New construction of perfect secret sharing schemes for graph-based prohibited structures

inferred← citeshttps://doi.org/10.1016/s0898-1221(01)00328-5openalex-snapshot

Weighted decomposition construction for perfect secret sharing schemes

inferred← citeshttps://doi.org/10.1016/s0898-1221(98)00177-1openalex-snapshot

Secret sharing schemes for graph-based prohibited structures

inferred← citeshttps://doi.org/10.1016/s0898-1221(99)00049-8openalex-snapshot

Recursive constructions for perfect secret sharing schemes

inferred← citeshttps://doi.org/10.1023/a:1024198519111openalex-snapshot

Providing Anonymity in Unconditionally Secure Secret Sharing Schemes

inferred← citeshttps://doi.org/10.1080/09720529.2021.1923920openalex-snapshot

A new ideal secret sharing scheme based on a tree

inferred← citeshttps://doi.org/10.1093/bioinformatics/btad639openalex-snapshot

Privacy-preserving federated genome-wide association studies via dynamic sampling

inferred← citeshttps://doi.org/10.1093/ietfec/e90-a.1.101openalex-snapshot

Optimal Multiple Assignments Based on Integer Programming in Secret Sharing Schemes with General Access Structures

inferred← citeshttps://doi.org/10.1109/18.705567openalex-snapshot

Secret sharing with public reconstruction

inferred← citeshttps://doi.org/10.1109/18.771255openalex-snapshot

Multiple ramp schemes

inferred← citeshttps://doi.org/10.1109/18.841188openalex-snapshot

MDS secret-sharing scheme secure against cheaters

inferred← citeshttps://doi.org/10.1109/access.2022.3223430openalex-snapshot

Learning Multi-Party Adversarial Encryption and Its Application to Secret Sharing

inferred← citeshttps://doi.org/10.1109/ccc.2005.12openalex-snapshot

Monotone Circuits for Weighted Threshold Functions

inferred← citeshttps://doi.org/10.1109/dsc49826.2021.9346272openalex-snapshot

Perpetual Secret Sharing from Dynamic Data Structures

inferred← citeshttps://doi.org/10.1109/icccas.2004.1345927openalex-snapshot

An efficient construction of secret sharing for generalized adversary structure and its reduction

inferred← citeshttps://doi.org/10.1109/iihmsp.2010.22openalex-snapshot

Multi-layer Secret Image Sharing

inferred← citeshttps://doi.org/10.1109/infcom.1994.337565openalex-snapshot

On constructing secret sharing schemes

inferred← citeshttps://doi.org/10.1109/infcom.1997.644525openalex-snapshot

Secret sharing in graph-based prohibited structures

inferred← citeshttps://doi.org/10.1109/isit.1997.613005openalex-snapshot

MDS secret sharing schemes secure against cheaters

inferred← citeshttps://doi.org/10.1109/isit.2014.6874863openalex-snapshot

Secret sharing schemes based on min-entropies

inferred← citeshttps://doi.org/10.1109/isit.2018.8437751openalex-snapshot

Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication

inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238216openalex-snapshot

Separating the power of monotone span programs over different fields

inferred← citeshttps://doi.org/10.1109/tcomm.2020.3029973openalex-snapshot

On the Rate Region of Symmetric Multilevel Imperfect Secret Sharing

inferred← citeshttps://doi.org/10.1109/tifs.2024.3488498openalex-snapshot

A New Shift-Add Secret Sharing Scheme for Partial Data Protection With Parallel Zigzag Decoding

inferred← citeshttps://doi.org/10.1109/tit.2008.921708openalex-snapshot

On Matroids and Nonideal Secret Sharing

inferred← citeshttps://doi.org/10.1109/tit.2011.2161927openalex-snapshot

General Error Decodable Secret Sharing Scheme and Its Application

inferred← citeshttps://doi.org/10.1109/tit.2017.2779121openalex-snapshot

How to Share a Secret, Infinitely

inferred← citeshttps://doi.org/10.1109/tnet.2023.3283577openalex-snapshot

Universal Adaptive Construction of Verifiable Secret Sharing and Its Application to Verifiable Secure Distributed Data Storage

inferred← citeshttps://doi.org/10.1137/080733802openalex-snapshot

Decomposition Construction for Secret Sharing Schemes with Graph Access Structures in Polynomial Time

inferred← citeshttps://doi.org/10.1137/s0097539704444038openalex-snapshot

Separating the Power of Monotone Span Programs over Different Fields

inferred← citeshttps://doi.org/10.1137/s0097539798346123openalex-snapshot

On Monotone Formula Composition of Perfect Zero-Knowledge Languages

inferred← citeshttps://doi.org/10.1137/s0895480100378689openalex-snapshot

Optimum Secret Sharing Scheme Secure against Cheating

inferred← citeshttps://doi.org/10.1137/s0895480102412868openalex-snapshot

On the Power of Nonlinear Secret-Sharing

inferred← citeshttps://doi.org/10.1142/s0129054100000168openalex-snapshot

ON THE DEALER'S RANDOMNESS REQUIRED IN PERFECT SECRET SHARING SCHEMES WITH ACCESS STRUCTURES OF CONSTANT RANK

inferred← citeshttps://doi.org/10.1145/3564246.3585127openalex-snapshot

Succinct Computational Secret Sharing

inferred← citeshttps://doi.org/10.1145/3717823.3718161openalex-snapshot

The Meta-complexity of Secret Sharing

inferred← citeshttps://doi.org/10.1201/b14977-11openalex-snapshot

Authentication Codes

inferred← citeshttps://doi.org/10.1515/jmc-2022-0020openalex-snapshot

Abelian sharing, common informations, and linear rank inequalities

inferred← citeshttps://doi.org/10.1515/jmc.2007.002openalex-snapshot

The combinatorics of generalised cumulative arrays

inferred← citeshttps://doi.org/10.15672/hujms.460348openalex-snapshot

Construction of arithmetic secret sharing schemes by using torsion limits

inferred← citeshttps://doi.org/10.1587/comex.4.317openalex-snapshot

Optimal multiple assignment scheme for strongly secure ramp secret sharing schemes with general access structures

inferred← citeshttps://doi.org/10.1587/transfun.2023tai0001openalex-snapshot

Information-Theoretic Perspectives for Simulation-Based Security in Multi-Party Computation

inferred← citeshttps://doi.org/10.1587/transfun.e100.a.726openalex-snapshot

Quantum Optimal Multiple Assignment Scheme for Realizing General Access Structure of Secret Sharing

inferred← citeshttps://doi.org/10.1587/transfun.e101.a.51openalex-snapshot

Password-Based Authentication Protocol for Secret-Sharing-Based Multiparty Computation

inferred← citeshttps://doi.org/10.1587/transfun.e98.a.213openalex-snapshot

Secret Sharing with Share-Conversion: Achieving Small Share-Size and Extendibility to Multiparty Computation

inferred← citeshttps://doi.org/10.1587/transfun.e99.a.856openalex-snapshot

Probabilistic Secret Sharing Schemes for Multipartite Access Structures

inferred← citeshttps://doi.org/10.3233/978-1-60750-663-8-38openalex-snapshot

Applications of finite geometry in coding theory and cryptography

inferred← citeshttps://doi.org/10.3233/jcs-210065openalex-snapshot

Optimal threshold padlock systems

inferred← citeshttps://doi.org/10.3390/e24040497openalex-snapshot

New Bounds and a Generalization for Share Conversion for 3-Server PIR

inferred← citeshttps://doi.org/10.3934/amc.2019005openalex-snapshot

Optimal information ratio of secret sharing schemes on Dutch windmill graphs

inferred← citeshttps://doi.org/10.4086/toc.2020.v016a002openalex-snapshot

inferred← citeshttps://doi.org/10.48550/arxiv.2003.12651openalex-snapshot

An ideal hierarchical secret sharing scheme

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.