메뉴 건너뛰기




Volumn 59, Issue 3, 2013, Pages 1724-1739

The embedding capacity of information flows under renewal traffic

Author keywords

Embedding capacity; information flow; intrusion detection and security; point processes and inference; Riemann Hilbert problem

Indexed keywords

ANALYTICAL EXPRESSIONS; APPLICATION CONTEXTS; CERTAIN RULE; CLOSED FORM SOLUTIONS; DELAY CONSTRAINTS; EMBEDDING CAPACITY; INFORMATION FLOWS; MATCHED POINTS; MATCHING POINTS; MATCHING RULES; MAXIMUM FLOWS; POINT PROCESS; REAL NETWORKS; RENEWAL FUNCTIONS; RENEWAL MODEL; RENEWAL PROCESS; RIEMANN HILBERT PROBLEMS; SECURE NETWORKING; STRUCTURED LINEAR SYSTEMS; SUFFICIENT CONDITIONS; TIMING ANALYSIS; TRAFFIC MODEL;

EID: 84873934451     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2012.2227672     Document Type: Article
Times cited : (16)

References (48)
  • 3
    • 0029030249 scopus 로고
    • Reliability of spike timing in neocortical neurons
    • Z. F. Mainen and T. J. Sejnowski, "Reliability of spike timing in neocortical neurons," Science, vol. 268, pp. 1503-1506, 1995.
    • (1995) Science , vol.268 , pp. 1503-1506
    • Mainen, Z.F.1    Sejnowski, T.J.2
  • 4
    • 49549085794 scopus 로고    scopus 로고
    • Detection of information flows
    • Nov
    • T. He and L. Tong, "Detection of information flows," IEEE Trans. Inf. Theory, vol. 54, no. 11, pp. 4925-4945, Nov. 2008.
    • (2008) IEEE Trans. Inf. Theory , vol.54 , Issue.11 , pp. 4925-4945
    • He, T.1    Tong, L.2
  • 8
    • 0020762394 scopus 로고
    • Security mechanisms in high-level network protocols
    • V. L. Voydock and S. T. Kent, "Security mechanisms in high-level network protocols," J. ACM Comput. Surveys, vol. 15, pp. 135-171, 1983.
    • (1983) J ACM Comput. Surveys , vol.15 , pp. 135-171
    • Voydock, V.L.1    Kent, S.T.2
  • 11
    • 0019532104 scopus 로고
    • Untraceable electronic mail, return addresses, and digital pseudonyms
    • DOI 10.1145/358549.358563
    • D. Chaum, "Untraceable electronic mail, return addresses and digital pseudonyms," Commun. ACM, vol. 24, no. 2, pp. 84-88, Feb. 1981. (Pubitemid 11480996)
    • (1981) Communications of the ACM , vol.24 , Issue.2 , pp. 84-88
    • Chaum, D.1
  • 12
    • 45249083605 scopus 로고    scopus 로고
    • Anonymous networking amidst eavesdroppers
    • Jun
    • P. Venkitasubramaniam, T. He, and L. Tong, "Anonymous networking amidst eavesdroppers," IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2770-2784, Jun. 2008.
    • (2008) IEEE Trans. Inf. Theory , vol.54 , Issue.6 , pp. 2770-2784
    • Venkitasubramaniam, P.1    He, T.2    Tong, L.3
  • 13
  • 14
    • 24344450770 scopus 로고    scopus 로고
    • On flow correlation attacks and countermeasures in mix networks
    • Privacy Enhancing Technologies - 4th International Workshop, PET 2004
    • Y. Zhu, X. Fu, B. Graham, R. Bettati, and W. Zhao, "On flow correlation attacks and countermeasures in mix networks," in Proc. 4th Int. Conf. Privacy Enhancing Technol. Workshop, May 26-28, 2004, pp. 207-225. (Pubitemid 41252005)
    • (2005) Lecture Notes in Computer Science , vol.3424 , pp. 207-225
    • Zhu, Y.1    Fu, X.2    Graham, B.3    Bettati, R.4    Zhao, W.5
  • 15
    • 34548321774 scopus 로고    scopus 로고
    • Detecting wormhole attacks in wireless networks using connectivity information
    • DOI 10.1109/INFCOM.2007.21, 4215603, Proceedings - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications
    • R. Maheshwari, J. Gao, and S. R. Das, "Detecting wormhole attacks in wireless networks using connectivity information," in Proc. 26th IEEE Int. Conf. Comput. Commun., Anchorage, AK, May 6-12, 2007, pp. 107-115. (Pubitemid 47334221)
    • (2007) Proceedings - IEEE INFOCOM , pp. 107-115
    • Maheshwari, R.1    Gao, J.2    Das, S.R.3
  • 16
    • 84890522850 scopus 로고
    • Communication theory of secrecy systems
    • Oct
    • C. E. Shannon, "Communication theory of secrecy systems," Bell Syst. Tech. J., vol. 28, pp. 656-715, Oct. 1949.
    • (1949) Bell Syst. Tech. J , vol.28 , pp. 656-715
    • Shannon, C.E.1
  • 17
    • 0016562514 scopus 로고
    • The wire-tap channel
    • Oct
    • A. D. Wyner, "The wire-tap channel," AT & T Bell Labs Tech. J., vol. 54, no. 8, pp. 1355-1387, Oct. 1975.
    • (1975) AT & T Bell Labs Tech. J , vol.54 , Issue.8 , pp. 1355-1387
    • Wyner, A.D.1
  • 18
    • 0017973511 scopus 로고
    • Broadcast channels with confidential messages
    • May
    • I. Csiszár and J. Korner, "Broadcast channels with confidential messages," IEEE Trans. Inf. Theory, vol. 24, no. 3, pp. 339-348, May 1978.
    • (1978) IEEE Trans. Inf. Theory , vol.24 , Issue.3 , pp. 339-348
    • Csiszár, I.1    Korner, J.2
  • 19
    • 40949147785 scopus 로고    scopus 로고
    • Multiple-access channels with confidential messages
    • DOI 10.1109/TIT.2007.915978
    • Y. Liang and H. V. Poor, "Multiple-access channels with confidential messages," IEEE Trans. Inf. Theory, vol. 54, no. 3, pp. 976-1002, Mar. 2008. (Pubitemid 351410914)
    • (2008) IEEE Transactions on Information Theory , vol.54 , Issue.3 , pp. 976-1002
    • Liang, Y.1    Poor, H.V.2
  • 20
    • 45249119255 scopus 로고    scopus 로고
    • Secure communication over fading channels
    • Jun
    • Y. Liang, H. V. Poor, and S. Shamai, "Secure communication over fading channels," IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2470-2492, Jun. 2008.
    • (2008) IEEE Trans. Inf. Theory , vol.54 , Issue.6 , pp. 2470-2492
    • Liang, Y.1    Poor, H.V.2    Shamai, S.3
  • 22
    • 70349616112 scopus 로고    scopus 로고
    • Capacity bounds for broadcast channels with confidential messages
    • Oct
    • J. Xu, Y. Cao, and B. Chen, "Capacity bounds for broadcast channels with confidential messages," IEEE Trans. Inf. Theory, vol. 55, no. 10, pp. 4529-4542, Oct. 2009.
    • (2009) IEEE Trans. Inf. Theory , vol.55 , Issue.10 , pp. 4529-4542
    • Xu, J.1    Cao, Y.2    Chen, B.3
  • 23
    • 49549090679 scopus 로고    scopus 로고
    • Distributed detection of information flows
    • Sep
    • T.He and L. Tong, "Distributed detection of information flows," IEEE Trans. Inf. Forensics Security, vol. 3, no. 3, pp. 390-403, Sep. 2008.
    • (2008) IEEE Trans. Inf. Forensics Security , vol.3 , Issue.3 , pp. 390-403
    • He, T.1    Tong, L.2
  • 24
    • 77952561152 scopus 로고    scopus 로고
    • Distributed detection of multi-hop information flows with fusion capacity constraints
    • Jun.
    • T. He, A. Agaskar, and L. Tong, "Distributed detection of multi-hop information flows with fusion capacity constraints," IEEE Trans. Signal Process., vol. 58, no. 6, pp. 3373-3383, Jun. 2010.
    • (2010) IEEE Trans. Signal Process , vol.58 , Issue.6 , pp. 3373-3383
    • He, T.1    Agaskar, A.2    Tong, L.3
  • 27
    • 33745802064 scopus 로고    scopus 로고
    • Detection of interactive stepping stones: Algorithms and confidence bounds
    • Sophia Antipolis, France Sep
    • A. Blum,D. Song, and S.Venkataraman, "Detection of interactive stepping stones: Algorithms and confidence bounds," in Proc. Conf. Recent Adv. Intrus. Detect., Sophia Antipolis, France, Sep. 2004, pp. 39-49.
    • (2004) Proc. Conf. Recent Adv. Intrus. Detect. , pp. 39-49
    • Blum, A.1    Song, D.2    Venkataraman, S.3
  • 31
    • 84956040127 scopus 로고
    • Diffraction by a wave-guide of finite length
    • D. S. Jones, "Diffraction by a wave-guide of finite length," Proc Camb. Phil. Soc., vol. 48, no. 1, pp. 118-134, 1952.
    • (1952) Proc Camb. Phil. Soc , vol.48 , Issue.1 , pp. 118-134
    • Jones, D.S.1
  • 40
    • 0010014049 scopus 로고    scopus 로고
    • A sufficient condition for Lorenz ordering
    • B. Wilfling, "A sufficient condition for Lorenz ordering," Indian J. Statist., vol. 58, pp. 62-69, 1996.
    • (1996) Indian J. Statist , vol.58 , pp. 62-69
    • Wilfling, B.1
  • 41
    • 0029323403 scopus 로고
    • Wide-area traffic: The failure of Poissonmodeling
    • Jun
    • V. Paxson and S. Floyd, "Wide-area traffic: The failure of Poissonmodeling," IEEE/ACM Trans. Netw., vol. 3, no. 3, pp. 226-244, Jun. 1995.
    • (1995) IEEE/ACM Trans. Netw , vol.3 , Issue.3 , pp. 226-244
    • Paxson, V.1    Floyd, S.2
  • 42
    • 0029358766 scopus 로고
    • On the use of fractional Brownian motion in the theory of connectionless networks
    • Aug
    • I. Norros, "On the use of fractional Brownian motion in the theory of connectionless networks," IEEE J. Sel. Areas Commun., vol. 13, no. 6, pp. 953-962, Aug. 1995.
    • (1995) IEEE J. Sel. Areas Commun , vol.13 , Issue.6 , pp. 953-962
    • Norros, I.1
  • 43
    • 0042526013 scopus 로고    scopus 로고
    • Measurement and analysis of single-hop delay on an IP backbone network
    • Aug
    • K. Papagiannaki, S. Moon, C. Fraleigh, P. Thiran, and C. Diot, "Measurement and analysis of single-hop delay on an IP backbone network," IEEE J. Sel. Areas Commun., vol. 21, no. 6, pp. 908-921, Aug. 2003.
    • (2003) IEEE J. Sel. Areas Commun , vol.21 , Issue.6 , pp. 908-921
    • Papagiannaki, K.1    Moon, S.2    Fraleigh, C.3    Thiran, P.4    Diot, C.5
  • 44
    • 34547328276 scopus 로고
    • On the renewal function for the Weibull distribution
    • Aug
    • W. L. Smith and M. R. Leadbetter, "On the renewal function for the Weibull distribution," Technometrics, vol. 5, no. 3, pp. 393-396, Aug. 1963.
    • (1963) Technometrics , vol.5 , Issue.3 , pp. 393-396
    • Smith, W.L.1    Leadbetter, M.R.2
  • 46
    • 0032257699 scopus 로고    scopus 로고
    • Estimation of stationary densities for Markov chains
    • Washington DC
    • P. W. Glynn and S. G. Henderson, "Estimation of stationary densities for Markov chains," in Proc. 30th Winter Simulat. Conf., Washington, DC, 1998, pp. 647-652.
    • (1998) Proc. 30th Winter Simulat. Conf. , pp. 647-652
    • Glynn, P.W.1    Henderson, S.G.2
  • 47
    • 22144438077 scopus 로고
    • A renewal theorem
    • W. Feller and S. Orey, "A renewal theorem," J. Math. Mech., vol. 10, no. 4, pp. 619-624, 1961.
    • (1961) J. Math. Mech , vol.10 , Issue.4 , pp. 619-624
    • Feller, W.1    Orey, S.2
  • 48
    • 0002770795 scopus 로고
    • Remainder term estimates of the renewal function
    • H. Carlsson, "Remainder term estimates of the renewal function," Ann. Probab., vol. 11, no. 1, pp. 143-157, 1983.
    • (1983) Ann. Probab , vol.11 , Issue.1 , pp. 143-157
    • Carlsson, H.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.