On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes

IEEE Transactions on Information Theory - Tập 54 Số 6 - Trang 2644-2657 - 2008
Ronald Cramer1, Vanesa Daza2, Ignacio Gracia3, Jorge Jim3, Gregor Leander4, Jaume Martí-Farré3, Carles Padró3
1Mathematical Institute, Leiden University, Leiden, Netherlands
2Universitat Rovira i Virgili, Tarragona, Spain
3Universitat Poliltècnica de Catalunya, Barcelona, Spain
4Horst-Gortz Institute for IT-Security, Ruhr University of Bochum, Bochum, Germany

Tóm tắt

Từ khóa


Tài liệu tham khảo

10.1007/BF00125203

10.1023/A:1008244215660

simmons, 1991, Contemporary Cryptology The Science Of Information Integrity, 441

10.1145/359168.359176

welsh, 1976, Matroid Theory

10.1007/978-3-540-24638-1_26

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

10.1002/ecjc.4430720906

10.1007/BF01388562

10.1109/SCT.1993.336536

kunz, 1985, Introduction to Commutative Algebra and Algebraic Geometry

10.1016/0012-365X(92)90567-Y

10.1145/62212.62213

10.1109/18.887867

beimel, 0, Characterizing ideal weighted threshold secret sharing, Proc 2nd Theory of Cryptography Conference TCC 2005 (Lecture Notes in Computer Science), 3378, 600

10.1007/BF00196772

10.4153/CJM-2000-043-5

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

britz, 2002, MacWilliams identities and matroid polynomials, Electron J Combin, 9, 10.37236/1636

10.1007/11681878_25

10.1137/S0895480199364148

10.1145/237814.238015

10.1016/j.dam.2005.09.003

10.1016/S0012-365X(99)00004-7

10.1007/978-3-540-70936-7_15

10.1023/A:1011225330458

ng, 2003, A representation of a family of secret sharing matroids, Des Codes Cryptogr, 30, 5, 10.1023/A:1024741108241

10.1137/05064309X

oxley, 1992, Matroid Theory