On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
From MaRDI portal
Publication:3604694
DOI10.1109/TIT.2008.921692zbMath1184.94252OpenAlexW2101288164MaRDI QIDQ3604694
Carles Padró, Ignacio Gracia, Jaume Martí-Farré, Ronald Cramer, Vanesa Daza, Jorge Jiménez-Urroz, Gregor Leander
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2008.921692
Combinatorial aspects of matroids and geometric lattices (05B35) Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62)
Related Items (14)
New families of self-dual codes ⋮ Some new constructions of MDS self-dual codes over finite fields ⋮ On Euclidean self-dual codes and isometry codes ⋮ New MDS self-dual codes over finite fields of odd characteristic ⋮ New constructions of self-dual generalized Reed-Solomon codes ⋮ Generic constructions of MDS Euclidean self-dual codes via GRS codes ⋮ New MDS self-dual codes from GRS codes and extended GRS codes ⋮ On matroids from self-orthogonal codes and their properties ⋮ A note on the constructions of MDS self-dual codes ⋮ MDS or NMDS self-dual codes from twisted generalized Reed-Solomon codes ⋮ Extending Brickell-Davenport theorem to non-perfect secret sharing schemes ⋮ Secret sharing schemes based on graphical codes ⋮ Construction of MDS self-dual codes over finite fields ⋮ New \((k,l,m)\)-verifiable multi-secret sharing schemes based on XTR public key system
This page was built for publication: On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
