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

DOI10.1007/11535218_20zbMath1145.94462OpenAlexW1572181357MaRDI QIDQ5451034

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

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

self-dual codesmulti-party computationmultiplicative linear secret sharing schemesefficient error correctionidentically self-dual matroids

Mathematics Subject Classification ID

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

Related Items

Coset bounds for algebraic geometric codes ⋮ Ideal uniform multipartite secret sharing schemes ⋮ Algebraic geometric codes with applications ⋮ Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures ⋮ Error-correcting codes and cryptography ⋮ Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes ⋮ Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves ⋮ Efficient explicit constructions of compartmented secret sharing schemes