On abelian and homomorphic secret sharing schemes
From MaRDI portal
Publication:2051370
DOI10.1007/s00145-021-09410-2zbMath1479.94191OpenAlexW3199209578WikidataQ122583929 ScholiaQ122583929MaRDI QIDQ2051370
Publication date: 24 November 2021
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-021-09410-2
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ideal multipartite secret sharing schemes
- Lower bounds for monotone span programs
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
- A note on monotone complexity and the rank of matrices
- Secret sharing schemes for graph-based prohibited structures
- On the classification of ideal secret sharing schemes
- On secret-sharing matroids
- A general decomposition construction for incomplete secret sharing schemes
- Ideal homomorphic secret sharing schemes over cyclic groups
- On the size of shares for secret sharing schemes
- Geometric secret sharing schemes and their duals
- The size of a share must be large
- Almost affine codes
- Inequalities for Shannon entropy and Kolmogorov complexity
- On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate
- The complexity of multiparty PSM protocols and related models
- Conditional disclosure of secrets via non-linear reconstruction
- On the information ratio of non-perfect secret sharing schemes
- Linear secret-sharing schemes for forbidden graph access structures
- Superpolynomial lower bounds for monotone span programs
- On ideal homomorphic secret sharing schemes and their decomposition
- Secret sharing and duality
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes
- Secret sharing lower bound: either reconstruction is hard or shares are long
- Common information, matroid representation, and secret sharing for matroid ports
- Secret-sharing schemes for general and uniform access structures
- Adhesivity of polymatroids
- Secret sharing schemes on access structures with intersection number equal to one
- A new class of non-Shannon-type inequalities for entropies
- Applications of matrix methods to the theory of lower bounds in computational complexity
- Secret sharing schemes with bipartite access structure
- Secret Sharing and Statistical Zero Knowledge
- Entropy Region and Convolution
- Characteristic-Dependent Linear Rank Inequalities With Applications to Network Coding
- Book Inequalities
- Secret-Sharing Schemes: A Survey
- How to share a secret
- Network Information Theory
- Networks, Matroids, and Non-Shannon Information Inequalities
- Two Constructions on Limits of Entropy Functions
- On Matroids and Nonideal Secret Sharing
- Polymatroidal dependence structure of a set of random variables
- Decomposition constructions for secret-sharing schemes
- Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group
- A non-Shannon-type conditional inequality of information quantities
- On a relation between information inequalities and group theory
- On characterization of entropy function via information inequalities
- On secret sharing systems
- Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing
- Breaking the circuit-size barrier in secret sharing
- Lifting Nullstellensatz to monotone span programs over any field
- Separating the Power of Monotone Span Programs over Different Fields
- On the Power of Nonlinear Secret-Sharing
- Information Inequalities are Not Closed Under Polymatroid Duality
- Matroids Can Be Far from Ideal Secret Sharing
- Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
- Lexicographic Products and the Power of Non-linear Network Coding
- Multi-linear Secret-Sharing Schemes
- Information Theory
- Information Security and Cryptology
