Efficient (k, n) Secret Sharing Scheme Secure against k — 2 Cheaters
暂无分享,去创建一个
[1] MARCO CARPENTIERI. A perfect threshold secret sharing scheme to identify cheaters , 1995, Des. Codes Cryptogr..
[2] G. R. BLAKLEY. Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).
[3] Satoshi Obana,et al. t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes , 1995, CRYPTO.
[4] Alfredo De Santis,et al. Size of Shares and Probability of Cheating in Threshold Schemes , 1994, EUROCRYPT.
[5] C. Pandu Rangan,et al. The Round Complexity of Verifiable Secret Sharing Revisited , 2009, CRYPTO.
[6] Satoshi Obana. Almost Optimum t-Cheater Identifiable Secret Sharing Schemes , 2011, EUROCRYPT.
[7] Kaoru Kurosawa,et al. Optimum Secret Sharing Scheme Secure against Cheating , 1996, EUROCRYPT.
[8] Toshinori Araki. Efficient (k, n) Threshold Secret Sharing Schemes Secure Against Cheating from n-1 Cheaters , 2007, ACISP.
[9] Martin Tompa,et al. How to share a secret with cheaters , 1988, Journal of Cryptology.
[10] Satoshi Obana,et al. Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution , 2006, ASIACRYPT.
[11] Adi Shamir,et al. How to share a secret , 1979, CACM.
[12] Aniket Kate,et al. Computational Verifiable Secret Sharing Revisited , 2011, ASIACRYPT.
[13] Yuqing Zhang,et al. Efficient (n, t, n) secret sharing schemes , 2012, J. Syst. Softw..