The Embedding Capacity of Information Flows Under Renewal Traffic
暂无分享,去创建一个
Lang Tong | Stefano Maranò | Ting He | Vincenzo Matta | L. Tong | T. He | S. Maranò | V. Matta
[1] Lang Tong,et al. Embedding covert information flow , 2010, 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers.
[2] H. Vincent Poor,et al. The Evolution of Online Social Networks: A tutorial survey , 2012, IEEE Signal Processing Magazine.
[3] Konstantina Papagiannaki,et al. Measurement and analysis of single-hop delay on an IP backbone network , 2003, IEEE J. Sel. Areas Commun..
[4] H. Vincent Poor,et al. Multiple-Access Channels With Confidential Messages , 2008, IEEE Transactions on Information Theory.
[5] Lang Tong,et al. Anonymous Networking Amidst Eavesdroppers , 2008, IEEE Transactions on Information Theory.
[6] J. Gates. Introduction to Probability and its Applications , 1992 .
[7] J. Radok,et al. Singular Integral Equations: Boundary problems of functions theory and their applications to mathematical physics , 1977 .
[8] Lang Tong,et al. Embedding information flows into renewal traffic , 2011, 2011 IEEE Information Theory Workshop.
[9] Peter Dayan,et al. Theoretical Neuroscience: Computational and Mathematical Modeling of Neural Systems , 2001 .
[10] Jean-François Raymond,et al. Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems , 2000, Workshop on Design Issues in Anonymity and Unobservability.
[11] Z. A. Lomnicki,et al. Mathematical Theory of Reliability , 1966 .
[12] H. Carlsson. Remainder Term Estimates of the Renewal Function , 1983 .
[13] Stephen T. Kent,et al. Security Mechanisms in High-Level Network Protocols , 1983, CSUR.
[14] A. D. Wyner,et al. The wire-tap channel , 1975, The Bell System Technical Journal.
[15] Riccardo Bettati,et al. On Flow Correlation Attacks and Countermeasures in Mix Networks , 2004, Privacy Enhancing Technologies.
[16] R.N. Bracewell,et al. Signal analysis , 1978, Proceedings of the IEEE.
[17] William Feller,et al. A simple proof for renewal theorems , 1961 .
[18] S. Lang. Complex Analysis , 1977 .
[19] Jie Gao,et al. Detecting Wormhole Attacks in Wireless Networks Using Connectivity Information , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[20] V. Paxson,et al. Wide-area traffic: the failure of Poisson modeling , 1994, SIGCOMM.
[21] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..
[22] Ananthram Swami,et al. Maximum throughput of clandestine relay , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[23] Massimo Franceschetti,et al. Wiretap Channel With Secure Rate-Limited Feedback , 2009, IEEE Transactions on Information Theory.
[24] Hidenori Morimura,et al. On a renewal theorem , 1956 .
[25] George Weiss,et al. Methods Based on the Wiener-Hopf Technique for the Solution of Partial Differential Equations , 1958 .
[26] A. Pipkin,et al. A Course on Integral Equations , 1991 .
[27] Bernd Wilfling,et al. A sufficient condition for Lorenz ordering , 1996 .
[28] Ilkka Norros,et al. On the Use of Fractional Brownian Motion in the Theory of Connectionless Networks , 1995, IEEE J. Sel. Areas Commun..
[29] Jin Xu,et al. Capacity Bounds for Broadcast Channels With Confidential Messages , 2009, IEEE Transactions on Information Theory.
[30] Sally Floyd,et al. Wide area traffic: the failure of Poisson modeling , 1995, TNET.
[31] Bruce Hajek,et al. Hiding traffic flow in communication networks , 1992, MILCOM 92 Conference Record.
[32] Peter W. Glynn,et al. Estimation of stationary densities for Markov chains , 1998, 1998 Winter Simulation Conference. Proceedings (Cat. No.98CH36274).
[33] J. Norris. Appendix: probability and measure , 1997 .
[34] Imre Csiszár,et al. Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.
[35] M. J. Lighthill,et al. Diffraction by a wave-guide of finite length , 1952, Mathematical Proceedings of the Cambridge Philosophical Society.
[36] Lang Tong,et al. Distributed Detection of Multi-Hop Information Flows With Fusion Capacity Constraints , 2010, IEEE Transactions on Signal Processing.
[37] Shlomo Shamai,et al. Secure Communication Over Fading Channels , 2007, IEEE Transactions on Information Theory.
[38] Malcolm R Leadbetter,et al. On the Renewal Function for the Weibull Distribution , 1963 .
[39] Stuart Staniford-Chen,et al. Holding intruders accountable on the Internet , 1995, Proceedings 1995 IEEE Symposium on Security and Privacy.
[40] T. Sejnowski,et al. Reliability of spike timing in neocortical neurons. , 1995, Science.
[41] Amos Lapidoth,et al. A Foundation In Digital Communication: Index , 2009 .
[42] Lang Tong,et al. Distributed Detection of Information Flows , 2008, IEEE Transactions on Information Forensics and Security.
[43] Lang Tong,et al. Detection of Information Flows , 2008, IEEE Transactions on Information Theory.
[44] Richard L. Tweedie,et al. Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.
[45] Vern Paxson,et al. Multiscale Stepping-Stone Detection: Detecting Pairs of Jittered Interactive Streams by Exploiting Maximum Tolerable Delay , 2002, RAID.
[46] Dawn Xiaodong Song,et al. Detection of Interactive Stepping Stones: Algorithms and Confidence Bounds , 2004, RAID.
[47] David Chaum,et al. Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.
[48] Lang Tong,et al. On security-aware transmission scheduling , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.
[49] Ronald N. Bracewell,et al. The Fourier Transform and Its Applications , 1966 .