Constructions for anonymous secret sharing schemes using combinatorial designs

DOI10.1007/s10255-006-0350-3zbMath1118.94004OpenAlexW2009051386MaRDI QIDQ871669

Lifeng Guo, Yingpu Deng, Mu-Lan Liu

Publication date: 20 March 2007

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-006-0350-3

zbMATH Keywords

Steiner systemsrelative difference setsdifference familiesgroup divisible designsanonymous secret sharing schemes

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

Partitions of the lines in \(\mathrm{PG}( 2 n - 1, s)\) into multifold spreads for \(s = 3, 4\) ⋮ Extremal properties of \(t\)-SEEDs and recursive constructions ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ A decomposition of the 2-design formed by the planes in \(AG(2n, 3)\)

Cites Work

• Unnamed Item
• Some improved bounds on the information rate of perfect secret sharing schemes
• Strongly ideal secret sharing schemes
• Anonymous secret sharing schemes
• On the bound for anonymous secret sharing schemes
• Finite geometry and character theory
• A Combinatorial Approach to Threshold Schemes

This page was built for publication: Constructions for anonymous secret sharing schemes using combinatorial designs