On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
DOI10.1007/11535218_20zbMATH Open1145.94462OpenAlexW1572181357MaRDI QIDQ5451034FDOQ5451034
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
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 \(\mathbb F_p + v \mathbb F_p\)
- Theory of Cryptography
self-dual codesmulti-party computationmultiplicative linear secret sharing schemesefficient error correctionidentically self-dual matroids
Combinatorial aspects of matroids and geometric lattices (05B35) Linear codes (general theory) (94B05) Authentication, digital signatures and secret sharing (94A62)
Cited In (10)
- Coset bounds for algebraic geometric codes
- Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
- Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
- Ideal uniform multipartite secret sharing schemes
- Efficient explicit constructions of compartmented secret sharing schemes
- On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
- Algebraic geometric codes with applications
- Error-correcting codes and cryptography
- Representing Small Identically Self‐Dual Matroids by Self‐Dual Codes
- Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
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)
