Constructions for anonymous secret sharing schemes using combinatorial designs
From MaRDI portal
Publication:871669
Recommendations
Cites work
- scientific article; zbMATH DE number 774344 (Why is no real title available?)
- A Combinatorial Approach to Threshold Schemes
- Anonymous secret sharing schemes
- Finite geometry and character theory
- On the bound for anonymous secret sharing schemes
- Some improved bounds on the information rate of perfect secret sharing schemes
- Strongly ideal secret sharing schemes
Cited in
(7)- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- On the bound for anonymous secret sharing schemes
- Extremal properties of \(t\)-SEEDs and recursive constructions
- Providing anonymity in unconditionally secure secret sharing schemes
- A decomposition of the 2-design formed by the planes in \(AG(2n, 3)\)
- scientific article; zbMATH DE number 2149833 (Why is no real title available?)
- Partitions of the lines in \(\mathrm{PG}( 2 n - 1, s)\) into multifold spreads for \(s = 3, 4\)
This page was built for publication: Constructions for anonymous secret sharing schemes using combinatorial designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q871669)