Robust and Efficient Sharing of RSA Functions
暂无分享,去创建一个
Hugo Krawczyk | Tal Rabin | Rosario Gennaro | Stanislaw Jarecki | T. Rabin | H. Krawczyk | R. Gennaro | Stanislaw Jarecki
[1] Moti Yung,et al. How to share a function securely , 1994, STOC '94.
[2] H. Imai,et al. Efficient and secure multiparty generation of digital signatures based on discrete logarithms , 1993 .
[3] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[4] Tal Rabin,et al. An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products , 1998, CCS '98.
[5] Paul Feldman,et al. A practical scheme for non-interactive verifiable secret sharing , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[6] Torben P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.
[7] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[8] Yvo Desmedt,et al. Shared Generation of Authenticators and Signatures (Extended Abstract) , 1991, CRYPTO.
[9] David Chaum,et al. Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..
[10] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[11] Silvio Micali,et al. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..
[12] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.