Construction of a monotone span program with multiplication

MaRDI QIDQ4926982zbMATH OpenFDO

Authors Yuenai Chen, Chun-Ming Tang

Publication date 20 June 2013

zbMATH Keywords

linear codesecure multiparty computationmonotone span program

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Linear codes (general theory) (94B05)

Recommendations

• An efficient construction of dual monotone span programs
• Security in Communication Networks
• Progress in Cryptology - INDOCRYPT 2003
• Lower bounds for monotone span programs
• Separating the Power of Monotone Span Programs over Different Fields

Cited in

(6)

• Efficient integer span program for hierarchical threshold access structure
• Lower bounds for monotone span programs
• An efficient construction of dual monotone span programs
• Error detection in monotone span programs with application to communication-efficient multi-party computation
• Superpolynomial lower bounds for monotone span programs
• A characterization of span program size and improved lower bounds for monotone span programs

This page was built for publication: Construction of a monotone span program with multiplication

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