On the public citation graph

On the size of shares for secret sharing schemes

https://doi.org/10.1007/bf00198463

0 signed · 255 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.1002/j.1538-7305.1948.tb00917.xopenalex-snapshot

A Mathematical Theory of Communication

inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb01338.xopenalex-snapshot

A Mathematical Theory of Communication

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_17openalex-snapshot

Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes

inferredcites →https://doi.org/10.1007/3-540-39568-7openalex-snapshot

Advances in Cryptology

inferredcites →https://doi.org/10.1007/3-540-39568-7_19openalex-snapshot

Generalized Linear Threshold Scheme

inferredcites →https://doi.org/10.1007/3-540-39568-7_20openalex-snapshot

Security of Ramp Schemes

inferredcites →https://doi.org/10.1007/3-540-47555-9_1openalex-snapshot

Graph Decompositions and Secret Sharing Schemes

inferredcites →https://doi.org/10.1007/978-1-4613-9323-8_25openalex-snapshot

A Note on 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/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.1109/mark.1979.8817296openalex-snapshot

Safeguarding cryptographic keys

inferredcites →https://doi.org/10.1109/tit.1983.1056621openalex-snapshot

On secret sharing systems

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.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.1002/cpe.6146openalex-snapshot

Publicly verifiable threshold secret sharing based on three‐dimensional‐cellular automata

inferred← citeshttps://doi.org/10.1002/ecjc.4430781003openalex-snapshot

Secret sharing schemes based on combinatorial designs

inferred← citeshttps://doi.org/10.1002/sec.1768openalex-snapshot

Publicly verifiable secret sharing scheme and its application with almost optimal information rate

inferred← citeshttps://doi.org/10.1002/sec.576openalex-snapshot

Hash function‐based secret sharing scheme designs

inferred← citeshttps://doi.org/10.1006/inco.1996.0095openalex-snapshot

Randomness in Distribution Protocols

inferred← citeshttps://doi.org/10.1007/10718964_37openalex-snapshot

Sharing Block Ciphers

inferred← citeshttps://doi.org/10.1007/11507840_2openalex-snapshot

Protecting Secret Data from Insider Attacks

inferred← citeshttps://doi.org/10.1007/11681878_25openalex-snapshot

On Matroids and Non-ideal Secret Sharing

inferred← citeshttps://doi.org/10.1007/11832072_14openalex-snapshot

Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants

inferred← citeshttps://doi.org/10.1007/3-540-36413-7_26openalex-snapshot

Secret Sharing Schemes on Access Structures with Intersection Number Equal to One

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/3-540-44750-4_29openalex-snapshot

On General Perfect Secret Sharing Schemes

inferred← citeshttps://doi.org/10.1007/3-540-45450-0_7openalex-snapshot

Requirements for Group Independent Linear Threshold Secret Sharing Schemes

inferred← citeshttps://doi.org/10.1007/3-540-47719-5_30openalex-snapshot

Randomness Required for Linear Threshold Sharing Schemes Defined over Any Finite Abelian Group

inferred← citeshttps://doi.org/10.1007/3-540-48071-4_11openalex-snapshot

On the Information Rate of Secret Sharing Schemes

inferred← citeshttps://doi.org/10.1007/3-540-48071-4_12openalex-snapshot

New General Lower Bounds on the Information Rate of Secret Sharing Schemes

inferred← citeshttps://doi.org/10.1007/3-540-48285-7_10openalex-snapshot

Size of Shares and Probability of Cheating in Threshold Schemes

inferred← citeshttps://doi.org/10.1007/3-540-48329-2_10openalex-snapshot

Fully Dynamic Secret Sharing Schemes

inferred← citeshttps://doi.org/10.1007/3-540-48658-5_17openalex-snapshot

Multi-Secret Sharing Schemes

inferred← citeshttps://doi.org/10.1007/3-540-48970-3_15openalex-snapshot

Changing Thresholds in the Absence of Secure Channels

inferred← citeshttps://doi.org/10.1007/3-540-49264-x_15openalex-snapshot

Efficient Secret Sharing Without a Mutually Trusted Authority

inferred← citeshttps://doi.org/10.1007/3-540-49264-x_16openalex-snapshot

General Short Computational Secret Sharing Schemes

inferred← citeshttps://doi.org/10.1007/3-540-56503-5_68openalex-snapshot

Efficient sharing of many secrets

inferred← citeshttps://doi.org/10.1007/3-540-57220-1_52openalex-snapshot

Nonperfect secret sharing schemes

inferred← citeshttps://doi.org/10.1007/3-540-57843-9_11openalex-snapshot

Secret sharing schemes with veto capabilities

inferred← citeshttps://doi.org/10.1007/3-540-58201-0_99openalex-snapshot

Randomness in distribution protocols

inferred← citeshttps://doi.org/10.1007/3-540-60693-9_22openalex-snapshot

On-line secret sharing

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

Secret Sharing Schemes

inferred← citeshttps://doi.org/10.1007/978-1-4419-8608-5openalex-snapshot

A First Course in Information Theory

inferred← citeshttps://doi.org/10.1007/978-1-4757-3789-9_17openalex-snapshot

On Entropy, Information Inequalities, and Groups

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

Constructing Ideal Secret Sharing Schemes Based on Chinese Remainder Theorem

inferred← citeshttps://doi.org/10.1007/978-3-030-03807-6_12openalex-snapshot

On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate

inferred← citeshttps://doi.org/10.1007/978-3-030-45388-6_21openalex-snapshot

Linearly-Homomorphic Signatures and Scalable Mix-Nets

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-92548-2_18openalex-snapshot

Function-Private Conditional Disclosure of Secrets and Multi-evaluation Threshold Distributed Point Functions

inferred← citeshttps://doi.org/10.1007/978-3-319-04268-8_2openalex-snapshot

Secure Two-Party Computation: A Visual Way

inferred← citeshttps://doi.org/10.1007/978-3-319-19713-5_30openalex-snapshot

SW-SSS: Slepian-Wolf Coding-Based Secret Sharing Scheme

inferred← citeshttps://doi.org/10.1007/978-3-319-40415-8_22openalex-snapshot

Finding an Optimal Parameter for Threshold Cryptography

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-63688-7_24openalex-snapshot

Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations

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-319-78375-8_9openalex-snapshot

The Communication Complexity of Private Simultaneous Messages, Revisited

inferred← citeshttps://doi.org/10.1007/978-3-319-78381-9_22openalex-snapshot

Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing

inferred← citeshttps://doi.org/10.1007/978-3-322-90137-8_10openalex-snapshot

Verteiltes Vertrauen durch geteilte Geheimnisse

inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_66openalex-snapshot

Hypergraph Decomposition and Secret Sharing

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-540-70936-7_14openalex-snapshot

Weakly-Private Secret Sharing Schemes

inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_15openalex-snapshot

On Secret Sharing Schemes, Matroids and Polymatroids

inferred← citeshttps://doi.org/10.1007/978-3-540-72540-4_26openalex-snapshot

Ideal Multipartite Secret Sharing Schemes

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

Matroids Can Be Far from Ideal Secret Sharing

inferred← citeshttps://doi.org/10.1007/978-3-540-85093-9_18openalex-snapshot

Revisiting the Karnin, Greene and Hellman Bounds

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-540-85886-7_31openalex-snapshot

A New (k,n)-Threshold Secret Sharing Scheme and Its Extension

inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_32openalex-snapshot

Secret Sharing and Non-Shannon Information Inequalities

inferred← citeshttps://doi.org/10.1007/978-3-642-11799-2_14openalex-snapshot

Ideal Hierarchical Secret Sharing Schemes

inferred← citeshttps://doi.org/10.1007/978-3-642-14496-7_8openalex-snapshot

On the Optimization of Bipartite Secret Sharing Schemes

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-20901-7_6openalex-snapshot

Ideal Secret Sharing Schemes for Useful Multipartite Access Structures

inferred← citeshttps://doi.org/10.1007/978-3-642-21518-6_9openalex-snapshot

On the Combinatorial Approaches of Computing Upper Bounds on the Information Rate of Secret Sharing Schemes

inferred← citeshttps://doi.org/10.1007/978-3-642-25769-8_90openalex-snapshot

The Information Rate of Secret Sharing Schemes on Seven Participants by Connected Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_10openalex-snapshot

Secret Sharing Schemes for Very Dense Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-32284-6_11openalex-snapshot

Optimum General Threshold Secret Sharing

inferred← citeshttps://doi.org/10.1007/978-3-642-40084-1_16openalex-snapshot

Secret Sharing, Rank Inequalities and Information Inequalities

inferred← citeshttps://doi.org/10.1007/978-3-662-44381-1_13openalex-snapshot

Optimal Non-perfect Uniform Secret Sharing Schemes

inferred← citeshttps://doi.org/10.1007/978-3-662-44966-0_14openalex-snapshot

Ideal and Computationally Perfect Secret Sharing Schemes for Generalized Access Structures

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-981-15-0029-9_25openalex-snapshot

QSecret-Sharing Scheme (QSS)-Based Keyless: Titanium Secure (TitaniumSec) EMail Application

inferred← citeshttps://doi.org/10.1007/978-981-96-4273-1_25openalex-snapshot

A Novel (2, 3) Secret Sharing Scheme Using Fundamental Theorem of Arithmetic and Strictly Binary Tree

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

An explication of secret sharing schemes

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

Perfect Secret Sharing Schemes on Five Participants

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

Graph decompositions and secret sharing schemes

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

Lower bounds for monotone span programs

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

A perfect threshold secret sharing scheme to identify cheaters

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

On the information rate of perfect secret sharing schemes

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

Secure distributed computing: Theory and practice

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/bfb0053421openalex-snapshot

A linear construction of perfect secret sharing schemes

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

On the dealer's randomness required in secret sharing schemes

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

On construction of cumulative secret sharing schemes

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

Geometrical contributions to secret sharing theory

inferred← citeshttps://doi.org/10.1007/s00145-007-0327-2openalex-snapshot

On Unconditionally Secure Distributed Oblivious Transfer

inferred← citeshttps://doi.org/10.1007/s00145-011-9101-6openalex-snapshot

Ideal Multipartite Secret Sharing Schemes

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-019-09334-yopenalex-snapshot

The Communication Complexity of Private Simultaneous Messages, Revisited

inferred← citeshttps://doi.org/10.1007/s00145-021-09376-1openalex-snapshot

Placing Conditional Disclosure of Secrets in the Communication Complexity Universe

inferred← citeshttps://doi.org/10.1007/s00145-021-09410-2openalex-snapshot

On Abelian and Homomorphic Secret Sharing Schemes

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/s001459900031openalex-snapshot

Mutually Trusted Authority-Free Secret Sharing Schemes

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

On Matroid Characterization of Ideal Secret Sharing Schemes

inferred← citeshttps://doi.org/10.1007/s00453-016-0217-9openalex-snapshot

On the Information Ratio of Non-perfect Secret Sharing Schemes

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-003-1158-2openalex-snapshot

A General Approach to Robust Web Metering

inferred← citeshttps://doi.org/10.1007/s10623-003-4192-1openalex-snapshot

Secret Sharing Schemes with Three or Four Minimal Qualified Subsets

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-0027-1openalex-snapshot

Secret sharing schemes with partial broadcast channels

inferred← citeshttps://doi.org/10.1007/s10623-008-9264-9openalex-snapshot

Ideal secret sharing schemes whose minimal qualified subsets have at most three participants

inferred← citeshttps://doi.org/10.1007/s10623-009-9304-0openalex-snapshot

An impossibility result on graph secret sharing

inferred← citeshttps://doi.org/10.1007/s10623-010-9446-0openalex-snapshot

Optimal complexity of secret sharing schemes with four minimal qualified subsets

inferred← citeshttps://doi.org/10.1007/s10623-011-9540-yopenalex-snapshot

On-line secret sharing

inferred← citeshttps://doi.org/10.1007/s10623-011-9552-7openalex-snapshot

On the optimization of bipartite secret sharing schemes

inferred← citeshttps://doi.org/10.1007/s10623-011-9592-zopenalex-snapshot

The complexity of the graph access structures on six participants

inferred← citeshttps://doi.org/10.1007/s10623-013-9879-3openalex-snapshot

Optimal assignment schemes for general access structures based on linear programming

inferred← citeshttps://doi.org/10.1007/s11128-014-0863-2openalex-snapshot

Quantum strongly secure ramp secret sharing

inferred← citeshttps://doi.org/10.1007/s11432-015-5286-xopenalex-snapshot

Further ideal multipartite access structures from integer polymatroids

inferred← citeshttps://doi.org/10.1007/s11704-015-3255-6openalex-snapshot

The optimal information rate for graph access structures of nine participants

inferred← citeshttps://doi.org/10.1007/s11704-019-9123-zopenalex-snapshot

A proactive secret sharing scheme based on Chinese remainder theorem

inferred← citeshttps://doi.org/10.1007/s12095-016-0202-9openalex-snapshot

Localised multisecret sharing

inferred← citeshttps://doi.org/10.1016/0020-0190(95)00104-kopenalex-snapshot

A note on dynamic threshold schemes

inferred← citeshttps://doi.org/10.1016/0304-3975(95)00065-8openalex-snapshot

On the information rate of secret sharing schemes

inferred← citeshttps://doi.org/10.1016/0304-3975(96)00003-5openalex-snapshot

Fully dynamic secret sharing schemes

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.amc.2014.10.051openalex-snapshot

A novel group key transfer for big data security

inferred← citeshttps://doi.org/10.1016/j.dam.2005.09.003openalex-snapshot

Secret sharing schemes on access structures with intersection number equal to one

inferred← citeshttps://doi.org/10.1016/j.dam.2008.04.001openalex-snapshot

Hypergraph decomposition and secret sharing

inferred← citeshttps://doi.org/10.1016/j.disc.2011.01.003openalex-snapshot

Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid

inferred← citeshttps://doi.org/10.1016/j.entcs.2007.01.065openalex-snapshot

General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting

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.ipl.2005.09.012openalex-snapshot

Strongly secure ramp secret sharing schemes for general access structures

inferred← citeshttps://doi.org/10.1016/j.ipl.2006.08.016openalex-snapshot

A note on secret sharing schemes with three homogeneous access structure

inferred← citeshttps://doi.org/10.1016/j.jisa.2021.102826openalex-snapshot

Secure cloud-of-clouds storage with space-efficient secret sharing

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

Secure computation without computers

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

Optimal linear secret sharing schemes for graph access structures on six participants

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

Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification

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

On group-characterizability of homomorphic secret sharing schemes

inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00213-2openalex-snapshot

Lower bounds on the information rate of secret sharing schemes with homogeneous access structure

inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00086-0openalex-snapshot

More information theoretical inequalities to be used in secret sharing?

inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00194-4openalex-snapshot

On 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.1016/s0020-0255(98)10101-9openalex-snapshot

A lower bound on the encoding length in lossy transmission

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/s0166-218x(97)89208-6openalex-snapshot

Anonymous 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/s0304-3975(97)00098-4openalex-snapshot

General information dispersal algorithms

inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00056-7openalex-snapshot

On identification secret sharing schemes

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:1008216403325openalex-snapshot

Tight Bounds on the Information Rate of 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.1023/a:1008259214236openalex-snapshot

A Linear Construction of Secret Sharing Schemes

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

Unconditionally Secure Group Authentication

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

Detection of Cheaters in Vector Space Secret Sharing Schemes

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

A General Decomposition Construction for Incomplete Secret Sharing Schemes

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.1093/ietfec/e91-a.1.127openalex-snapshot

A Fast (3,n)-Threshold Secret Sharing Scheme Using Exclusive-OR Operations

inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.8.2138openalex-snapshot

On Increasing the Number of Users in (t, n) Threshold Secret Sharing Schemes

inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.9.2365openalex-snapshot

On a Fast (k,n)-Threshold Secret Sharing Scheme

inferred← citeshttps://doi.org/10.1103/physreva.83.042303openalex-snapshot

Entropic inequalities for a class of quantum secret-sharing states

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

Decomposition constructions for secret-sharing schemes

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

Universally ideal secret-sharing schemes

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

New bounds on the information rate of secret sharing schemes

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.887867openalex-snapshot

Secret sharing schemes with bipartite access structure

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

Verifiable Secret Sharing Scheme Using Hash Values

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

On the power of nonlinear secret-sharing

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

Optimal Information Rates of Novel Graph Based Access Structures

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/iscc.2018.8538542openalex-snapshot

Secret Sharing Schemes with Hidden Sets

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

On the information rate of perfect secret sharing schemes

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

Lower bounds in secret sharing schemes

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

Information theoretical lower bounds for unconditionally secure group authentication

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

Ideal perfect threshold schemes and MDS codes

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

Strongly secure ramp secret sharing schemes

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

Almost-perfect secret sharing

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

Secret sharing schemes based on min-entropies

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

Symmetries in Linear Programming for Information Inequalities

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

Efficient secret sharing schemes achieving optimal information rate

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

On the Size of a Share for Non-perfect Secret Sharing Schemes

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

Coding theorems on the threshold scheme for a general source

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

Application of Partial MDS Codes to Secret Sharing Schemes

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

Multiplicative Partially Homomorphic CRT Secret Sharing : (Preliminary Version)

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

Lower bounds for monotone span programs

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

On the Optimal Communication Complexity of Multiphase Protocols for Perfect Communication

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/tcomm.2020.3005430openalex-snapshot

Compartmented Secret Sharing Schemes and Locally Repairable Codes

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

Improved Protocols for Distributed Secret Sharing

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

Bounds and Protocols for Graph-Based Distributed Secret Sharing

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.1109/tifs.2015.2512533openalex-snapshot

Hierarchical and Shared Access Control

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

Secret Sharing With Public Reconstruction

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

On Secret Reconstruction in Secret Sharing Schemes

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

On Matroids and Nonideal Secret Sharing

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

Secret Sharing and Non-Shannon Information Inequalities

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

Ideal Hierarchical Secret Sharing Schemes

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

Optimal Information Rate of Secret Sharing Schemes on Trees

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

Conditional Information Inequalities for Entropic and Almost Entropic Points

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

Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes

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

Secret Sharing, Rank Inequalities, and Information Inequalities

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

Communication Efficient Secret Sharing

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

Improved Constructions of Nested Code Pairs

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

Optimal Uniform Secret Sharing

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

Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing

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

Linear Secret-Sharing Schemes for Forbidden Graph Access Structures

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

Partial Secret Sharing Schemes

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

Secure Distributed Storage: Optimal Trade-Off Between Storage Rate and Privacy Leakage

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

A General Coding Framework for Adaptive Private Information Retrieval

showing the first 200 of 237 · page through all 237

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.