Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures

An error decodable secret-sharing scheme is a secret-sharing scheme with the additional property that the secret can be recovered from the set of all shares, even after a coalition of participants corrupts the shares they possess. In this paper, schemes that can tolerate corruption by sets of participants belonging to a monotone coalition structure are considered. This coalition structure may be unrelated to the authorised sets of the secret-sharing scheme. This is generalisation of both a related notion studied in the context of multiparty computation, and the well-known error-correction properties of threshold schemes based on Reed-Solomon codes. Necessary and sufficient conditions for the existence of such schemes are deduced, and methods for reducing the storage requirements of a technique of Kurosawa for constructing error-decodable secret-sharing schemes with efficient decoding algorithms are demonstrated. In addition, the connection between one-round perfectly secure message transmission (PSMT) schemes with general adversary structures and secret-sharing schemes is explored. We prove a theorem that explicitly shows the relation between these structures. In particular, an error decodable secret-sharing scheme yields a one-round PSMT, but the converse does not hold. Furthermore, we are able to show that some well-known results concerning one-round PSMT follow from known results on secret-sharing schemes. These connections are exploited to investigate factors affecting the performance of one-round PSMT schemes such as the number of channels required, the communication overhead, and the efficiency of message recovery.

[1]  Yvo Desmedt,et al.  Perfectly Secure Message Transmission , 2011, Encyclopedia of Cryptography and Security.

[2]  Keith M. Martin.  Challenging the adversary model in secret sharing schemes , 2007 .

[3]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[4]  Elwyn R. Berlekamp,et al.  On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[5]  Raylin Tso,et al.  A New Algorithm for Searching a Consistent Set of Shares in a Threshold Scheme with Cheaters , 2003, ICISC.

[6]  Carles Padró,et al.  On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes , 2005, IEEE Transactions on Information Theory.

[7]  Moti Yung,et al.  Perfectly secure message transmission , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[8]  Keith M. Martin,et al.  A combinatorial interpretation of ramp schemes , 1996, Australas. J Comb..

[9]  Matthias Fitzi,et al.  General Adversaries in Unconditional Multi-party Computation , 1999, ASIACRYPT.

[10]  Ueli Maurer,et al.  Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks , 2002, CRYPTO.

[11]  Mihir Bellare,et al.  Robust computational secret sharing and a unified account of classical secret-sharing goals , 2007, CCS '07.

[12]  Keith M. Martin,et al.  Cumulative Arrays and Geometric Secret Sharing Schemes , 1992, AUSCRYPT.

[13]  Yongge Wang,et al.  A Complete Characterization of Tolerable Adversary Structures for Secure Point-to-Point Transmissions Without Feedback , 2005, ISAAC.

[14]  Alfredo De Santis,et al.  Efficient Sharing of Many Secrets , 1993, STACS.

[15]  Yeow Meng Chee,et al.  Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes , 2008, ASIACRYPT.

[16]  Kaoru Kurosawa,et al.  Optimum Secret Sharing Scheme Secure against Cheating , 1996, EUROCRYPT.

[17]  Douglas R. Stinson,et al.  An application of covering designs: determining the maximum consistent set of shares in a threshold scheme , 1999, Ars Comb..

[18]  R. J. McEliece,et al.  On sharing secrets and Reed-Solomon codes , 1981, CACM.

[19]  Mitsuru Ito,et al.  Multiple assignment scheme for sharing secret , 1993, Journal of Cryptology.

[20]  Matthias Fitzi,et al.  Towards Optimal and Efficient Perfectly Secure Message Transmission , 2007, TCC.

[21]  Satoshi Obana,et al.  t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes , 1995, CRYPTO.

[22]  Hao Chen,et al.  Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields , 2006, CRYPTO.

[23]  Ueli Maurer,et al.  Secure multi-party computation made simple , 2002, Discret. Appl. Math..

[24]  Ueli Maurer,et al.  General Secure Multi-party Computation from any Linear Secret-Sharing Scheme , 2000, EUROCRYPT.

[25]  Satoshi Obana,et al.  Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution , 2006, ASIACRYPT.

[26]  Ueli Maurer,et al.  Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract) , 1997, PODC '97.

[27]  Kaoru Kurosawa.  General Error Decodable Secret Sharing Scheme and Its Application , 2011, IEEE Transactions on Information Theory.

[28]  Ueli Maurer,et al.  Player Simulation and General Adversary Structures in Perfect Multiparty Computation , 2000, Journal of Cryptology.

[29]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[30]  W. Cary Huffman,et al.  Fundamentals of Error-Correcting Codes , 1975 .

[31]  Ron Steinfeld,et al.  Efficient Fuzzy Matching and Intersection on Private Datasets , 2009, ICISC.

[32]  Baruch Awerbuch,et al.  Verifiable secret sharing and achieving simultaneity in the presence of faults , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).