On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
Tóm tắt
Từ khóa
Tài liệu tham khảo
simmons, 1991, Contemporary Cryptology The Science Of Information Integrity, 441
welsh, 1976, Matroid Theory
chaum, 1988, Multi-party unconditionally secure protocols, Proc ACM Symp Theory of Computing (STOC 1988), 11
cramer, 2000, General secure multi-party computation from any linear secret-sharing scheme, Advances in Cryptology CRYPTO 2000 (Lecture Notes in Computer Science), 1807, 316
duursma, 2004, Finite Fields and Applications (Lecture Notes in Computer Science), 2948, 109, 10.1007/978-3-540-24633-6_9
goldreich, 1987, How to play any mental game or a completeness theorem for protocols with honest majority, Proc ACM Symp Theory of Computing (STOC 1987), 218
greene, 1976, Weight enumeration and the geometry of linear codes, Studies in Appl Math, 55, 119, 10.1002/sapm1976552119
hirt, 1997, Complete characterization of adversaries tolerable in secure multi-party computation, Proc 1997 PODC, 25
kunz, 1985, Introduction to Commutative Algebra and Algebraic Geometry
beimel, 0, Characterizing ideal weighted threshold secret sharing, Proc 2nd Theory of Cryptography Conference TCC 2005 (Lecture Notes in Computer Science), 3378, 600
brickell, 1989, Some ideal secret sharing schemes, J Combin Math Combin Comput, 9, 105
cameron, 2002, Cycle index, weight enumerator, and Tutte polynomial, Electron J Combin, 9, 10.37236/1663
ng, 2003, A representation of a family of secret sharing matroids, Des Codes Cryptogr, 30, 5, 10.1023/A:1024741108241
oxley, 1992, Matroid Theory