How to generate and exchange secrets
暂无分享,去创建一个
[1] David Chaum,et al. Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.
[2] Silvio Micali,et al. Probabilistic encryption & how to play mental poker keeping secret all partial information , 1982, STOC '82.
[3] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[4] Manuel Blum,et al. How to exchange (secret) keys , 1983, TOCS.
[5] Vijay V. Vazirani,et al. Trapdoor pseudo-random number generators, with applications to protocol design , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[6] Tom Tedrick,et al. How to Exchange Half a Bit , 1983, CRYPTO.
[7] Silvio Micali,et al. How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[8] Oded Goldreich,et al. RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure , 1984, FOCS.
[9] Adi Shamir,et al. The cryptographic security of truncated linearly related variables , 1985, STOC '85.
[10] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[11] Baruch Awerbuch,et al. Verifiable secret sharing and achieving simultaneity in the presence of faults , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[12] David Chaum,et al. Security without identification: transaction systems to make big brother obsolete , 1985, CACM.
[13] Moti Yung,et al. A private interactive test of a boolean predicate a minimum-knowledge public-key cryptosystems , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[14] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[15] Gilles Brassard,et al. Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[16] Silvio Micali,et al. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[17] Richard Cleve,et al. Limits on the security of coin flips when half the processors are faulty , 1986, STOC '86.
[18] Paul Feldman,et al. A practical scheme for non-interactive verifiable secret sharing , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[19] Amos Fiat,et al. Untraceable Electronic Cash , 1990, CRYPTO.