On the Information Ratio of Non-perfect Secret Sharing Schemes
暂无分享,去创建一个
Carles Padró | Oriol Farràs | Tarik Kaced | Torben Brandt Hansen | Tarik Kaced | O. Farràs | Carles Padró
[1] Thomas M. Cover,et al. Elements of information theory (2. ed.) , 2006 .
[2] S. Tsujii,et al. Nonperfect Secret Sharing Schemes , 1992, AUSCRYPT.
[3] Bi Kai. OPTIMAL INFORMATION RATE OF SECRET SHARING SCHEMES ON TREES , 2002 .
[4] Ehud D. Karnin,et al. On secret sharing systems , 1983, IEEE Trans. Inf. Theory.
[5] Carles Padró,et al. A Note on Non-Perfect Secret Sharing , 2016, IACR Cryptol. ePrint Arch..
[6] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[7] David Chaum,et al. Multiparty Unconditionally Secure Protocols (Extended Abstract) , 1988, STOC.
[8] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[9] Catherine A. Meadows,et al. Security of Ramp Schemes , 1985, CRYPTO.
[10] Matthew K. Franklin,et al. Communication complexity of secure computation (extended abstract) , 1992, STOC '92.
[11] Toru Fujiwara,et al. Secure Construction for Nonlinear Function Threshold Ramp Secret Sharing , 2007, 2007 IEEE International Symposium on Information Theory.
[12] Jaume Martí Farré,et al. On secret sharing schemes, matroids and polymatroids , 2010 .
[13] Amos Beimel,et al. Secret-Sharing Schemes: A Survey , 2011, IWCC.
[14] Keith M. Martin,et al. Geometric secret sharing schemes and their duals , 1994, Des. Codes Cryptogr..
[15] 岡田 光司,et al. Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes , 1995 .
[16] Carles Padró,et al. Extending Brickell–Davenport theorem to non-perfect secret sharing schemes , 2013, Designs, Codes and Cryptography.
[17] Yvo Desmedt,et al. Threshold cryptography , 1994, Eur. Trans. Telecommun..
[18] Amos Beimel,et al. Secret-Sharing Schemes for Very Dense Graphs , 2014, Journal of Cryptology.
[19] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[20] Ueli Maurer,et al. General Secure Multi-party Computation from any Linear Secret-Sharing Scheme , 2000, EUROCRYPT.
[21] Ernest F. Brickell,et al. Some Ideal Secret Sharing Schemes , 1990, EUROCRYPT.
[22] James L. Massey,et al. Minimal Codewords and Secret Sharing , 1999 .
[23] Carles Padró,et al. Optimal Non-perfect Uniform Secret Sharing Schemes , 2014, CRYPTO.
[24] Alfredo De Santis,et al. On the Size of Shares for Secret Sharing Schemes , 1991, CRYPTO.
[25] Kaoru Kurosawa,et al. Nonperfect Secret Sharing Schemes and Matroids , 1994, EUROCRYPT.
[26] Ignacio Cascudo,et al. Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves , 2008, EUROCRYPT.
[27] Ilan Komargodski,et al. Threshold Secret Sharing Requires a Linear Size Alphabet , 2016, TCC.
[28] Yuval Ishai,et al. Lossy Chains and Fractional Secret Sharing , 2013, STACS.
[29] Suresh C. Kothari,et al. Generalized Linear Threshold Scheme , 1985, CRYPTO.
[30] Ignacio Cascudo,et al. Bounds on the Threshold Gap in Secret Sharing and its Applications , 2013, IEEE Transactions on Information Theory.
[31] Ernest F. Brickell,et al. On the classification of ideal secret sharing schemes , 1989, Journal of Cryptology.
[32] Amos Beimel,et al. Secret Sharing Schemes for Very Dense Graphs , 2012, CRYPTO.
[33] Carles Padró,et al. Secret Sharing, Rank Inequalities and Information Inequalities , 2013, CRYPTO.
[34] Amos Beimel,et al. Secret Sharing and Non-Shannon Information Inequalities , 2011, IEEE Transactions on Information Theory.
[35] Toru Fujiwara,et al. Optimum General Threshold Secret Sharing , 2012, ICITS.
[36] Kaoru Kurosawa,et al. Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes , 1994, ASIACRYPT.
[37] James G. Oxley,et al. Matroid theory , 1992 .
[38] G. R. BLAKLEY. Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).
[39] László Csirmaz,et al. The Size of a Share Must Be Large , 1994, Journal of Cryptology.
[40] Carles Padró,et al. Secret Sharing, Rank Inequalities, and Information Inequalities , 2016, IEEE Transactions on Information Theory.
[41] Tarik Kaced,et al. Almost-perfect secret sharing , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.
[42] Carles Padr,et al. Lecture Notes in Secret Sharing , 2013 .
[43] Toniann Pitassi,et al. Exponential Lower Bounds for Monotone Span Programs , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[44] Carles Padró,et al. Matroids Can Be Far from Ideal Secret Sharing , 2008, TCC.
[45] Carles Padró,et al. Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming , 2010, LATIN.
[46] Adi Shamir,et al. How to share a secret , 1979, CACM.
[47] R. J. McEliece,et al. On sharing secrets and Reed-Solomon codes , 1981, CACM.
[48] Satoru Fujishige,et al. Polymatroidal Dependence Structure of a Set of Random Variables , 1978, Inf. Control..
[49] Carles Padró,et al. Lecture Notes in Secret Sharing , 2012, IACR Cryptol. ePrint Arch..
[50] Raymond W. Yeung,et al. Two-partition-symmetrical entropy function regions , 2013, 2013 IEEE Information Theory Workshop (ITW).
[51] Ivan Damgård,et al. Atomic Secure Multi-party Multiplication with Low Communication , 2007, EUROCRYPT.
[52] Josh Benaloh,et al. Generalized Secret Sharing and Monotone Functions , 1990, CRYPTO.
[53] Pascal Paillier,et al. On Ideal Non-perfect Secret Sharing Schemes , 1997, Security Protocols Workshop.
[54] Carles Padró,et al. Multi-linear Secret-Sharing Schemes , 2014, TCC.
[55] Oriol Farràs. Recent Advances in Non-perfect Secret Sharing Schemes , 2016, CiE.
[56] Vinod M. Prabhakaran,et al. On the Communication Complexity of Secure Computation , 2013, IACR Cryptol. ePrint Arch..