Robust Secret Sharing Schemes Against Local Adversaries
暂无分享,去创建一个
[1] Ronald Fagin,et al. Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005 , 2005, STOC.
[2] Alfredo De Santis,et al. Size of Shares and Probability of Cheating in Threshold Schemes , 1994, EUROCRYPT.
[3] Silvio Micali,et al. Physically Observable Cryptography (Extended Abstract) , 2004, TCC.
[4] Abhi Shelat,et al. Collusion-Free Multiparty Computation in the Mediated Model , 2009, CRYPTO.
[5] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[6] Ivan Damgård,et al. On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase , 2001, CRYPTO.
[7] 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA , 2008, FOCS.
[8] Rafail Ostrovsky,et al. Unconditionally-Secure Robust Secret Sharing with Compact Shares , 2012, EUROCRYPT.
[9] Harald Niederreiter,et al. Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..
[10] Alfredo De Santis,et al. Lower Bounds for Robust Secret Sharing Schemes , 1997, Inf. Process. Lett..
[11] Stefan Dziembowski,et al. Leakage-Resilient Cryptography , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[12] Ueli Maurer,et al. Collusion-Preserving Computation , 2012, IACR Cryptol. ePrint Arch..
[13] Jørn Justesen,et al. Class of constructive asymptotically good algebraic codes , 1972, IEEE Trans. Inf. Theory.
[14] Thomas Johansson,et al. On the Relation between A-Codes and Codes Correcting Independent Errors , 1994, EUROCRYPT.
[15] Bert den Boer. A Simple and Key-Economical Unconditional Authentication Scheme , 1993, J. Comput. Secur..
[16] G. R. BLAKLEY. Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).
[17] Tor Helleseth,et al. Advances in cryptology, EUROCRYPT '93 : Workshop on the Theory and Application of Cryptographic Techniques, Lofthus, Norway, May 23-27, 1993 : proceedings , 1994 .
[18] Adi Shamir,et al. How to share a secret , 1979, CACM.
[19] Ivan Damgård,et al. Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions , 2015, EUROCRYPT.
[20] Allison Bishop,et al. Storing Secrets on Continually Leaky Devices , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[21] Ivan Visconti,et al. Security and cryptography for networks : 8th International Conference, SCN 2012, Amalfi, Italy, September 5-7, 2012 : proceedings , 2012 .
[22] Ran Canetti,et al. Universally Composable Security with Local Adversaries , 2012, SCN.
[23] Adi Shamir,et al. IP = PSPACE , 1992, JACM.
[24] Alfonso Cevallos,et al. Reducing the Share Size in Robust Secret Sharing , 2011 .
[25] Abhi Shelat,et al. Collusion-free protocols , 2005, STOC '05.
[26] Richard Taylor,et al. An Integrity Check Value Algorithm for Stream Ciphers , 1993, CRYPTO.
[27] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.