网络测量数据隐私保护若干关键技术研究
|
摘要
随着互联网的快速发展和普及,人们对网络服务的性能和质量有着越来越高的要求,而建立和维护一个健壮、可靠、稳定的互联网络,需要网络管理者与网络研究者以及网络管理者之间通过协作的方式来发现问题,解决问题。一方面,网络研究者需要现网的测量数据来建立、优化模型,进而为网络建设和优化提供科学的指导意见,另一方面,由于安全性等因素,网络研究者很难获得权限在网络管理者运营的网络中部署测量设施来采集网络数据,或者访问网络管理者已经采集的数据。因此,共享网络测量数据对网络的研究有非常重要的意义。
然而,网络测量数据中包含了大量的敏感信息,如主机标识、用户个人信息(Email、身份ID、金融账号)、网络拓扑结构等,这些信息在一定程度上可以反映用户使用网络的习惯和行为特征,揭示网络运营者的竞争策略和商业秘密等,更进一步,这些敏感信息可以被恶意用户用来发动网络攻击,进而影响网络性能。网络数据的敏感性和隐私性阻碍了网络管理者共享测量数据的积极性,进而影响了网络研究的开展。因此,研究可靠、安全的网络测量数据隐私保护技术是迫切需要解决的问题。
本文重点研究了网络测量数据隐私保护若干关键技术,包括网络测量数据净化技术和安全多方计算技术。网络测量数据净化技术是指对网络测量数据中敏感属性字段进行特殊处理从而达到隐私保护的目的,而安全多方计算技术是指两个或两个以上的数据共享者根据各自的秘密输入而执行安全的计算协议,使得各方在得到正确结果的同时又保护自身信息的秘密性。本文主要贡献和创新点包含以下几个方面：
(1)研究了相关的网络测量数据净化技术尤其是网络测量数据中的IP地址净化技术,对分层IPv4净化算法进行了安全性评估,并针对IPv6寻址结构的特点、IPv6地址分配的特点提出了IPv6地址净化策略。对净化算法的可恢复性进行了深入的研究,在此基础上了提出了基于可逆树的IP地址净化恢复算法,增强了净化技术的溯源性,进一步完善了网络测量数据净化技术体系的完整性。
(2)研究了针对网络测量数据净化技术的相关攻击方法和攻击模型,提出了在多方参与共享网络测量数据的情况下,对净化后数据的安全性的评估方法。该方法从实体对象的角度对共享的数据集进行聚类分析,通过对比数据净化前后实体对象在特征属性上分布的相似程度,使用相似度分布的统计学方法来评估每个实体对象经过净化处理后被破解的不确定性,从而为参与共享数据的数据提供者提供定量的安全性评估标准。
(3)研究了基于安全多方计算的网络测量数据隐私保护技术,并针对网络测量数据的特点,对安全多方计算的原子操作进行了优化,并在此基础上提出了基于安全多方计算的分布式网络测量数据汇聚查询算法和跨域网络流量异常检测算法。基于安全多方计算的分布式测量数据汇聚查询算法,采用了阀值门限技术和Shamir安全多方求和协议,对分布在不同地理位置的网络测量数据进行安全的协同计算,可以使参与查询计算的参与方在不暴露自身流量数据隐私的前提下正确的计算出全局汇聚值最大的前K个项及汇聚值。而基于安全多方计算的跨域异常检测算法是通过对传统集中式的PCA异常检测算法的计算过程进行分解,并使用安全两方矩阵计算协议和Shamir安全多方求和协议来保证计算过程各方测量数据的安全性,从而使跨多个域的分布式网络流量异常检测成为可能。
(4)基于上述的网络测量数据隐私保护技术的研究基础,设计并实现了针对基于可信第三方的数据共享模型和基于安全多方计算的数据共享模型。数据提供者可以根据不同的应用场景和不同的应用需求,选择不同的数据发布模型,最大限度的保护网络测量数据的安全性。
With the fast development and popularization of Internet, people have a increasing demand for higher performance and quality of network services. To build a strong, reliable and stable network, network manager and researcher should work together through collaboration to find and solve network problems. On the one hand, network researchers require shared traffic traces to build and optimize network model for network construction. On the other hand, due to factors such as security, it's very hard for network researcher to get permission to collect traffic traces from the target network or access existed network traffic traces. Therefore, network data sharing has important implications for network research.
Unfortunately, these traffic traces often contain highly sensitive information about the network being monitored and their users, such as host identities, user private information (Emai address, identification number and financial account), network architecture and so on. The sensitive information in some extent could reflect user's behavior characteristics as well as reveal the network operator's competition strategy and business secret. Furthermore, this information can be exploited by malicious users to launch network attack, which will affect the performance of the network. Therefore, it is necessary to study reliable and secure privacy-preserving mechanism for network data sharing.
This dissertation focuses on two key techniques for protecting sensitive and private information in the traffic traces. One is sanitation technology which refers to using secure methods to process sensitive attributes in traffic data formats. The other one is Secure Multiparty Computation (SMC) technology that enable a set of parties to compute a public function over their private data in a way that the computation only reveals the final value of the public function and nothing more about the private data. The main contributions of our work include:
(1). This dissertation researches on network trace sanitation technologies especially for IP address sanitation mechanism. We introduce a evaluation metric to evaluate the security of different dividing strategies for IPv4sanitation as well as give dividing suggestions for IPv6address sanitation, according to the characteristics of IPv6address structure and IPv6address allocation policy. We also propose a reversible tree based mechanism for recovery. Experimental results show that our mechanism performs better for both IPv4and IPv6anonymization and the recovery process has the same computation complexity with the anonymization process.
(2). This dissertation researches on some attack methods and models employed by an adversary for de-sanitation. We introduce a evaluation metric to assess security of the santized traffic traces in the context that multi-participants joint together to share network traces. We analysis the shared data sets in a clustering way from the point of view of entity object. We compare the feature distribution's similarity between a santized object and all unsantized object and use the statistic method to evaluate its decomposed uncertainty. In this way, we can provide a metric for each participant to evaluate the security of its sanitized dataset.
(3). This dissertation researches on Secure Multiparty Computation (SMC) based mechanism for traffic traces privacy protection. We optimize the SMC's atomic operations and propose secure algorithms for distributed traffic traces aggregation and multi-domain traffic anomaly detection. For the secure distributed traffic traces aggregation algorithm, we leverage secure multiparty computation to design a privacy-preserving top-k queries based on threshold algorithm (TA). We use Oblivious Pseudorandom Functions (OPRF) and Shamir's secret sharing scheme to keep the input key-value pairs privacy-preserving. With the TA-style algorithm, we can guarantee the results of distributed privacy-preserving top-k queries accuracy without errors. For the secure multi-domain traffic anomaly detection algorithm, we propose a privacy-preserving mechanism that allows ISPs to cooperatively detect anomalies without requiring them to reveal private traffic information. We design a "semi-centralized" architecture and use secure multiparty computation (SMC) protocol to make the Principal Component Analysis (PCA) based detection method privacy-preserving and at same time keep its scalability and accuracy.
(4). Based on the above research, we design and implement two traffc traces sharing model:Trusted Third Party model and SMC-based sharing model. The data publisher can choose appropriate data sharing model according to different application requirements.
然而,网络测量数据中包含了大量的敏感信息,如主机标识、用户个人信息(Email、身份ID、金融账号)、网络拓扑结构等,这些信息在一定程度上可以反映用户使用网络的习惯和行为特征,揭示网络运营者的竞争策略和商业秘密等,更进一步,这些敏感信息可以被恶意用户用来发动网络攻击,进而影响网络性能。网络数据的敏感性和隐私性阻碍了网络管理者共享测量数据的积极性,进而影响了网络研究的开展。因此,研究可靠、安全的网络测量数据隐私保护技术是迫切需要解决的问题。
本文重点研究了网络测量数据隐私保护若干关键技术,包括网络测量数据净化技术和安全多方计算技术。网络测量数据净化技术是指对网络测量数据中敏感属性字段进行特殊处理从而达到隐私保护的目的,而安全多方计算技术是指两个或两个以上的数据共享者根据各自的秘密输入而执行安全的计算协议,使得各方在得到正确结果的同时又保护自身信息的秘密性。本文主要贡献和创新点包含以下几个方面：
(1)研究了相关的网络测量数据净化技术尤其是网络测量数据中的IP地址净化技术,对分层IPv4净化算法进行了安全性评估,并针对IPv6寻址结构的特点、IPv6地址分配的特点提出了IPv6地址净化策略。对净化算法的可恢复性进行了深入的研究,在此基础上了提出了基于可逆树的IP地址净化恢复算法,增强了净化技术的溯源性,进一步完善了网络测量数据净化技术体系的完整性。
(2)研究了针对网络测量数据净化技术的相关攻击方法和攻击模型,提出了在多方参与共享网络测量数据的情况下,对净化后数据的安全性的评估方法。该方法从实体对象的角度对共享的数据集进行聚类分析,通过对比数据净化前后实体对象在特征属性上分布的相似程度,使用相似度分布的统计学方法来评估每个实体对象经过净化处理后被破解的不确定性,从而为参与共享数据的数据提供者提供定量的安全性评估标准。
(3)研究了基于安全多方计算的网络测量数据隐私保护技术,并针对网络测量数据的特点,对安全多方计算的原子操作进行了优化,并在此基础上提出了基于安全多方计算的分布式网络测量数据汇聚查询算法和跨域网络流量异常检测算法。基于安全多方计算的分布式测量数据汇聚查询算法,采用了阀值门限技术和Shamir安全多方求和协议,对分布在不同地理位置的网络测量数据进行安全的协同计算,可以使参与查询计算的参与方在不暴露自身流量数据隐私的前提下正确的计算出全局汇聚值最大的前K个项及汇聚值。而基于安全多方计算的跨域异常检测算法是通过对传统集中式的PCA异常检测算法的计算过程进行分解,并使用安全两方矩阵计算协议和Shamir安全多方求和协议来保证计算过程各方测量数据的安全性,从而使跨多个域的分布式网络流量异常检测成为可能。
(4)基于上述的网络测量数据隐私保护技术的研究基础,设计并实现了针对基于可信第三方的数据共享模型和基于安全多方计算的数据共享模型。数据提供者可以根据不同的应用场景和不同的应用需求,选择不同的数据发布模型,最大限度的保护网络测量数据的安全性。
With the fast development and popularization of Internet, people have a increasing demand for higher performance and quality of network services. To build a strong, reliable and stable network, network manager and researcher should work together through collaboration to find and solve network problems. On the one hand, network researchers require shared traffic traces to build and optimize network model for network construction. On the other hand, due to factors such as security, it's very hard for network researcher to get permission to collect traffic traces from the target network or access existed network traffic traces. Therefore, network data sharing has important implications for network research.
Unfortunately, these traffic traces often contain highly sensitive information about the network being monitored and their users, such as host identities, user private information (Emai address, identification number and financial account), network architecture and so on. The sensitive information in some extent could reflect user's behavior characteristics as well as reveal the network operator's competition strategy and business secret. Furthermore, this information can be exploited by malicious users to launch network attack, which will affect the performance of the network. Therefore, it is necessary to study reliable and secure privacy-preserving mechanism for network data sharing.
This dissertation focuses on two key techniques for protecting sensitive and private information in the traffic traces. One is sanitation technology which refers to using secure methods to process sensitive attributes in traffic data formats. The other one is Secure Multiparty Computation (SMC) technology that enable a set of parties to compute a public function over their private data in a way that the computation only reveals the final value of the public function and nothing more about the private data. The main contributions of our work include:
(1). This dissertation researches on network trace sanitation technologies especially for IP address sanitation mechanism. We introduce a evaluation metric to evaluate the security of different dividing strategies for IPv4sanitation as well as give dividing suggestions for IPv6address sanitation, according to the characteristics of IPv6address structure and IPv6address allocation policy. We also propose a reversible tree based mechanism for recovery. Experimental results show that our mechanism performs better for both IPv4and IPv6anonymization and the recovery process has the same computation complexity with the anonymization process.
(2). This dissertation researches on some attack methods and models employed by an adversary for de-sanitation. We introduce a evaluation metric to assess security of the santized traffic traces in the context that multi-participants joint together to share network traces. We analysis the shared data sets in a clustering way from the point of view of entity object. We compare the feature distribution's similarity between a santized object and all unsantized object and use the statistic method to evaluate its decomposed uncertainty. In this way, we can provide a metric for each participant to evaluate the security of its sanitized dataset.
(3). This dissertation researches on Secure Multiparty Computation (SMC) based mechanism for traffic traces privacy protection. We optimize the SMC's atomic operations and propose secure algorithms for distributed traffic traces aggregation and multi-domain traffic anomaly detection. For the secure distributed traffic traces aggregation algorithm, we leverage secure multiparty computation to design a privacy-preserving top-k queries based on threshold algorithm (TA). We use Oblivious Pseudorandom Functions (OPRF) and Shamir's secret sharing scheme to keep the input key-value pairs privacy-preserving. With the TA-style algorithm, we can guarantee the results of distributed privacy-preserving top-k queries accuracy without errors. For the secure multi-domain traffic anomaly detection algorithm, we propose a privacy-preserving mechanism that allows ISPs to cooperatively detect anomalies without requiring them to reveal private traffic information. We design a "semi-centralized" architecture and use secure multiparty computation (SMC) protocol to make the Principal Component Analysis (PCA) based detection method privacy-preserving and at same time keep its scalability and accuracy.
(4). Based on the above research, we design and implement two traffc traces sharing model:Trusted Third Party model and SMC-based sharing model. The data publisher can choose appropriate data sharing model according to different application requirements.
引文
[1]ISC. Internet host count history, http://www.isc.org/solutions/survey/.
[2]Informa. http://www.infonnatandm.com/section/home-page/.
[3]CSI Computer Crime and Security Survey 2009. http://gocsi.com/survey.
[4]A. Hanemann, J. W. Boote, E. L. Boyd, et al, "PerfSONAR:a service oriented architecture for multidomain network monitoring," In Proc. Third International Conference on Service Oriented Computing (ICSOC), vol.3826 of LNCS, Springer-Verlag, Dec.2005, pp.241-254.
[5]杨家海,吴建平,安常青,《互联网络测量理论与应用》,人民邮电出版社,2009年10月
[6]M. Roughan and Y. Zhang, "Privacy-preserving performance measurements," In SIGCOMM workshop on Mining network data (MineNet),2006, pp.329-334.
[7]M, Roughan and Y. Zhang, "Secure distributed data-mining and its application to large-scale network measurements," Computer Communication Review (CCR),2006,36(1):7-14.
[8]Cooperative Association for Internet Data Analysis (CAIDA). Online at http://www.caida.org/
[9]Community Resource for Archiving Wireless Data At Dartmouth (CRAWDAD),2010. Online at http://www.crawdad.org/.
[10]Protected Repository for the Defense of Infrastructure against Cyber Threats (PREDICT).Online at http://www.predict.org.
[11]DHSIELD. Online at http://www.dshield.org/.
[12]Claffy, M. Crovella, T. Friedman, C. Shannon, et al, Community-Oriented Network Measurement Infrastructure (CONMI) Workshop Report. Computer Communication Review (CCR),2006,36(2):41.
[13]G. Iannaccone, C. Diot, D. McAuley, et al, The CoMo White Paper. Intel Research Cambridge, Tech. Rep. September,2004,IRCTR-04-017.
[14]P. Matray, I. Csabai, P. Haga, et al, "Building a prototype for network measurement virtual observatory," In ACM Workshop on Mining network data (MineNet),2007.
[15]J. Quittek, T. Zseby, B. Claise, et al, Requirements for IP Flow Information Export (IPFIX), Internet RFCs, ISSN 2070-1721, RFC 3917,2004.
[16]E. Boschi and B. Trammell. IP Flow Anonymization Support. InternetRFCs, ISSN 2070-1721, RFC 6235,2011.
[17]R. Pang, M. Allman, V. Paxson, et al, "The devil and packet trace anonymization," Computer Communication Review (CCR),36(1):29-38,2006.
[18]J. Fan, J. Xu, M. H. Ammar, et al, "Prefix-preserving IP address anonymization," Comput. Networks,2004,,46(2):253-272.
[19]J. Postel, "Internet Protocol, " RFC0791, Sep.1981.
[20]S. Deering, and R. Hinden, Internet Protocol Version 6 Specification, RFC2460, Dec.1998.
[21]李振强,赵晓宇,马严等,IPv6技术揭秘,人民邮电出版社,北京,2006年4月.
[22]J. King, K. Lakkaraju, and A. Slagell. "A taxonomy and adversarial model for attacks against network log anonymization," In ACM symposium on Applied Computing (SAC),2009, pp.253-272.
[23]D. Koukis, S. Antonatos, and K. G. Anagnostakis, "On the privacy risks of publishing anonymized IP network traces," In Communications and Multimedia Security (CMS),2006, pp.22-32.
[24]M. Burkhart and X. Dimitropoulos, "Privacy-Preserving Distributed Network Troubleshooting-Bridging the Gap between Theory and Practice," ACM Transactions on Information and System Security (TISSEC), Dec.2011,14(4).
[25]Charu C, Aggarwal and Philip S. Yu. "Privacy-Preserving Data Mining:Models and Algorithms," Springer-Verlag,2008,pp.45-61.
[1]Cisco Systems Inc. NetFlow Services Solutions Guide. available at http://www.cisco.com/univercd/cc/td/doc/cisintwk/intsolns/netflsol/nfwhite.pdf.
[2]J. Quittek, T. Zseby, B. Claise, et al, Requirements for IP Flow Information Export (IPFIX). Internet RFCs, ISSN 2070-1721, RFC 3917,2004.
[3]Adam Slagell, Kiran Lakkaraju, and Katherine Luo, "FLAIM:A multi-level anonymization framework for computer and network logs," In Proceedings of the USENIX Large Installation System Administration Conference (LISA), December 2006, pp.63-77.
[4]R. Crawford, M. Bishop, B. Bhumiratana, et al, "Sanitization models and their limitations," In Proceedings of the Workshop on New Security Paradigms (NSPW), ACM Press,2007, pp 41-56.
[5]Shantanu Gattani and Thomas E. Daniels, "Reference models for network data anonymization," In Proceedings of the ACM Workshop on Network Data Anonymization (NDA), ACM Press,2008, pp.41-48.
[6]William Yurcik, Clay Woolam, Greg Hellings, et al, "Toward trusted sharing of network packet traces using anonymization:Single-field privacy/analysis tradeoffs," Technical Report 0710.3979v2, arXiv,2007.
[7]Greg Minshall. "TCPdPriv:Program for eliminating confidential information from traces," 2005, Ipsilon Networks, Inc. On line at http://ita.ee.lbl.gov/html/contrib/tcpdpriv.html.
[8]Jinliang Fan, Jun Xu, Mostafa H. Ammar, at al, "Prefix-preserving IP address anonymization: measurement-based security evaluation and a new cryptography-based scheme," In Proceedings of the IEEE International Conference on Network Protocols (ICNP) November 2002, pp 280-289.
[9]J. Fan, J. Xu, M. H. Ammar, et al, Moon,'Prefix-preserving IP address anonymization,' Comput. Networks,2004,46(2):253-272.
[10]Ethan Blanton. TCPurify:A "sanitary" sniffer,2000. Online at http://masaka.cs.ohiou.edu/eblanton/tcpurify/.
[11]Y. Li, A. Slagell, K. Luo, et al, "Canine:A combined conversion and anonymization tool for processing netfiows for security," In International Conference on Telecommunication Systems Modeling and Analysis,2005, pp 56-61.
[12]M. Foukarakis, D. Antoniades, S. Antonatos, et al. "Flexible and high-performance anonymization of NetFlow records using anontool," In SECURECOMM Conference,2007, pp.33-38.
[13]R. Pang, M. Allman, V. Paxson, et al, "The devil and packet trace anonymization," Computer Communication Review (CCR),2006,36(1):29-38.
[14]Ramaswamy Ramaswamy and Tilman Wolf, "High-speed prefix-preserving IP address anonymization for passive measurement systems," ACM/IEEE Transactions on Networking (TON), January 2007,15(1):26-39.
[15]Qianli Zhang and Xing Li, "An IP address anonymization scheme with multiple access levels," In Proceedings of Information Networking:Advances in Data Communications and Wireless Networks (ICOIN), volume 3961 of Lecture Notes in Computer Science. Springer-Verlag, 2006, pp.793-802.
[16]Scott E. Coull, Fabian Monrose and Michael D. Bailey, "The Challenges of Effectively Anonymizing Network Data," In Proceedings of the Cybersecurity Applications & Technology Conference For Homeland Security (CATCH), March 2009, pp 230-236.
[17]J. King, K. Lakkaraju, and A. Slagell, "A taxonomy and adversarial model for attacks against network log anonymization," In ACM symposium on Applied Computing (SAC),2009, pp.1286-1293.
[18]T(?)nnes Brekne, Andre'A°rnes, and Arne (?)sleb(?), "Anonymization of IP traffic monitoring data:Attacks on two prefix-preserving anonymization schemes and some proposed remedies," In Proceedings of the International Symposium on Privacy Enhancing Technologies (PET), volume 3856 of Lecture Notes in Computer Science. Springer-Verlag,2005, pp.179-196.
[19]Scott E. Coull, Charles V. Wright, Fabian Monrose, et al, "Playing Devil's advocate:Inferring sensitive information from anonymized network traces," In Proceedings of the Annual Symposium on Network and Distributed System Security (NDSS). IEEE Press, February 2007, pp.35-47.
[20]Phil Fazio, Keren Tan, Jihwang Yeo, et al, "The NetSANI framework for analysis and fine-tuning of network trace sanitization," In Proceedings of the ACM Conference on Wireless Network Security (WiSec). ACM Press, June 2011, pp.5-10.
[21]D. Koukis, S. Antonatos, and K. G. Anagnostakis. "On the privacy risks of publishing anonymized IP network traces," In Communications and Multimedia Security (CMS), 2006, pp.22-32.
[22]D. J. Kelly, R. A. Raines, M. R. Grimaila, et al, "A survey of state-of-the-art in anonymity metrics," In Proceedings of the ACM Workshop on Network Data Anonymization (NDA), 2008, pp.31-40.
[23]K. Tan, J. Yeo, M. E. Locasto, et al, "Catch, clean, and release:A survey of obstacles and opportunities for network trace sanitization," In Privacy-Aware Knowledge Discovery:Novel Applications and New Techniques. Chapman and Hall/CRC Press, December 2010, pp.111-141.
[24]G. Duncan and D. Lambert, "The risk of disclosure for microdata,"Journal of Business& Economic Statistics, vol.7, p.207, xx1989,10.2307/1391438.
[25]T. M. Truta, F. Fotouhi, and D. Barth-Jones, "Assessing global disclosure risk in masked microdata," in WPES'04:Proceedings of the 2004 ACM workshop on Privacy in the electronic society. New York, NY, USA:ACM Press,2004, pp.85-93.
[26]C. J. Skinner and M. J. Elliot, "A measure of disclosure risk for microdata," Journal of the Royal Statistical Society:Series B (Statistical Methodology), vol.64, no.4,2002, pp. 855-867.
[27]周水庚,李丰,陶宇飞等,“面向数据库应用的隐私保护研究综述”,计算机学报,2009年第5期
[28]L. Sweeney, "k-anonymity:a model for protecting privacy," International Journal on Uncertainty, Fuzziness and Knowledge-based Systems,2002,10(5):557-570.
[29]Raymond Chi-Wing Wong, J. Li, Ada Wai-Chee Fu and K. Wang, "(a,k)-Anonymity:An Enhanced k-Anonymity Model for Privacy-Preserving Data Publishing.," In Proc. of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD), Philadelphia, PA, USA,2006:754-759.
[30]A. Machanavajjhala, J. Gehrke, D. Kifer, et al, "1-Diversity:Privacy Beyond k-Anonymity," In 22nd International Conference on Data Engineering, Atlanta, Georgia, USA,2006, pp.24-30.
[31]N. Li, T. Li, and S. Venkatasubramanian, "t-Closeness:Privacy Beyond k-Anonymity and 1-Diversity," In IEEE 23rd International Conference on Data Engineering,2007, pp.106-115.
[32]N. Li and T. Li, "t-closeness:Privacy beyond k-anonymity and 1-diversity," In Proc. of the 23rd International Conference on Data Engineering (ICDE), Istanbul, Turkey,2007:106-115.
[33]X. Xiao and Y. Tao, "Personalized privacy preservation," In Proc. of the ACM SIGMOD Conference on Management of Data (SIGMOD), Atlanta, Georgia, USA,2006:229-240.
[34]M. Burkhart, D. Brauckhoff, M. May,et al. "The risk-utility tradeoff for IP address truncation.," In ACM Workshop on Network Data Anonymization (NDA), Oct.2008, pp.23-30.
[35]A. Kounine and M. Bezzi. "Assessing disclosure risk in anonymized datasets," In FloCon 2008, January 2008.
[36]S. E. Coull, C. V. Wright, A. D. Keromytis, et al, "Taming the Devil:Techniques for Evaluating Anonymized Network Data.'Tn Proceedings of the 15th Network and Distributed Systems Security Symposium,2008, pp.125-135.
[37]Scott Coull, Fabian Monrose, and Michael Bailey, "On Measuring the Similarity of Network Hosts:Pitfalls, New Metrics, and Empirical Analyses," In Proceedings of the 18th Annual Network & Distributed System Security Symposium (NDSS'11), San Diego, California, USA, February 2011, pp.112-119.
[38]M. Burkhart, D. Brauckhoff, and M. May, "On the utility of anonymized flow traces for anomaly detection," In 19th ITC Specialist Seminar on Network Usage and Traffic (ITC SS 19), Berlin, Germany, Oct.2008, pp.223-231.
[39]M. Woo, J. Reiter, A. Oganian, and A. Karr, "Global measures of data utility for microdata masked for disclosure limitation," Journal of Privacy and Confidentiality,2009,1(1):7.
[40]G. Duncan, S. Keller-McNulty, and S. Stokes, "Disclosure risk versus data utility:The RU confidentiality map," Technical paper, Los Alamos National Laboratory, Los Alamos, NM, 2001,pp39-45.
[41]A. Yao, "Protocols for secure computations," In IEEE Symposium on Foundations of Computer Science,1982, pp.160-164.
[42]O. Goldreich, S. Micali, and A. Wigderson, "How to play any mental game," In ACM symposium on Theory of computing (STOC),1987.
[43]刘木兰,张志芳,《密钥共享体制和安全多方计算》,电子工业出版社,2008
[44]A. Shamir, "How to share a secret," Communications of the ACM 1979,22(11):612-613,
[45]G.R.Blaldey, "Safeguarding cryptographic Keys," In Proceedings of National ComPuter Conference,1979, Newyork,48:313-317.
[46]M. O. Rabin, "How to exchange secrets by oblivious transfer," Technical Report TR-81, Harvard Aiken Computation Laboratory,1981.
[47]Kilian J, "Founding cryptography on oblivious transfer," In proceedings of 20th ACM symposium on Theory of Computing,1988, pp.20-31.
[48]Cheng-Kang Chu and Wen-Guey Tzeng, "Efficient k-out-of-n oblivious transfer schemes with adaptive and nonadaptive queries," In PKC'05, volume 3386 of LNCS,2005, pp.172-183.
[49]Moni Naor and Benny Pinkas, "Oblivious transfer with adaptive queries," In CRYPTO'99, volume 1666 of LNCS,1999, pp.573-590.
[50]EIGamal T,"A Public key cryptosystem and a signature scheme based on discrete logarithms," IEEETrans.Inform.Theory,1985, pp.469-472.
[51]Goldwasser S and Micali S, "Probabilistic eneryption & how to play mental poker keeping secret all partial information," In:Proe. the 14th anual ACM Symposium on Theory of Computing. SanFrancisco California,1982, pp.365-377.
[52]Paillier P, "Public-Key cryptosystems based on composite degree residuosity classes," In:J. Stern(Ed):EUROCRYPT'99, LNCS 1592. Springer-Verlag,1999, pp.223-238.
[53]Z. Beerliov'a-Trubrniov'a and M. Hirt, "Perfectly-secure MPC with linear communication complexity," In Theory of Cryptography Conference (TCC),2008, pp.213-230.
[54]D. Beaver, S. Micali, and P. Rogaway, "The round complexity of secure protocols," In ACM symposium on Theory of computing (STOC),1991, pp.1-5.
[55]I. Damgard, M. Geisler, M. Kr(?)igaard, et al, "Asynchronous multiparty computation:Theory and implementation," In Conference on Practice and Theory in Public Key Cryptography (PKC),2009, pp.160-179.
[56]M. Ben-Or, S. Goldwasser, and A.Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computation," In ACM symposium on Theory of computing (STOC),1988, pp.1-10.
[57]荆巍巍,安全多方计算中若干基础协议及应用的研究,博士论文,中国科技大学,2008.
[58]赵洋,安全多方计算及其应用协议研究,博士论文,电子科技大学,2009
[59]R. Canetti, "Universally composable security:A new paradigm for cryptographic protocols," In IEEE Symposium on Foundations of Computer Science (FOCS),2001, pp136-145.
[60]D. Chaum, C. Cr'epeau, and I. Damgard, "Multiparty unconditionally secure protocols," In ACM Symposium on Theory of Computing (STOC),1988, pp.11-19
[61]M. J. Freedman, K. Nissim, and B. Pinkas, "Efficient private matching and set intersection," In EUROCRYPT,2004, pp.1-19
[62]Y. Sang, H. Shen, Y. Tan, and N. Xiong, "Efficient protocols for privacy preserving matching against distributed datasets," In Information and Communications Security (ICICS),2006, pp.210-227.
[63]Y. Lindell and B. Pinkas, "Secure multiparty computation for privacypreserving data mining," Journal of Privacy and Confidentiality,2009, 1(1):59-98.
[64]V. Verykios, E. Bertino, I. Fovino Y. Theodoridis, "State-of-the-art in privacy preserving data mining," ACM Sigmod Record,2004,33(1):50-57.
[65]M. Roughan and Y. Zhang, "Secure distributed data-mining and its application to large-scale network measurements," Computer Communication Review (CCR),2006,36(1):7-14.
[66]朱珂,姚重俭,朱培栋,卢锡城,基于安全多方计算的BGP策略冲突检测算.计算机工程与科学,2006年第28卷第12期,2006.
[67]APPLEBAUM, B., RINGBERG, H., FREEDMAN, M. J., et al, "Collaborative, privacy-preserving data aggregation at scale," In Privacy Enhancing Technologies Symposium (PETS),2010, pp.56-74.
[68]BURKHART, M., AND DIMITROPOULOS, X, "Fast privacy-preserving top-k queries using secret sharing," In International Conference on Computer Communication Networks (ICCCN), 2010, pp.1-7.
[69]Shishir Nagaraja, Virajith Jalaparti, Matthew Caesar, et al, "P3CA:Private Anomaly Detection Across ISP Networks," Privacy Enhancing Technologies, volume 6794 of Lecture Notes in Computer Science,2011, pp.38-56.
[70]A. Ben-David, N. Nisan, and B. Pinkas, "FairplayMP:a system for secure multi-party computation.," In Conference on Computer and communications security (CCS),2008, pp.257-266.
[71]D. Bogdanov, S. Laur, and J. Willemson, "Sharemind:A Framework for Fast Privacy-Preserving Computations," In European Symposium on Research in Computer Security (ESORICS),2008, pp.192-206.
[72]M. Burkhart, M. Strasser, D. Many, and X. Dimitropoulos, "SEPIA:Privacy-Preserving Aggregation of Multi-Domain Network Events and Statistics," In 19th USENIX Security Symposium, August 2010.
[1]林瑶,张娟,王海等译,用TCP/IP进行网际互联,电子工业出版社,2008年4月.
[2]Mogul J.Internet subnets.RFC 917,IETF,1984.
[3]Clark D.Subnetwork addressing scheme.RFC 932,IETF,1985.
[4]GADS.Toward an Internet Standard Scheme for Subnetting.RFC 940,IETF,1985.
[5]Mogul J.Internet Standard Subnetting Procedure.RFC 950,IETF,1985.
[6]赵国峰,基于前缀值的IPv6路由查找算法研究,硕士论文,北京邮电大学,2008.
[7]IANA, Internet Assigned Number Authority, http://www.iana.org/.
[8]ICANN, Corporation for Assigned Names and Numbers, http://www.icann.org/.
[9]Xiaoqiao Meng, Zhiguo Xu, Beichuan Zhang, et al, "IPv4 Address Allocation and the BGP Routing Table Evolution," ACM SIGCOMM Computer Communication Review, vol 31, Jan.2005,pp.71-80.
[10]R. Hinden, S. Deering, and E. Nordmark, "IPv6 Global Unicast Address Format," RFC 3587, Aug.2003.
[11]IEEE, "Guidelines for 64-bit Global Identifier (EUI-64) Registration Authority," http://standards.ieee.org/regauth/oui/tutorials/EUI64.html, March 1997.
[12]IAB and IESG, "IAB/IESG Recommendations on IPv6 Address Allocations to Sites," RFC 3177, Sep.2001.
[13]A. Durand, and C. Huitema, "The H-Density Ratio for Address Assignment Efficiency:An Update on the H ratio," RFC 3194, Nov.2001.
[14]Fan J L, Xu J, Mostafa Ammar, et al, "Prefix-preserving IP Address Anonymization:Measurement based Security Evaluation and a New Cryptography based Scheme," IEEE International Conference on Network Protocols (ICNP),2002, pp.280-289
[15]Minshall G. TCPdpriv Command Manual,1996.
[16]Xu J, Fan J L, Mostafa Ammar, et al, "On the design and performance of prefix-preserving IP traffic trace anonymization," SIGCOMM IMW 2001, pp.263-266.
[17]Ramaswamy R, Wolf T, "High-Speed Prefix-Preserving IP Address Anonymization for Passive Measurement Systems," IEEE/ACM transactions on networking (TON):2007,15(1): 26-39.
[18]Zhang Q L, Wang J L, Li X, "On the Design of Fast Prefix-Preserving IP Address Anonymization Scheme," In Proceedings of International Conferences on Information and Communications Security (ICICS),2007:177-188.
[19]Zhang Q L, Li X, "An IP Address Anonymization Scheme with Multiple Access Levels," In Proceedings of International Conference on Information Networking (ICOIN),2006, pp.793-802.
[20]Bob Jenkins, ISAAC:a fast cryptographic random number generator, online at http://burtleburtle.net/bob/rand/isaac.html
[1]M. Allman and V. Paxson, "Issues and Etiquette Concerning Use of Shared Measurement Data," In Proceedings of the ACM SIGCOMM Internet Measurement Conference,2007, pp.135-140.
[2]S. Coull, C. Wright, F. Monrose, et al, "Playing Devil's Advocate:Inferring Sensitive Information from Anonymized Network Traces," pp.35-47.
[3]D. Koukis, S. Antonatos, and K. Anagnostakis, "On the Privacy Risks of Publishing Anonymized IP Network Traces," In Proceedings of Communications and Multimedia Security, October 2006, pp.22-32.
[4]R. Pang, M. Allman, V. Paxson, and J. Lee, "The Devil and Packet Trace Anonymization.," ACM Computer Communication Review, January 2006,36(1):29-38.
[5]R. Pang and V. Paxson, " A High-Level Environment for Packet Trace Anonymization and Transformation," In Proceedings of the ACM Special Interest Group in Communications (SIGCOM) Conference, August 2003, pp.339-351.
[6]D. J. Kelly, R. A. Raines, M. R. Grimaila, et al. "A survey of state-of-the-art in anonymity metrics," In Proceedings of the ACM Workshop on Network Data Anonymization (NDA), 2008, pp.31-40.
[7]A. Kounine and M. Bezzi. "Assessing Disclosure Risk in Anonymized Datasets.," In Proceedings of FloCon,2008.
[8]D. Koukis, S. Antonatos, and K. G. Anagnostakis. "On the privacy risks of publishing anonymized IP network traces," In Communications and Multimedia Security (CMS),2006, pp.22-32.
[9]S. Coull, C. Wright, F. Monrose, et al, "Taming the Devil:Techniques for evaluating anonymized network data," In Proceedings of the Annual Symposium on Network and Distributed System Security (NDSS), February 2008, pp.125-135.
[10]S. E. Coull, F. Monrose, M. K. Reiter, et al, "The Challenges of Effectively Anonymizing Network Data," In Proceedings of the Cybersecurity Applications & Technology Conference For Homeland Security (CATCH), March 2009, pp.230-236.
[11]M. Burkhart, D. Brauckhoff, and M. May, "On the Utility of Anonymized Flow Traces for Anomaly Detection," In Proceedings of the 19th ITC Specialist Seminar on Network Usage and Traffic, Vol. abs/0810.1655,October 2008.
[12]K. Lakkaraju and A. Slagell, "Evaluating the Utility of Anonymized Network Traces for Intrusion Detection," In Proceedings of the 4th Annual Conference on Security and Privacy in Communication Networks, September 2008, pp.1-8.
[13]T. Cover, J. Thomas, and M. Burns. Elements of Information Theory, Vol.1. Wiley Series in Telecommunications and Signal Processing, John Wiley & Sons, Inc.,2006.
[14]C. Daz, B. Seys, J. Claessens, and B. Preneel, "Towards Measuring Anonymity," In Proceedings of Privacy Enhacing Technologies,2002,pp 54-68.
[15]A. F. Karr, C. N. Kohnen, A. Oganian, et al, "A Framework for Evaluating the Utility of Data Altered to Protect Confidentiality," The American Statistician,2006,60(3):224-232.
[16]M. Woo, J. P. Reiter, A. Oganian, et al, "Global Measures of Data Utility in Microdata Masked for Disclosure Limitation," Journal of Privacy and Confidentiality, pp.111-124.
[17]J. Brickell and V. Shmatikov, "The cost of privacy:destruction of data-mining utility in anonymized data publishing," In KDD,2008, pp.70-78.
[18]Tiancheng Li and Ninghui Li. "On the Trade off Between Privacy and Utility in Data Publishing," In:Proc. of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining,2009. pp.517-526.
[19]YURCIK, W., WOOLAM, C., HELLINGS, et al, "Privacy/Analysis Tradeoffs in Sharing Anonymized Packet Traces:Single-Field Case.," In Third International Conference on Availability, Reliability and Security (ARES) (2008), pp.23-30
[20]M. Burkhart, D. Brauckhoff, and M. May."The Risk-Utility Tradeoff for IP Address Truncation," In Proceedings of the ACM Workshop on Network Data Anonymization,2008. pp.23-30.
[21]Scott Coull, Fabian Monrose, and Michael Bailey, " On Measuring the Similarity of Network Hosts:Pitfalls," New Metrics, and Empirical Analyses. In Proceedings of the 18th Annual Network & Distributed System Security Symposium (NDSS'11), San Diego, California, USA, February 2011.
[22]nProbe, http://www.ntop.org/category/nprobe/
[23]Silk, http://tools.netsa.cert.org/silk/docs.html
[1]Y. Lindell and B. Pinkas, "Secure multiparty computation for privacy preserving data mining," Journal of Privacy and Confidentiality,2009,1(1):59-98.
[2]A. Shamir. How to share a secret. Communications of the ACM,1979,22(11):612-613.
[3]R. Fagin. "Combining fuzzy information from multiple systems," In Proc. of Intl. Symp. on Principles of Database Systems (PODS),1996, pp.216-226.
[4]P. Cao and Z. Wang, "Efficient top-k query calculation in distributed networks," In Proc. of Intl. Symposium on Principles Of Distributed Computing (PODC),2004, pp.206-215.
[5]H. Yu, H.-G. Li, P. Wu, D. Agrawal, and A. E. Abbadi, "Efficient processing of distributed top-k queries," In Proc. of Database and Expert Systems Applications (DEXA),2005, pp. 65-74.
[6]A. Lakhina, M. Crovella, and C. Diot, "Diagnosing network-wide traffic anomalies," In ACM SIGCOMM,2004, pp.219-230.
[7]D. Beaver, S. Micali, and P. Rogaway, "The round complexity of secure protocols," In ACM symposium on Theory of computing (STOC),1990, pp.1-5.
[8]S. Michel, P. Triantafillou and G. Weikum. "KLEE:A framework for distributed top-k query algorithms," VLDB Conf,2005,pp637-648.
[9]M. Burkhart, M. Strasser, D. Many, and X. Dimitropoulos, "SEPIA:Privacy-Preserving Aggregation of Multi-Domain Network Events and Statistics," in 19th USENIX Security Symposium, August 2010.
[10]SEPIA, "Project webpage," http://www.sepia.ee.ethz.ch.
[11]M. Burkhart and X. Dimitropoulos, "Fast privacy-preserving top-k queries using secret sharing," In International Conference on Computer Communications and Networks (ICCCN),2010,pp.1-7.
[12]APPLEBAUM, B., RINGBERG, H., FREEDMAN, M. J., et al, "Collaborative, privacy-preserving data aggregation at scale," In Privacy Enhancing Technologies Symposium (PETS),2010, pp.56-74.
[13]M. Freedman, Y. Ishai, B. Pinkas and O. Reingold. "Keyword Search and Oblivious Pseudorandom Functions," In 2nd Theory of Cryptography Conference (TCC'05) Cambridge, MA, Feb 2005, pp.303-324.
[14]J. Vaidya and C. Clifton, "Privacy-preserving top-k queries," In IEEE International conference on data engineering (ICDE),2005, pp.545-546.
[15]J. Vaidya and C. Clifton, "Privacy-preserving kth element score over vertically partitioned data," IEEE Trans, on Knowl. and Data Eng,2009,21(2):253-258.
[16]Barford P, Kline J, Plonka D, Amos R, "A signal analysis of network traffic anomalies," In: Proc. of the ACM SIGCOMM Internet Measurement Workshop. New York:ACM Press,2002. pp.56-67.
[17]Hussain A, Measurement and spectral analysis of denial of service attacks [Ph.D. Thesis]. Information Sciences Institute,2005.
[18]钱叶魁,陈鸣,叶立新等,“基于多尺度主成分分析的全网络异常检测方法,”软件学报ISSN 1000-9825.
[19]R. Dunia and S. J. Qin, "Multi-dimensional Fault Diagnosis Using a Subspace Approach," In American Control Conference,1997, pp.353-365.
[20]A. Lakhina, M. Crovella, and C. Diot, "Diagnosing Network-Wide Traffic Anomalies," In ACM SIGCOMM, Portland, August 2004, pp.219-230.
[21]Lakhina A, Crovella M, Diot C, "Characterization of network-wide anomalies in traffic flows,' In:Proc. of the ACM Internet Measurement Conf. New York:ACM Press,2004.34-45.
[22]Martin Burkhart, Xenofontas Dimitropoulos, "Privacy-Preserving Distributed Network Troubleshooting-Bridging the Gap between Theory and Practice," ACM Transactions on Information and System Security (TISSEC), Vol.14, No.4, December 2011.
[23]X. Li, F. Bian, M. Crovella, et al, "Detection and identification of network anomaliesusing sketch subspaces," In ACM Internet Measurement Conference (Rio de Janeiro, Brazil, October 2006), pp.147-152.
[24]D. Koukis, S. Antonatos, and K. G. Anagnostakis, "On the privacy risks of publishing anonymized IP network traces," In Proceedings of the International Conference on Communications and Multimedia Security (CMS), volume 4237 of Lecture Notes in Computer Science,2006, pp.22-32.
[25]S. E. Coull, F. Monrose, M. K. Reiter, et al, "The Challenges of Effectively Anonymizing Network Data," In Proceedings of the Cybersecurity Applications & Technology Conference For Homeland Security (CATCH), March 2009, pp.230-236,
[26]Ringberg H, Soule A, Rexford J, Diot C. "Sensitivity of PCA for traffic anomaly detection," In:Proc. of the ACM SIGMETRICS. New York:ACM Press,2007.78-89.
[27]钱叶魁,陈鸣,“基于奇异值分解更新的多元在线异常检测方法,”电子与信息学报,第32卷第10期,2010年10月
[28]Lu W, Ghorbani AA. "Network anomaly detection based on wavelet analysis," EURASIP Journal on Advances in Signal Processing,2009,12(5):1234-1249.
[29]Brauckhoff D, Salamatian K, May M. "Applying PCA for traffic anomaly detection:problems and solutions," In:Proc. of the INFOCOM. New York:IEEE Press,2009.46-53.
[30]A. Soule, H. Ringberg, F. Silveira, et al, "Detectability of traffic anomalies in two adjacent networks," In PAM,2007, pp.22-31.
[31]Ling Huang, XuanLong Nguyen, Minos Garofalakis, "In-Network PCA and Anomaly Detection," In Advances in Neural Information Processing Systems 19,MIT Press, Cambridge, MA,2007, pp.617-624
[32]Shishir Nagaraja, Virajith Jalaparti, Matthew Caesar, et al, "P3CA:Private Anomaly Detection Across ISP Networks," Privacy Enhancing Technologies, volume 6794 of Lecture Notes in Computer Science,2011, pp.38-56
[33]O. Goldreich, "Secure multi-party computation," Theory of Cryptography Library,1999.
[34]J. Weng, Y. Zhang, and W. Hwang, "Candid covariance-free incremental principal component analysis," In IEEE Trans, on Pattern Analysis and Machine Intelligence,2003, pp.1034-1040.
[35]nProbe, online at http://www.ntop.org/categoiy/nprobe/.
[36]Silk, online at http://tools.netsa.cert.org/silk/docs.html.
[2]Informa. http://www.infonnatandm.com/section/home-page/.
[3]CSI Computer Crime and Security Survey 2009. http://gocsi.com/survey.
[4]A. Hanemann, J. W. Boote, E. L. Boyd, et al, "PerfSONAR:a service oriented architecture for multidomain network monitoring," In Proc. Third International Conference on Service Oriented Computing (ICSOC), vol.3826 of LNCS, Springer-Verlag, Dec.2005, pp.241-254.
[5]杨家海,吴建平,安常青,《互联网络测量理论与应用》,人民邮电出版社,2009年10月
[6]M. Roughan and Y. Zhang, "Privacy-preserving performance measurements," In SIGCOMM workshop on Mining network data (MineNet),2006, pp.329-334.
[7]M, Roughan and Y. Zhang, "Secure distributed data-mining and its application to large-scale network measurements," Computer Communication Review (CCR),2006,36(1):7-14.
[8]Cooperative Association for Internet Data Analysis (CAIDA). Online at http://www.caida.org/
[9]Community Resource for Archiving Wireless Data At Dartmouth (CRAWDAD),2010. Online at http://www.crawdad.org/.
[10]Protected Repository for the Defense of Infrastructure against Cyber Threats (PREDICT).Online at http://www.predict.org.
[11]DHSIELD. Online at http://www.dshield.org/.
[12]Claffy, M. Crovella, T. Friedman, C. Shannon, et al, Community-Oriented Network Measurement Infrastructure (CONMI) Workshop Report. Computer Communication Review (CCR),2006,36(2):41.
[13]G. Iannaccone, C. Diot, D. McAuley, et al, The CoMo White Paper. Intel Research Cambridge, Tech. Rep. September,2004,IRCTR-04-017.
[14]P. Matray, I. Csabai, P. Haga, et al, "Building a prototype for network measurement virtual observatory," In ACM Workshop on Mining network data (MineNet),2007.
[15]J. Quittek, T. Zseby, B. Claise, et al, Requirements for IP Flow Information Export (IPFIX), Internet RFCs, ISSN 2070-1721, RFC 3917,2004.
[16]E. Boschi and B. Trammell. IP Flow Anonymization Support. InternetRFCs, ISSN 2070-1721, RFC 6235,2011.
[17]R. Pang, M. Allman, V. Paxson, et al, "The devil and packet trace anonymization," Computer Communication Review (CCR),36(1):29-38,2006.
[18]J. Fan, J. Xu, M. H. Ammar, et al, "Prefix-preserving IP address anonymization," Comput. Networks,2004,,46(2):253-272.
[19]J. Postel, "Internet Protocol, " RFC0791, Sep.1981.
[20]S. Deering, and R. Hinden, Internet Protocol Version 6 Specification, RFC2460, Dec.1998.
[21]李振强,赵晓宇,马严等,IPv6技术揭秘,人民邮电出版社,北京,2006年4月.
[22]J. King, K. Lakkaraju, and A. Slagell. "A taxonomy and adversarial model for attacks against network log anonymization," In ACM symposium on Applied Computing (SAC),2009, pp.253-272.
[23]D. Koukis, S. Antonatos, and K. G. Anagnostakis, "On the privacy risks of publishing anonymized IP network traces," In Communications and Multimedia Security (CMS),2006, pp.22-32.
[24]M. Burkhart and X. Dimitropoulos, "Privacy-Preserving Distributed Network Troubleshooting-Bridging the Gap between Theory and Practice," ACM Transactions on Information and System Security (TISSEC), Dec.2011,14(4).
[25]Charu C, Aggarwal and Philip S. Yu. "Privacy-Preserving Data Mining:Models and Algorithms," Springer-Verlag,2008,pp.45-61.
[1]Cisco Systems Inc. NetFlow Services Solutions Guide. available at http://www.cisco.com/univercd/cc/td/doc/cisintwk/intsolns/netflsol/nfwhite.pdf.
[2]J. Quittek, T. Zseby, B. Claise, et al, Requirements for IP Flow Information Export (IPFIX). Internet RFCs, ISSN 2070-1721, RFC 3917,2004.
[3]Adam Slagell, Kiran Lakkaraju, and Katherine Luo, "FLAIM:A multi-level anonymization framework for computer and network logs," In Proceedings of the USENIX Large Installation System Administration Conference (LISA), December 2006, pp.63-77.
[4]R. Crawford, M. Bishop, B. Bhumiratana, et al, "Sanitization models and their limitations," In Proceedings of the Workshop on New Security Paradigms (NSPW), ACM Press,2007, pp 41-56.
[5]Shantanu Gattani and Thomas E. Daniels, "Reference models for network data anonymization," In Proceedings of the ACM Workshop on Network Data Anonymization (NDA), ACM Press,2008, pp.41-48.
[6]William Yurcik, Clay Woolam, Greg Hellings, et al, "Toward trusted sharing of network packet traces using anonymization:Single-field privacy/analysis tradeoffs," Technical Report 0710.3979v2, arXiv,2007.
[7]Greg Minshall. "TCPdPriv:Program for eliminating confidential information from traces," 2005, Ipsilon Networks, Inc. On line at http://ita.ee.lbl.gov/html/contrib/tcpdpriv.html.
[8]Jinliang Fan, Jun Xu, Mostafa H. Ammar, at al, "Prefix-preserving IP address anonymization: measurement-based security evaluation and a new cryptography-based scheme," In Proceedings of the IEEE International Conference on Network Protocols (ICNP) November 2002, pp 280-289.
[9]J. Fan, J. Xu, M. H. Ammar, et al, Moon,'Prefix-preserving IP address anonymization,' Comput. Networks,2004,46(2):253-272.
[10]Ethan Blanton. TCPurify:A "sanitary" sniffer,2000. Online at http://masaka.cs.ohiou.edu/eblanton/tcpurify/.
[11]Y. Li, A. Slagell, K. Luo, et al, "Canine:A combined conversion and anonymization tool for processing netfiows for security," In International Conference on Telecommunication Systems Modeling and Analysis,2005, pp 56-61.
[12]M. Foukarakis, D. Antoniades, S. Antonatos, et al. "Flexible and high-performance anonymization of NetFlow records using anontool," In SECURECOMM Conference,2007, pp.33-38.
[13]R. Pang, M. Allman, V. Paxson, et al, "The devil and packet trace anonymization," Computer Communication Review (CCR),2006,36(1):29-38.
[14]Ramaswamy Ramaswamy and Tilman Wolf, "High-speed prefix-preserving IP address anonymization for passive measurement systems," ACM/IEEE Transactions on Networking (TON), January 2007,15(1):26-39.
[15]Qianli Zhang and Xing Li, "An IP address anonymization scheme with multiple access levels," In Proceedings of Information Networking:Advances in Data Communications and Wireless Networks (ICOIN), volume 3961 of Lecture Notes in Computer Science. Springer-Verlag, 2006, pp.793-802.
[16]Scott E. Coull, Fabian Monrose and Michael D. Bailey, "The Challenges of Effectively Anonymizing Network Data," In Proceedings of the Cybersecurity Applications & Technology Conference For Homeland Security (CATCH), March 2009, pp 230-236.
[17]J. King, K. Lakkaraju, and A. Slagell, "A taxonomy and adversarial model for attacks against network log anonymization," In ACM symposium on Applied Computing (SAC),2009, pp.1286-1293.
[18]T(?)nnes Brekne, Andre'A°rnes, and Arne (?)sleb(?), "Anonymization of IP traffic monitoring data:Attacks on two prefix-preserving anonymization schemes and some proposed remedies," In Proceedings of the International Symposium on Privacy Enhancing Technologies (PET), volume 3856 of Lecture Notes in Computer Science. Springer-Verlag,2005, pp.179-196.
[19]Scott E. Coull, Charles V. Wright, Fabian Monrose, et al, "Playing Devil's advocate:Inferring sensitive information from anonymized network traces," In Proceedings of the Annual Symposium on Network and Distributed System Security (NDSS). IEEE Press, February 2007, pp.35-47.
[20]Phil Fazio, Keren Tan, Jihwang Yeo, et al, "The NetSANI framework for analysis and fine-tuning of network trace sanitization," In Proceedings of the ACM Conference on Wireless Network Security (WiSec). ACM Press, June 2011, pp.5-10.
[21]D. Koukis, S. Antonatos, and K. G. Anagnostakis. "On the privacy risks of publishing anonymized IP network traces," In Communications and Multimedia Security (CMS), 2006, pp.22-32.
[22]D. J. Kelly, R. A. Raines, M. R. Grimaila, et al, "A survey of state-of-the-art in anonymity metrics," In Proceedings of the ACM Workshop on Network Data Anonymization (NDA), 2008, pp.31-40.
[23]K. Tan, J. Yeo, M. E. Locasto, et al, "Catch, clean, and release:A survey of obstacles and opportunities for network trace sanitization," In Privacy-Aware Knowledge Discovery:Novel Applications and New Techniques. Chapman and Hall/CRC Press, December 2010, pp.111-141.
[24]G. Duncan and D. Lambert, "The risk of disclosure for microdata,"Journal of Business& Economic Statistics, vol.7, p.207, xx1989,10.2307/1391438.
[25]T. M. Truta, F. Fotouhi, and D. Barth-Jones, "Assessing global disclosure risk in masked microdata," in WPES'04:Proceedings of the 2004 ACM workshop on Privacy in the electronic society. New York, NY, USA:ACM Press,2004, pp.85-93.
[26]C. J. Skinner and M. J. Elliot, "A measure of disclosure risk for microdata," Journal of the Royal Statistical Society:Series B (Statistical Methodology), vol.64, no.4,2002, pp. 855-867.
[27]周水庚,李丰,陶宇飞等,“面向数据库应用的隐私保护研究综述”,计算机学报,2009年第5期
[28]L. Sweeney, "k-anonymity:a model for protecting privacy," International Journal on Uncertainty, Fuzziness and Knowledge-based Systems,2002,10(5):557-570.
[29]Raymond Chi-Wing Wong, J. Li, Ada Wai-Chee Fu and K. Wang, "(a,k)-Anonymity:An Enhanced k-Anonymity Model for Privacy-Preserving Data Publishing.," In Proc. of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD), Philadelphia, PA, USA,2006:754-759.
[30]A. Machanavajjhala, J. Gehrke, D. Kifer, et al, "1-Diversity:Privacy Beyond k-Anonymity," In 22nd International Conference on Data Engineering, Atlanta, Georgia, USA,2006, pp.24-30.
[31]N. Li, T. Li, and S. Venkatasubramanian, "t-Closeness:Privacy Beyond k-Anonymity and 1-Diversity," In IEEE 23rd International Conference on Data Engineering,2007, pp.106-115.
[32]N. Li and T. Li, "t-closeness:Privacy beyond k-anonymity and 1-diversity," In Proc. of the 23rd International Conference on Data Engineering (ICDE), Istanbul, Turkey,2007:106-115.
[33]X. Xiao and Y. Tao, "Personalized privacy preservation," In Proc. of the ACM SIGMOD Conference on Management of Data (SIGMOD), Atlanta, Georgia, USA,2006:229-240.
[34]M. Burkhart, D. Brauckhoff, M. May,et al. "The risk-utility tradeoff for IP address truncation.," In ACM Workshop on Network Data Anonymization (NDA), Oct.2008, pp.23-30.
[35]A. Kounine and M. Bezzi. "Assessing disclosure risk in anonymized datasets," In FloCon 2008, January 2008.
[36]S. E. Coull, C. V. Wright, A. D. Keromytis, et al, "Taming the Devil:Techniques for Evaluating Anonymized Network Data.'Tn Proceedings of the 15th Network and Distributed Systems Security Symposium,2008, pp.125-135.
[37]Scott Coull, Fabian Monrose, and Michael Bailey, "On Measuring the Similarity of Network Hosts:Pitfalls, New Metrics, and Empirical Analyses," In Proceedings of the 18th Annual Network & Distributed System Security Symposium (NDSS'11), San Diego, California, USA, February 2011, pp.112-119.
[38]M. Burkhart, D. Brauckhoff, and M. May, "On the utility of anonymized flow traces for anomaly detection," In 19th ITC Specialist Seminar on Network Usage and Traffic (ITC SS 19), Berlin, Germany, Oct.2008, pp.223-231.
[39]M. Woo, J. Reiter, A. Oganian, and A. Karr, "Global measures of data utility for microdata masked for disclosure limitation," Journal of Privacy and Confidentiality,2009,1(1):7.
[40]G. Duncan, S. Keller-McNulty, and S. Stokes, "Disclosure risk versus data utility:The RU confidentiality map," Technical paper, Los Alamos National Laboratory, Los Alamos, NM, 2001,pp39-45.
[41]A. Yao, "Protocols for secure computations," In IEEE Symposium on Foundations of Computer Science,1982, pp.160-164.
[42]O. Goldreich, S. Micali, and A. Wigderson, "How to play any mental game," In ACM symposium on Theory of computing (STOC),1987.
[43]刘木兰,张志芳,《密钥共享体制和安全多方计算》,电子工业出版社,2008
[44]A. Shamir, "How to share a secret," Communications of the ACM 1979,22(11):612-613,
[45]G.R.Blaldey, "Safeguarding cryptographic Keys," In Proceedings of National ComPuter Conference,1979, Newyork,48:313-317.
[46]M. O. Rabin, "How to exchange secrets by oblivious transfer," Technical Report TR-81, Harvard Aiken Computation Laboratory,1981.
[47]Kilian J, "Founding cryptography on oblivious transfer," In proceedings of 20th ACM symposium on Theory of Computing,1988, pp.20-31.
[48]Cheng-Kang Chu and Wen-Guey Tzeng, "Efficient k-out-of-n oblivious transfer schemes with adaptive and nonadaptive queries," In PKC'05, volume 3386 of LNCS,2005, pp.172-183.
[49]Moni Naor and Benny Pinkas, "Oblivious transfer with adaptive queries," In CRYPTO'99, volume 1666 of LNCS,1999, pp.573-590.
[50]EIGamal T,"A Public key cryptosystem and a signature scheme based on discrete logarithms," IEEETrans.Inform.Theory,1985, pp.469-472.
[51]Goldwasser S and Micali S, "Probabilistic eneryption & how to play mental poker keeping secret all partial information," In:Proe. the 14th anual ACM Symposium on Theory of Computing. SanFrancisco California,1982, pp.365-377.
[52]Paillier P, "Public-Key cryptosystems based on composite degree residuosity classes," In:J. Stern(Ed):EUROCRYPT'99, LNCS 1592. Springer-Verlag,1999, pp.223-238.
[53]Z. Beerliov'a-Trubrniov'a and M. Hirt, "Perfectly-secure MPC with linear communication complexity," In Theory of Cryptography Conference (TCC),2008, pp.213-230.
[54]D. Beaver, S. Micali, and P. Rogaway, "The round complexity of secure protocols," In ACM symposium on Theory of computing (STOC),1991, pp.1-5.
[55]I. Damgard, M. Geisler, M. Kr(?)igaard, et al, "Asynchronous multiparty computation:Theory and implementation," In Conference on Practice and Theory in Public Key Cryptography (PKC),2009, pp.160-179.
[56]M. Ben-Or, S. Goldwasser, and A.Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computation," In ACM symposium on Theory of computing (STOC),1988, pp.1-10.
[57]荆巍巍,安全多方计算中若干基础协议及应用的研究,博士论文,中国科技大学,2008.
[58]赵洋,安全多方计算及其应用协议研究,博士论文,电子科技大学,2009
[59]R. Canetti, "Universally composable security:A new paradigm for cryptographic protocols," In IEEE Symposium on Foundations of Computer Science (FOCS),2001, pp136-145.
[60]D. Chaum, C. Cr'epeau, and I. Damgard, "Multiparty unconditionally secure protocols," In ACM Symposium on Theory of Computing (STOC),1988, pp.11-19
[61]M. J. Freedman, K. Nissim, and B. Pinkas, "Efficient private matching and set intersection," In EUROCRYPT,2004, pp.1-19
[62]Y. Sang, H. Shen, Y. Tan, and N. Xiong, "Efficient protocols for privacy preserving matching against distributed datasets," In Information and Communications Security (ICICS),2006, pp.210-227.
[63]Y. Lindell and B. Pinkas, "Secure multiparty computation for privacypreserving data mining," Journal of Privacy and Confidentiality,2009, 1(1):59-98.
[64]V. Verykios, E. Bertino, I. Fovino Y. Theodoridis, "State-of-the-art in privacy preserving data mining," ACM Sigmod Record,2004,33(1):50-57.
[65]M. Roughan and Y. Zhang, "Secure distributed data-mining and its application to large-scale network measurements," Computer Communication Review (CCR),2006,36(1):7-14.
[66]朱珂,姚重俭,朱培栋,卢锡城,基于安全多方计算的BGP策略冲突检测算.计算机工程与科学,2006年第28卷第12期,2006.
[67]APPLEBAUM, B., RINGBERG, H., FREEDMAN, M. J., et al, "Collaborative, privacy-preserving data aggregation at scale," In Privacy Enhancing Technologies Symposium (PETS),2010, pp.56-74.
[68]BURKHART, M., AND DIMITROPOULOS, X, "Fast privacy-preserving top-k queries using secret sharing," In International Conference on Computer Communication Networks (ICCCN), 2010, pp.1-7.
[69]Shishir Nagaraja, Virajith Jalaparti, Matthew Caesar, et al, "P3CA:Private Anomaly Detection Across ISP Networks," Privacy Enhancing Technologies, volume 6794 of Lecture Notes in Computer Science,2011, pp.38-56.
[70]A. Ben-David, N. Nisan, and B. Pinkas, "FairplayMP:a system for secure multi-party computation.," In Conference on Computer and communications security (CCS),2008, pp.257-266.
[71]D. Bogdanov, S. Laur, and J. Willemson, "Sharemind:A Framework for Fast Privacy-Preserving Computations," In European Symposium on Research in Computer Security (ESORICS),2008, pp.192-206.
[72]M. Burkhart, M. Strasser, D. Many, and X. Dimitropoulos, "SEPIA:Privacy-Preserving Aggregation of Multi-Domain Network Events and Statistics," In 19th USENIX Security Symposium, August 2010.
[1]林瑶,张娟,王海等译,用TCP/IP进行网际互联,电子工业出版社,2008年4月.
[2]Mogul J.Internet subnets.RFC 917,IETF,1984.
[3]Clark D.Subnetwork addressing scheme.RFC 932,IETF,1985.
[4]GADS.Toward an Internet Standard Scheme for Subnetting.RFC 940,IETF,1985.
[5]Mogul J.Internet Standard Subnetting Procedure.RFC 950,IETF,1985.
[6]赵国峰,基于前缀值的IPv6路由查找算法研究,硕士论文,北京邮电大学,2008.
[7]IANA, Internet Assigned Number Authority, http://www.iana.org/.
[8]ICANN, Corporation for Assigned Names and Numbers, http://www.icann.org/.
[9]Xiaoqiao Meng, Zhiguo Xu, Beichuan Zhang, et al, "IPv4 Address Allocation and the BGP Routing Table Evolution," ACM SIGCOMM Computer Communication Review, vol 31, Jan.2005,pp.71-80.
[10]R. Hinden, S. Deering, and E. Nordmark, "IPv6 Global Unicast Address Format," RFC 3587, Aug.2003.
[11]IEEE, "Guidelines for 64-bit Global Identifier (EUI-64) Registration Authority," http://standards.ieee.org/regauth/oui/tutorials/EUI64.html, March 1997.
[12]IAB and IESG, "IAB/IESG Recommendations on IPv6 Address Allocations to Sites," RFC 3177, Sep.2001.
[13]A. Durand, and C. Huitema, "The H-Density Ratio for Address Assignment Efficiency:An Update on the H ratio," RFC 3194, Nov.2001.
[14]Fan J L, Xu J, Mostafa Ammar, et al, "Prefix-preserving IP Address Anonymization:Measurement based Security Evaluation and a New Cryptography based Scheme," IEEE International Conference on Network Protocols (ICNP),2002, pp.280-289
[15]Minshall G. TCPdpriv Command Manual,1996.
[16]Xu J, Fan J L, Mostafa Ammar, et al, "On the design and performance of prefix-preserving IP traffic trace anonymization," SIGCOMM IMW 2001, pp.263-266.
[17]Ramaswamy R, Wolf T, "High-Speed Prefix-Preserving IP Address Anonymization for Passive Measurement Systems," IEEE/ACM transactions on networking (TON):2007,15(1): 26-39.
[18]Zhang Q L, Wang J L, Li X, "On the Design of Fast Prefix-Preserving IP Address Anonymization Scheme," In Proceedings of International Conferences on Information and Communications Security (ICICS),2007:177-188.
[19]Zhang Q L, Li X, "An IP Address Anonymization Scheme with Multiple Access Levels," In Proceedings of International Conference on Information Networking (ICOIN),2006, pp.793-802.
[20]Bob Jenkins, ISAAC:a fast cryptographic random number generator, online at http://burtleburtle.net/bob/rand/isaac.html
[1]M. Allman and V. Paxson, "Issues and Etiquette Concerning Use of Shared Measurement Data," In Proceedings of the ACM SIGCOMM Internet Measurement Conference,2007, pp.135-140.
[2]S. Coull, C. Wright, F. Monrose, et al, "Playing Devil's Advocate:Inferring Sensitive Information from Anonymized Network Traces," pp.35-47.
[3]D. Koukis, S. Antonatos, and K. Anagnostakis, "On the Privacy Risks of Publishing Anonymized IP Network Traces," In Proceedings of Communications and Multimedia Security, October 2006, pp.22-32.
[4]R. Pang, M. Allman, V. Paxson, and J. Lee, "The Devil and Packet Trace Anonymization.," ACM Computer Communication Review, January 2006,36(1):29-38.
[5]R. Pang and V. Paxson, " A High-Level Environment for Packet Trace Anonymization and Transformation," In Proceedings of the ACM Special Interest Group in Communications (SIGCOM) Conference, August 2003, pp.339-351.
[6]D. J. Kelly, R. A. Raines, M. R. Grimaila, et al. "A survey of state-of-the-art in anonymity metrics," In Proceedings of the ACM Workshop on Network Data Anonymization (NDA), 2008, pp.31-40.
[7]A. Kounine and M. Bezzi. "Assessing Disclosure Risk in Anonymized Datasets.," In Proceedings of FloCon,2008.
[8]D. Koukis, S. Antonatos, and K. G. Anagnostakis. "On the privacy risks of publishing anonymized IP network traces," In Communications and Multimedia Security (CMS),2006, pp.22-32.
[9]S. Coull, C. Wright, F. Monrose, et al, "Taming the Devil:Techniques for evaluating anonymized network data," In Proceedings of the Annual Symposium on Network and Distributed System Security (NDSS), February 2008, pp.125-135.
[10]S. E. Coull, F. Monrose, M. K. Reiter, et al, "The Challenges of Effectively Anonymizing Network Data," In Proceedings of the Cybersecurity Applications & Technology Conference For Homeland Security (CATCH), March 2009, pp.230-236.
[11]M. Burkhart, D. Brauckhoff, and M. May, "On the Utility of Anonymized Flow Traces for Anomaly Detection," In Proceedings of the 19th ITC Specialist Seminar on Network Usage and Traffic, Vol. abs/0810.1655,October 2008.
[12]K. Lakkaraju and A. Slagell, "Evaluating the Utility of Anonymized Network Traces for Intrusion Detection," In Proceedings of the 4th Annual Conference on Security and Privacy in Communication Networks, September 2008, pp.1-8.
[13]T. Cover, J. Thomas, and M. Burns. Elements of Information Theory, Vol.1. Wiley Series in Telecommunications and Signal Processing, John Wiley & Sons, Inc.,2006.
[14]C. Daz, B. Seys, J. Claessens, and B. Preneel, "Towards Measuring Anonymity," In Proceedings of Privacy Enhacing Technologies,2002,pp 54-68.
[15]A. F. Karr, C. N. Kohnen, A. Oganian, et al, "A Framework for Evaluating the Utility of Data Altered to Protect Confidentiality," The American Statistician,2006,60(3):224-232.
[16]M. Woo, J. P. Reiter, A. Oganian, et al, "Global Measures of Data Utility in Microdata Masked for Disclosure Limitation," Journal of Privacy and Confidentiality, pp.111-124.
[17]J. Brickell and V. Shmatikov, "The cost of privacy:destruction of data-mining utility in anonymized data publishing," In KDD,2008, pp.70-78.
[18]Tiancheng Li and Ninghui Li. "On the Trade off Between Privacy and Utility in Data Publishing," In:Proc. of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining,2009. pp.517-526.
[19]YURCIK, W., WOOLAM, C., HELLINGS, et al, "Privacy/Analysis Tradeoffs in Sharing Anonymized Packet Traces:Single-Field Case.," In Third International Conference on Availability, Reliability and Security (ARES) (2008), pp.23-30
[20]M. Burkhart, D. Brauckhoff, and M. May."The Risk-Utility Tradeoff for IP Address Truncation," In Proceedings of the ACM Workshop on Network Data Anonymization,2008. pp.23-30.
[21]Scott Coull, Fabian Monrose, and Michael Bailey, " On Measuring the Similarity of Network Hosts:Pitfalls," New Metrics, and Empirical Analyses. In Proceedings of the 18th Annual Network & Distributed System Security Symposium (NDSS'11), San Diego, California, USA, February 2011.
[22]nProbe, http://www.ntop.org/category/nprobe/
[23]Silk, http://tools.netsa.cert.org/silk/docs.html
[1]Y. Lindell and B. Pinkas, "Secure multiparty computation for privacy preserving data mining," Journal of Privacy and Confidentiality,2009,1(1):59-98.
[2]A. Shamir. How to share a secret. Communications of the ACM,1979,22(11):612-613.
[3]R. Fagin. "Combining fuzzy information from multiple systems," In Proc. of Intl. Symp. on Principles of Database Systems (PODS),1996, pp.216-226.
[4]P. Cao and Z. Wang, "Efficient top-k query calculation in distributed networks," In Proc. of Intl. Symposium on Principles Of Distributed Computing (PODC),2004, pp.206-215.
[5]H. Yu, H.-G. Li, P. Wu, D. Agrawal, and A. E. Abbadi, "Efficient processing of distributed top-k queries," In Proc. of Database and Expert Systems Applications (DEXA),2005, pp. 65-74.
[6]A. Lakhina, M. Crovella, and C. Diot, "Diagnosing network-wide traffic anomalies," In ACM SIGCOMM,2004, pp.219-230.
[7]D. Beaver, S. Micali, and P. Rogaway, "The round complexity of secure protocols," In ACM symposium on Theory of computing (STOC),1990, pp.1-5.
[8]S. Michel, P. Triantafillou and G. Weikum. "KLEE:A framework for distributed top-k query algorithms," VLDB Conf,2005,pp637-648.
[9]M. Burkhart, M. Strasser, D. Many, and X. Dimitropoulos, "SEPIA:Privacy-Preserving Aggregation of Multi-Domain Network Events and Statistics," in 19th USENIX Security Symposium, August 2010.
[10]SEPIA, "Project webpage," http://www.sepia.ee.ethz.ch.
[11]M. Burkhart and X. Dimitropoulos, "Fast privacy-preserving top-k queries using secret sharing," In International Conference on Computer Communications and Networks (ICCCN),2010,pp.1-7.
[12]APPLEBAUM, B., RINGBERG, H., FREEDMAN, M. J., et al, "Collaborative, privacy-preserving data aggregation at scale," In Privacy Enhancing Technologies Symposium (PETS),2010, pp.56-74.
[13]M. Freedman, Y. Ishai, B. Pinkas and O. Reingold. "Keyword Search and Oblivious Pseudorandom Functions," In 2nd Theory of Cryptography Conference (TCC'05) Cambridge, MA, Feb 2005, pp.303-324.
[14]J. Vaidya and C. Clifton, "Privacy-preserving top-k queries," In IEEE International conference on data engineering (ICDE),2005, pp.545-546.
[15]J. Vaidya and C. Clifton, "Privacy-preserving kth element score over vertically partitioned data," IEEE Trans, on Knowl. and Data Eng,2009,21(2):253-258.
[16]Barford P, Kline J, Plonka D, Amos R, "A signal analysis of network traffic anomalies," In: Proc. of the ACM SIGCOMM Internet Measurement Workshop. New York:ACM Press,2002. pp.56-67.
[17]Hussain A, Measurement and spectral analysis of denial of service attacks [Ph.D. Thesis]. Information Sciences Institute,2005.
[18]钱叶魁,陈鸣,叶立新等,“基于多尺度主成分分析的全网络异常检测方法,”软件学报ISSN 1000-9825.
[19]R. Dunia and S. J. Qin, "Multi-dimensional Fault Diagnosis Using a Subspace Approach," In American Control Conference,1997, pp.353-365.
[20]A. Lakhina, M. Crovella, and C. Diot, "Diagnosing Network-Wide Traffic Anomalies," In ACM SIGCOMM, Portland, August 2004, pp.219-230.
[21]Lakhina A, Crovella M, Diot C, "Characterization of network-wide anomalies in traffic flows,' In:Proc. of the ACM Internet Measurement Conf. New York:ACM Press,2004.34-45.
[22]Martin Burkhart, Xenofontas Dimitropoulos, "Privacy-Preserving Distributed Network Troubleshooting-Bridging the Gap between Theory and Practice," ACM Transactions on Information and System Security (TISSEC), Vol.14, No.4, December 2011.
[23]X. Li, F. Bian, M. Crovella, et al, "Detection and identification of network anomaliesusing sketch subspaces," In ACM Internet Measurement Conference (Rio de Janeiro, Brazil, October 2006), pp.147-152.
[24]D. Koukis, S. Antonatos, and K. G. Anagnostakis, "On the privacy risks of publishing anonymized IP network traces," In Proceedings of the International Conference on Communications and Multimedia Security (CMS), volume 4237 of Lecture Notes in Computer Science,2006, pp.22-32.
[25]S. E. Coull, F. Monrose, M. K. Reiter, et al, "The Challenges of Effectively Anonymizing Network Data," In Proceedings of the Cybersecurity Applications & Technology Conference For Homeland Security (CATCH), March 2009, pp.230-236,
[26]Ringberg H, Soule A, Rexford J, Diot C. "Sensitivity of PCA for traffic anomaly detection," In:Proc. of the ACM SIGMETRICS. New York:ACM Press,2007.78-89.
[27]钱叶魁,陈鸣,“基于奇异值分解更新的多元在线异常检测方法,”电子与信息学报,第32卷第10期,2010年10月
[28]Lu W, Ghorbani AA. "Network anomaly detection based on wavelet analysis," EURASIP Journal on Advances in Signal Processing,2009,12(5):1234-1249.
[29]Brauckhoff D, Salamatian K, May M. "Applying PCA for traffic anomaly detection:problems and solutions," In:Proc. of the INFOCOM. New York:IEEE Press,2009.46-53.
[30]A. Soule, H. Ringberg, F. Silveira, et al, "Detectability of traffic anomalies in two adjacent networks," In PAM,2007, pp.22-31.
[31]Ling Huang, XuanLong Nguyen, Minos Garofalakis, "In-Network PCA and Anomaly Detection," In Advances in Neural Information Processing Systems 19,MIT Press, Cambridge, MA,2007, pp.617-624
[32]Shishir Nagaraja, Virajith Jalaparti, Matthew Caesar, et al, "P3CA:Private Anomaly Detection Across ISP Networks," Privacy Enhancing Technologies, volume 6794 of Lecture Notes in Computer Science,2011, pp.38-56
[33]O. Goldreich, "Secure multi-party computation," Theory of Cryptography Library,1999.
[34]J. Weng, Y. Zhang, and W. Hwang, "Candid covariance-free incremental principal component analysis," In IEEE Trans, on Pattern Analysis and Machine Intelligence,2003, pp.1034-1040.
[35]nProbe, online at http://www.ntop.org/categoiy/nprobe/.
[36]Silk, online at http://tools.netsa.cert.org/silk/docs.html.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |