P3CA: Private Anomaly Detection Across ISP Networks
暂无分享,去创建一个
Nikita Borisov | Matthew Caesar | Virajith Jalaparti | Shishir Nagaraja | N. Borisov | Shishir Nagaraja | Virajith Jalaparti | M. Caesar
[1] Mark Crovella,et al. Mining anomalies using traffic feature distributions , 2005, SIGCOMM '05.
[2] Walter Fumy,et al. Advances in Cryptology — EUROCRYPT ’97 , 2001, Lecture Notes in Computer Science.
[3] Nick Feamster,et al. Diagnosing network disruptions with network-wide analysis , 2007, SIGMETRICS '07.
[4] J. E. Jackson,et al. Control Procedures for Residuals Associated With Principal Component Analysis , 1979 .
[5] Yitao Duan,et al. P4P: Practical Large-Scale Privacy-Preserving Distributed Computation Robust against Malicious Users , 2010, USENIX Security Symposium.
[6] Richard J. Lipton,et al. Foundations of Secure Computation , 1978 .
[7] Benny Pinkas,et al. Secure computation of the kth-ranked element , 2004 .
[8] Yakov Rekhter,et al. A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.
[9] Yuval Ishai,et al. Scalable Multiparty Computation with Nearly Optimal Work and Resilience , 2008, CRYPTO.
[10] Michael I. Jordan,et al. Detecting large-scale system problems by mining console logs , 2009, SOSP '09.
[11] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[12] Juyang Weng,et al. Candid Covariance-Free Incremental Principal Component Analysis , 2003, IEEE Trans. Pattern Anal. Mach. Intell..
[13] Martijn Stam. Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions , 2008, CRYPTO.
[14] Eike Kiltz,et al. Secure Linear Algebra Using Linearly Recurrent Sequences , 2007, Complexity of Boolean Functions.
[15] Gerard L. G. Sleijpen,et al. A generalized Jacobi-Davidson iteration method for linear eigenvalue problems , 1998 .
[16] Ronald L. Rivest,et al. ON DATA BANKS AND PRIVACY HOMOMORPHISMS , 1978 .
[17] Fernando Silveira,et al. Detectability of Traffic Anomalies in Two Adjacent Networks , 2007, PAM.
[18] Leonid A. Levin,et al. Fair Computation of General Functions in Presence of Immoral Majority , 1990, CRYPTO.
[19] Yehuda Lindell,et al. Secure Multiparty Computation for Privacy-Preserving Data Mining , 2009, IACR Cryptol. ePrint Arch..
[20] Joan Feigenbaum,et al. Advances in Cryptology-Crypto 91 , 1992 .
[21] Heidrun Schumann,et al. Intelligent interactive assistance and mobile multimedia computing , 2001, Comput. Graph..
[22] Ivan Damgård,et al. A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System , 2001, Public Key Cryptography.
[23] Danny C. Sorensen,et al. Deflation Techniques for an Implicitly Restarted Arnoldi Iteration , 1996, SIAM J. Matrix Anal. Appl..
[24] Ling Huang,et al. ANTIDOTE: understanding and defending against poisoning of anomaly detectors , 2009, IMC '09.
[25] Benoit Claise,et al. Cisco Systems NetFlow Services Export Version 9 , 2004, RFC.
[26] Mark Crovella,et al. Diagnosing network-wide traffic anomalies , 2004, SIGCOMM '04.
[27] Arto Salomaa,et al. Public-Key Cryptography , 1991, EATCS Monographs on Theoretical Computer Science.
[28] Jennifer Rexford,et al. Sensitivity of PCA for traffic anomaly detection , 2007, SIGMETRICS '07.
[29] P. Filzmoser,et al. Algorithms for Projection-Pursuit Robust Principal Component Analysis , 2007 .
[30] Cynthia Dwork,et al. Advances in Cryptology – CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part III , 2020, Annual International Cryptology Conference.
[31] Rangarajan Vasudevan,et al. Reval: A Tool for Real-time Evaluation of DDoS Mitigation Strategies , 2006, USENIX Annual Technical Conference, General Track.
[32] Andrew Chi-Chih Yao,et al. Protocols for Secure Computations (Extended Abstract) , 1982, FOCS.
[33] Marina Blanton,et al. Secure Multiparty Computation , 2011, Encyclopedia of Cryptography and Security.
[34] C. Croux,et al. Principal Component Analysis Based on Robust Estimators of the Covariance or Correlation Matrix: Influence Functions and Efficiencies , 2000 .
[35] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[36] Moni Naor,et al. Adaptively secure multi-party computation , 1996, STOC '96.
[37] Albert G. Greenberg,et al. Network anomography , 2005, IMC '05.
[38] Benny Pinkas,et al. Secure Computation of the k th-Ranked Element , 2004, EUROCRYPT.
[39] Hao Chen,et al. Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields , 2006, CRYPTO.
[40] Gerard L. G. Sleijpen,et al. A Jacobi-Davidson Iteration Method for Linear Eigenvalue Problems , 1996, SIAM Rev..
[41] Fernando Silveira,et al. URCA: Pulling out Anomalies by their Root Causes , 2010, 2010 Proceedings IEEE INFOCOM.
[42] Donald Beaver,et al. Multiparty Computation with Faulty Majority , 1989, CRYPTO.
[43] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[44] Michael Wiener,et al. Advances in Cryptology — CRYPTO’ 99 , 1999 .