Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
暂无分享,去创建一个
[1] Adi Shamir,et al. How to share a secret , 1979, CACM.
[2] Ivan Damgård,et al. Statistical Secrecy and Multibit Commitments , 1998, IEEE Trans. Inf. Theory.
[3] Rafail Ostrovsky,et al. Zero-knowledge from secure multiparty computation , 2007, STOC '07.
[4] Daniele Micciancio. Lattice-Based Cryptography , 2011, Encyclopedia of Cryptography and Security.
[5] Chris Peikert,et al. Public-key cryptosystems from the worst-case shortest vector problem: extended abstract , 2009, STOC '09.
[6] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[7] Matthew K. Franklin,et al. Communication complexity of secure computation (extended abstract) , 1992, STOC '92.
[8] Martin Hirt,et al. Perfectly-Secure MPC with Linear Communication Complexity , 2008, TCC.
[9] Brent Waters,et al. A Framework for Efficient and Composable Oblivious Transfer , 2008, CRYPTO.
[10] Oded Regev,et al. On lattices, learning with errors, random linear codes, and cryptography , 2009, JACM.
[11] Yuval Ishai,et al. Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation , 2005, TCC.
[12] Oded Regev,et al. Lattice-Based Cryptography , 2006, CRYPTO.