Link analysis for private weighted graphs
暂无分享,去创建一个
[1] A. Yao. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[2] M. KleinbergJon. Authoritative sources in a hyperlinked environment , 1999 .
[3] Paul F. Syverson,et al. Onion routing , 1999, CACM.
[4] Rajeev Motwani,et al. The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.
[5] Ivan Damgård,et al. Practical Threshold RSA Signatures without a Trusted Dealer , 2000, EUROCRYPT.
[6] Oded Goldreich,et al. The Foundations of Cryptography - Volume 2: Basic Applications , 2001 .
[7] Ivan Damgård,et al. A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System , 2001, Public Key Cryptography.
[8] David Kempe,et al. A decentralized algorithm for spectral analysis , 2004, STOC '04.
[9] Benny Pinkas,et al. Fairplay - Secure Two-Party Computation System , 2004, USENIX Security Symposium.
[10] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[11] Benny Pinkas,et al. Fairplay - Secure Two-Party Computation System (Awarded Best Student Paper!) , 2004 .
[12] Matthew Kam,et al. Privacy Preserving Link Analysis on Dynamic Weighted Graph , 2005, Comput. Math. Organ. Theory.
[13] Shigenobu Kobayashi,et al. Privacy-preserving reinforcement learning , 2008, ICML '08.
[14] David Kempe,et al. A decentralized algorithm for spectral analysis , 2008, J. Comput. Syst. Sci..