Constructions for anonymous secret sharing schemes using combinatorial designs

DOI10.1007/S10255-006-0350-3zbMATH Open1118.94004OpenAlexW2009051386MaRDI QIDQ871669FDOQ871669

Lifeng Guo, Mu-Lan Liu, Yingpu Deng

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

relative difference setsSteiner systemsdifference familiesgroup divisible designsanonymous secret sharing schemes

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Finite geometry and character theory
• Some improved bounds on the information rate of perfect secret sharing schemes
• A Combinatorial Approach to Threshold Schemes
• Anonymous secret sharing schemes
• Strongly ideal secret sharing schemes
• On the bound for anonymous secret sharing schemes

Cited In (5)

• 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)\)
• Partitions of the lines in \(\mathrm{PG}( 2 n - 1, s)\) into multifold spreads for \(s = 3, 4\)
• Providing anonymity in unconditionally secure secret sharing schemes

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)