An efficient construction of dual monotone span programs

zbMATH Open1249.94047MaRDI QIDQ2885641FDOQ2885641

Ying Gao

Publication date: 1 June 2012

Published in: Journal of Systems Science and Mathematical Sciences (Search for Journal in Brave)

Recommendations

• Security in Communication Networks
• Construction of a monotone span program with multiplication
• Linear multi-secret sharing schemes
• Separating the Power of Monotone Span Programs over Different Fields
• Progress in Cryptology - INDOCRYPT 2003

zbMATH Keywords

dual codeslinear codeslinear secret sharing schemesmonotone span program

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Authentication, digital signatures and secret sharing (94A62)

Cited In (5)

• Lower bounds for monotone span programs
• Superpolynomial lower bounds for monotone span programs
• Separating the Power of Monotone Span Programs over Different Fields
• Security in Communication Networks
• A characterization of span program size and improved lower bounds for monotone span programs

This page was built for publication: An efficient construction of dual monotone span programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2885641)