On the public citation graph
Lower bounds for monotone span programs
0 signed · 89 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.
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.
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.1007/0-387-34799-2_3openalex-snapshot
Generalized Secret Sharing and Monotone Functions
inferredcites →https://doi.org/10.1007/0-387-34799-2_30openalex-snapshot
How to (Really) Share a Secret
inferredcites →https://doi.org/10.1007/3-540-18170-9_185openalex-snapshot
The complexity of symmetric boolean functions
inferredcites →https://doi.org/10.1007/3-540-38424-3_16openalex-snapshot
Geometric Shared Secret and/or Shared Control Schemes
inferredcites →https://doi.org/10.1007/3-540-39568-7_19openalex-snapshot
Generalized Linear Threshold Scheme
inferredcites →https://doi.org/10.1007/3-540-57220-1_53openalex-snapshot
A construction of practical secret sharing schemes using linear block codes
inferredcites →https://doi.org/10.1007/978-1-4612-2566-9_8openalex-snapshot
On Proving Lower Bounds for Circuit Size
inferredcites →https://doi.org/10.1007/bf00125203openalex-snapshot
An explication of 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/bf00198463openalex-snapshot
On the size of shares for secret sharing schemes
inferredcites →https://doi.org/10.1007/bf01374526openalex-snapshot
Structure and importance of logspace-MOD class
inferredcites →https://doi.org/10.1007/bf01388562openalex-snapshot
Geometric secret sharing schemes and their duals
inferredcites →https://doi.org/10.1007/bf01398012openalex-snapshot
On the information rate of perfect secret sharing schemes
inferredcites →https://doi.org/10.1007/bf02579196openalex-snapshot
The monotone circuit complexity of boolean functions
inferredcites →https://doi.org/10.1007/bf02579205openalex-snapshot
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
inferredcites →https://doi.org/10.1007/bfb0053421openalex-snapshot
A linear construction of perfect secret sharing schemes
inferredcites →https://doi.org/10.1016/0020-0190(84)90018-8openalex-snapshot
On computing the determinant in small parallel time using a small number of processors
inferredcites →https://doi.org/10.1016/0304-3975(80)90034-1openalex-snapshot
On another Boolean matrix
inferredcites →https://doi.org/10.1016/0304-3975(95)00065-8openalex-snapshot
On the information rate of secret sharing schemes
inferredcites →https://doi.org/10.1109/18.335890openalex-snapshot
Universally ideal secret-sharing schemes
inferredcites →https://doi.org/10.1109/mark.1979.8817296openalex-snapshot
Safeguarding cryptographic keys
inferredcites →https://doi.org/10.1109/sct.1993.336535openalex-snapshot
On proving lower bounds for circuit size
inferredcites →https://doi.org/10.1109/sfcs.1995.492669openalex-snapshot
Lower bounds for monotone span programs
inferredcites →https://doi.org/10.1145/237814.238010openalex-snapshot
Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs
inferredcites →https://doi.org/10.7146/brics.v1i46.21596openalex-snapshot
Lower Bounds for Monotone Span Programs
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.1507openalex-snapshot
CP‐ABE with outsourced decryption and directionally hidden policy
inferred← citeshttps://doi.org/10.1006/jcss.1999.1648openalex-snapshot
On Arithmetic Branching Programs
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/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-84252-9_25openalex-snapshot
Quadratic Secret Sharing and Conditional Disclosure of Secrets
inferred← citeshttps://doi.org/10.1007/978-3-319-26059-4_21openalex-snapshot
Attribute-Based Encryption Resilient to Auxiliary Input
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-67816-0_9openalex-snapshot
Threshold Single Password Authentication
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-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-540-30598-9_18openalex-snapshot
On the Size of Monotone Span Programs
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-32009-5_10openalex-snapshot
Secret Sharing Schemes for Very Dense Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-38033-4_6openalex-snapshot
Leakage-Resilient Attribute-Based Encryption with Fast Decryption: Models, Analysis and Constructions
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-53644-5_18openalex-snapshot
Threshold Secret Sharing Requires a Linear Size Alphabet
inferred← citeshttps://doi.org/10.1007/978-981-15-8061-1_15openalex-snapshot
Linear Secret Sharing Schemes with Finer Access Structure
inferred← citeshttps://doi.org/10.1007/s000370100001openalex-snapshot
A characterization of span program size and improved lower bounds for monotone span programs
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-021-09410-2openalex-snapshot
On Abelian and Homomorphic Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/s004930050058openalex-snapshot
Superpolynomial Lower Bounds for Monotone Span Programs
inferred← citeshttps://doi.org/10.1007/s10623-004-4031-zopenalex-snapshot
An Optimal Multisecret Threshold Scheme Construction
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/s0020-0190(03)00334-xopenalex-snapshot
A note on monotone complexity and the rank of matrices
inferred← citeshttps://doi.org/10.1080/02522667.2017.1367513openalex-snapshot
On the information rates of homomorphic secret sharing schemes
inferred← citeshttps://doi.org/10.1090/dimacs/039/15openalex-snapshot
Algebraic models of computation and interpolation for algebraic proof systems
inferred← citeshttps://doi.org/10.1090/s0894-0347-01-00367-8openalex-snapshot
On the number of zero-patterns of a sequence of polynomials
inferred← citeshttps://doi.org/10.1109/ccc.1998.694592openalex-snapshot
On arithmetic branching programs
inferred← citeshttps://doi.org/10.1109/ccc.2001.933886openalex-snapshot
On the power of nonlinear secret-sharing
inferred← citeshttps://doi.org/10.1109/focs.2009.15openalex-snapshot
The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection
inferred← citeshttps://doi.org/10.1109/focs.2016.51openalex-snapshot
Exponential Lower Bounds for Monotone Span Programs
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/tit.2015.2500232openalex-snapshot
Secret Sharing, Rank Inequalities, and Information Inequalities
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.3296588openalex-snapshot
Quadratic Secret Sharing and Conditional Disclosure of Secrets
inferred← citeshttps://doi.org/10.1137/s0097539704444038openalex-snapshot
Separating the Power of Monotone Span Programs over Different Fields
inferred← citeshttps://doi.org/10.1137/s0895480102412868openalex-snapshot
On the Power of Nonlinear Secret-Sharing
inferred← citeshttps://doi.org/10.1145/1374376.1374394openalex-snapshot
Span-program-based quantum algorithm for evaluating formulas
inferred← citeshttps://doi.org/10.1145/276698.276855openalex-snapshot
A characterization of span program size and improved lower bounds for monotone span programs
inferred← citeshttps://doi.org/10.1145/3055399.3055478openalex-snapshot
Strongly exponential lower bounds for monotone computation
inferred← citeshttps://doi.org/10.1145/3188745.3188914openalex-snapshot
Lifting Nullstellensatz to monotone span programs over any field
inferred← citeshttps://doi.org/10.1145/3717823.3718161openalex-snapshot
The Meta-complexity of Secret Sharing
inferred← citeshttps://doi.org/10.1155/2016/3257029openalex-snapshot
CP-ABE with Hidden Policy from Waters Efficient Construction
inferred← citeshttps://doi.org/10.12988/ams.2015.57478openalex-snapshot
Linear secret sharing and the automatic search of linear rank inequalities
inferred← citeshttps://doi.org/10.1561/0400000011openalex-snapshot
Complexity Lower Bounds using Linear Algebra
inferred← citeshttps://doi.org/10.32657/10356/59108openalex-snapshot
Secret sharing schemes and polymatroids
inferred← citeshttps://doi.org/10.48550/arxiv.2106.14833openalex-snapshot
Linear Secret-Sharing Schemes for $k$-uniform access structures
inferred← citeshttps://doi.org/10.56415/csjm.v33.06openalex-snapshot
Secret Sharing Limitations Over Boolean Circuits
inferred← citeshttps://doi.org/10.7146/brics.v1i47.21595openalex-snapshot
A Constraint Oriented Proof Methodology based on Modal Transition Systems
inferred← citeshttps://doi.org/10.7146/brics.v2i4.19506openalex-snapshot
Petri Nets and Bisimulations
inferred← citeshttps://doi.org/10.7146/brics.v2i6.19508openalex-snapshot
A Complete Deductive System for the mu-Calculus
inferred← citeshttps://doi.org/10.7146/brics.v2i9.19512openalex-snapshot
Partial and Higher Order Differentials and Applications to the DES
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.