Anonymous secret sharing schemes
From MaRDI portal
Publication:1364776
DOI10.1016/S0166-218X(97)89208-6zbMath0943.94009OpenAlexW2090759086MaRDI QIDQ1364776
Carlo Blundo, Douglas R. Stinson
Publication date: 5 September 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(97)89208-6
Related Items
On the bound for anonymous secret sharing schemes, On ASGS framework: general requirements and an example of implementation, Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures, Constructions for anonymous secret sharing schemes using combinatorial designs, Partitions of the lines in \(\mathrm{PG}( 2 n - 1, s)\) into multifold spreads for \(s = 3, 4\), Sharing one secret vs. sharing many secrets., A verifiable threshold secret sharing scheme based on lattices, Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification, On the information rate of secret sharing schemes, A decomposition of the 2-design formed by the planes in \(AG(2n, 3)\), On cryptographic anonymity and unpredictability in secret sharing
Cites Work
- On the classification of ideal secret sharing schemes
- Some improved bounds on the information rate of perfect secret sharing schemes
- Strongly ideal secret sharing schemes
- An explication of secret sharing schemes
- On the size of shares for secret sharing schemes
- Graph decompositions and secret sharing schemes
- On resolvable designs
- How to share a secret
- A Combinatorial Approach to Threshold Schemes
- Decomposition constructions for secret-sharing schemes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
