Non-Interactive Verifiable Secret Sharing for Monotone Circuits
暂无分享,去创建一个
[1] Avi Wigderson,et al. On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[2] Josh Benaloh,et al. Generalized Secret Sharing and Monotone Functions , 1990, CRYPTO.
[3] Adi Shamir,et al. How to share a secret , 1979, CACM.
[4] Yehuda Lindell,et al. Efficient Secure Two-Party Protocols , 2010, Information Security and Cryptography.
[5] Yehuda Lindell,et al. Efficient Secure Two-Party Protocols: Techniques and Constructions , 2010 .
[6] Ueli Maurer,et al. General Secure Multi-party Computation from any Linear Secret-Sharing Scheme , 2000, EUROCRYPT.
[7] Markus Stadler,et al. Publicly Verifiable Secret Sharing , 1996, EUROCRYPT.
[8] Ivan Damgård,et al. On the complexity of verifiable secret sharing and multiparty computation , 2000, STOC '00.
[9] K. Srinathan,et al. On the Power of Computational Secret Sharing , 2003, INDOCRYPT.
[10] G. R. Blakley,et al. Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).
[11] Mitsuru Ito,et al. Secret sharing scheme realizing general access structure , 1989 .
[12] Torben P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.
[13] Ivan Damgård,et al. Public-Key Encryption with Non-interactive Opening , 2008, CT-RSA.
[14] Oded Goldreich,et al. RSA and Rabin Functions: Certain Parts are as Hard as the Whole , 1988, SIAM J. Comput..
[15] Ivan Damgård,et al. Non-interactive Proofs for Integer Multiplication , 2007, EUROCRYPT.
[16] J. Hawk,et al. The power. , 1976, The Journal of practical nursing.