Coates M, Hero A, Nowak R, et a1. Internet tomography[J]. IEEE Signal Process Mag, 2002, 19(3): 47-65.
[2]
Coatro R, Coates M, Liang G, et al. Network tomography: recent developments[J]. Statistical Science, 2004, 19(3): 499-517.
[3]
Coates M, Nowak R. Network loss inference using unicast end-to-end measurement//ITC Conf on IP Traffic, Modelling and Management. Monterey: , 2000: 874-891.
[4]
Meng-Fu S, Alfred O. Unicast-based inference of network link delay distributions with finite mixture models[J]. IEEE Trans on Signal Processing, 2003, 51(8): 2219-2228.
[5]
Coates M, Castro R, Nowak R. Maximum likelihood network topology identification from edge-based unicast measurements//ACM SIGMETRICS. New York: ACM Press, 2002: 1015-1023.
[6]
Castro R, Coates M, Nowak R. Likelihood based hierarchical clustering[J]. IEEE Trans on Signal Processing, 2004, 52(8): 2308-2321.
[7]
李勇军, 蔡皖东, 王伟, 等. 基于端到端报文丢失的网络拓扑推断算法研究[J]. 通信学报, 2007, 28(10): 85-91. Li Yongjun, Cai Wandong, Wang Wei, et al. Research on network topology identification algorithm based on end-to-end loss performance[J]. Journal Communications, 2007, 28(10): 85-91.
[8]
Shih M, Hero A. Hierarchical inference of unicast network topologies based on end-to-end measurements[J]. IEEE Trans on Signal Processing, 2007, 55(5): 1708-1718.
Philip B. A survey on tree edit distance and related problems. (2005-06).
[11]
Aiello B, Ishai Y, Reingold O. Priced oblivious transfer: how to sell digital goods//Advanced in Cryptology-Eurocrypt, LNCS 2045. Innsbruck: Springer-Verlag, 2001: 119-135.
[12]
Mu Y, Zhang Junqi, Varadharajan V. m out of n ob-livious transfer//ACISP'02, Lecture Notes in Computer Science. Heidelberg: Springer-Verlag, 2002: 395-405.
[13]
Bao Feng, Robert H Deng. An efficient and practical scheme for privacy protection in the e-commerce of digital goods//Proc ICICS 2000. Heidelberg: Springer Berlin, 2001: 162-170.
[14]
Noar M, Pinkas B. Efficient oblivious transfer protocols//Proceedings of SODA 01. Philadelphia: Society for Industrial and Applied Mathematics, 2001: 448-457.
[15]
秦静, 李宝, 崔少军, 等. 对OT协议的分析与改进[J]. 北京邮电大学学报, 2005, 28(增刊): 31-35. Qin Jing, Li Bao, Cui Shaojun, et al. Research of ob-livious transfer protocol[J]. Journal of Beijing University of Posts and Telecommunications, 2005, 28(Sup): 31-35.
[16]
Christian T. Practical oblivious transfer protocols//Lecture Notes in Computer Science 2578. New York: Springer-Verlag, 2002: 415-426.
[17]
Tzeng Wen-Guey. Efficient oblivious transfer schemes//5th International Workshop on Practice and Theory in Public Key Cryptosystems. Paris: Springer Berlin, 2002: 159-171.
[18]
Chu Cheng-Kang, Tzeng Wen-Guey. Efficient k-out-of-n oblivious transfer schemes with adaptive and nonadaptive queries//8th International Workshop on Practice and Theory in Public Key Cryptosystems. Paris: Springer Berlin, 2005: 172-183.
[19]
Gertner Y, Kannan S, Malkin T, et al. The relationship between public key encryption and oblivious transfer//Proc of the 41st Annual Symposium on Foundations of Computer Science(FOCS '00). Los Alamitos: IEEE Computer Society Press, 2000: 325-335.
[20]
Ishai Y, Kilian J, Nissim K, et al. Extending oblivious transfers efficiently//Advances in Cryptology-CRYPTO '03. : Springer-Verlag, 2003: 145-161.
[21]
Lipmaa H. New communication-efficient oblivious transfer protocols based on pairings. .
[22]
Peikert C, Vaiknntanathan V, Waters B. A framework for efficient and composable oblivious transfer. .
[23]
Mao Wenbo. Modern cryptography: theory and practice[M]. Beijing: Publishing House of Electronics Industry, 2004: 85-136.
