On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes

DOI10.1007/11535218_20MaRDI QIDQ5451034zbMATH OpenOpenAlexFDO

Authors Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge Jiménez Urroz, Gregor Leander, Jaume Martí-Farré, Carles Padró

Publication date 17 March 2008

Published in Advances in Cryptology – CRYPTO 2005 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11535218_20

zbMATH Keywords

efficient error correctionidentically self-dual matroidsmulti-party computationmultiplicative linear secret sharing schemesself-dual codes

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Authentication, digital signatures and secret sharing (94A62) Linear codes (general theory) (94B05)

Recommendations

• On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
• On secret sharing schemes, matroids and polymatroids
• On Secret Sharing Schemes, Matroids and Polymatroids
• Linear multi-secret sharing schemes based on multi-party computation
• On the composition of matroids and ideal secret sharing schemes
• Progress in Cryptology - INDOCRYPT 2003
• On secret-sharing matroids
• Generalized ideal secret-sharing schemes and matroids
• Secret sharing schemes from linear codes over F_p + v F_p
• Theory of Cryptography

Cited in

(12)

• Algebraic geometric codes with applications
• Efficient explicit constructions of compartmented secret sharing schemes
• Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
• On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
• Representing Small Identically Self‐Dual Matroids by Self‐Dual Codes
• Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
• Ideal uniform multipartite secret sharing schemes
• Coset bounds for algebraic geometric codes
• Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
• How to expand a self-orthogonal code
• A generic construction on self-orthogonal algebraic geometric codes and its applications
• Error-correcting codes and cryptography

This page was built for publication: On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes

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