메뉴 건너뛰기




Volumn 23, Issue 5-6, 2011, Pages 373-394

Secure and highly-available aggregation queries in large-scale sensor networks via set sampling

Author keywords

Aggregation queries; Sampling algorithms; Secure aggregation queries; Set sampling; Tree sampling

Indexed keywords

AGGREGATION QUERIES; SAMPLING ALGORITHM; SECURE AGGREGATION QUERIES; SET SAMPLING; TREE SAMPLING;

EID: 79953026475     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-011-0130-z     Document Type: Article
Times cited : (8)

References (34)
  • 2
    • 0026902215 scopus 로고
    • On the time-complexity of broadcast in radio networks: An exponential gap between determinism and randomization
    • 10.1016/0022-0000(92)90042-H 0752.68009 1170919
    • R. Bar-Yehuda O. Goldreich A. Itai 1992 On the time-complexity of broadcast in radio networks: an exponential gap between determinism and randomization J. Comput. Syst. Sci. 45 104 126 10.1016/0022-0000(92)90042-H 0752.68009 1170919
    • (1992) J. Comput. Syst. Sci. , vol.45 , pp. 104-126
    • Bar-Yehuda, R.1    Goldreich, O.2    Itai, A.3
  • 3
    • 0029530232 scopus 로고
    • Decision trees with Boolean threshold queries
    • 10.1006/jcss.1995.1085 0839.68075 1368914
    • Y. Ben-Asher I. Newman 1995 Decision trees with Boolean threshold queries J. Comput. Syst. Sci. 51 3 495 502 10.1006/jcss.1995.1085 0839.68075 1368914
    • (1995) J. Comput. Syst. Sci. , vol.51 , Issue.3 , pp. 495-502
    • Ben-Asher, Y.1    Newman, I.2
  • 4
    • 0037048579 scopus 로고    scopus 로고
    • Complexity measures and decision tree complexity: A survey
    • 10.1016/S0304-3975(01)00144-X 1061.68058 1934888
    • H. Buhrman R. De Wolf 2002 Complexity measures and decision tree complexity: a survey Theoretical Comput. Sci. 288 1 21 43 10.1016/S0304-3975(01) 00144-X 1061.68058 1934888
    • (2002) Theoretical Comput. Sci. , vol.288 , Issue.1 , pp. 21-43
    • Buhrman, H.1    De Wolf, R.2
  • 5
    • 33845808851 scopus 로고    scopus 로고
    • SIA: Secure information aggregation in sensor networks
    • H. Chan A. Perrig B. Przydatek D. Song 2007 SIA: secure information aggregation in sensor networks J. Comput. Security (Special Issue on Security of Ad Hoc and Sensor Networks) 15 1 69 102 (Pubitemid 46012643)
    • (2007) Journal of Computer Security , vol.15 , Issue.1 , pp. 69-102
    • Chan, H.1    Perrig, A.2    Przydatek, B.3    Song, D.4
  • 8
    • 0034538249 scopus 로고    scopus 로고
    • Optimal algorithm for Monte Carlo estimation
    • DOI 10.1137/S0097539797315306
    • P. Dagum R. Karp M. Luby S. Ross 2000 An optimal algorithm for Monte Carlo estimation SIAM J. Comput. 29 5 1484 1496 10.1137/S0097539797315306 1112.65300 1744833 (Pubitemid 32021653)
    • (2000) SIAM Journal on Computing , vol.29 , Issue.5 , pp. 1484-1496
    • Dagum, P.1    Karp, R.2    Luby, M.3    Ross, S.4
  • 12
    • 0031479360 scopus 로고    scopus 로고
    • Simple Proofs of Occupancy Tail Bounds
    • DOI 10.1002/(SICI)1098-2418(199709)11:2<119::AID-RSA2>3.0.CO;2-V
    • D. Dubhashi 1997 Simple proofs of occupancy tail bounds Random Struct. Algorithms 11 2 119 123 10.1002/(SICI)1098-2418(199709)11:2<119::AID- RSA2>3.0.CO;2-V 0896.60003 1610257 (Pubitemid 127114961)
    • (1997) Random Structures and Algorithms , vol.11 , Issue.2 , pp. 119-124
    • Dubhashi, D.1
  • 13
    • 33750361486 scopus 로고    scopus 로고
    • Bitmap algorithms for counting active flows on high-speed links
    • DOI 10.1109/TNET.2006.882836
    • C. Estan G. Varghese M. Fisk 2006 Bitmap algorithms for counting active flows on high-speed links IEEE/ACM Trans. Networking 14 5 925 937 10.1109/TNET.2006.882836 (Pubitemid 44615105)
    • (2006) IEEE/ACM Transactions on Networking , vol.14 , Issue.5 , pp. 925-937
    • Estan, C.1    Varghese, G.2    Fisk, M.3
  • 14
    • 0020828424 scopus 로고
    • Probabilistic counting algorithms for database applications
    • 10.1016/0022-0000(85)90041-8 0583.68059 828521
    • P. Flajolet G.N. Martin 1985 Probabilistic counting algorithms for database applications J. Comput. Syst. Sci. 31 2 182 209 10.1016/0022-0000(85) 90041-8 0583.68059 828521
    • (1985) J. Comput. Syst. Sci. , vol.31 , Issue.2 , pp. 182-209
    • Flajolet, P.1    Martin, G.N.2
  • 16
    • 49049084465 scopus 로고    scopus 로고
    • Catching elephants with mice: Sparse sampling for monitoring sensor networks
    • Gandhi, S., Suri, S., Welzl, E.: Catching elephants with mice: sparse sampling for monitoring sensor networks. In: SenSys (2007)
    • (2007) SenSys
    • Gandhi, S.1    Suri, S.2    Welzl, E.3
  • 21
    • 0002171821 scopus 로고
    • Tail bounds for occupancy and the satisfiability threshold conjecture
    • 10.1002/rsa.3240070105 0834.68051 1346284
    • A. Kamath R. Motwani K. Palem P. Spirakis 1995 Tail bounds for occupancy and the satisfiability threshold conjecture Random Struct. Algorithms 7 1 59 80 10.1002/rsa.3240070105 0834.68051 1346284
    • (1995) Random Struct. Algorithms , vol.7 , Issue.1 , pp. 59-80
    • Kamath, A.1    Motwani, R.2    Palem, K.3    Spirakis, P.4
  • 25
    • 27644449262 scopus 로고    scopus 로고
    • Synopsis diffusion for robust aggregation in sensor networks
    • Nath, S., Gibbons, P.B., Seshan, S., Anderson, Z.: Synopsis diffusion for robust aggregation in sensor networks. In: SenSys (2004)
    • (2004) SenSys
    • Nath, S.1    Gibbons, P.B.2    Seshan, S.3    Anderson, Z.4
  • 26
    • 70849122470 scopus 로고    scopus 로고
    • Secure outsourced aggregation via one-way chains
    • June
    • Nath, S., Yu, H.: Secure outsourced aggregation via one-way chains. In: ACM SIGMOD June 2009
    • (2009) ACM SIGMOD
    • Nath, S.1    Yu, H.2
  • 27
    • 41849094781 scopus 로고    scopus 로고
    • Mitigating DoS attacks against broadcast authentication in wireless sensor networks
    • DOI 10.1145/1325651.1325652
    • P. Ning A. Liu W. Du 2008 Mitigating DoS attacks against broadcast authentication in wireless sensor networks ACM Trans. Sensor Networks 4 1 1 35 10.1145/1325651.1325652 (Pubitemid 351495527)
    • (2008) ACM Transactions on Sensor Networks , vol.4 , Issue.1 , pp. 1
    • Ning, P.1    Liu, A.2    Du, W.3
  • 28
    • 0036738266 scopus 로고    scopus 로고
    • SPINS: Security protocols for sensor networks
    • 10.1023/A:1016598314198 1030.68814
    • A. Perrig R. Szewczyk V. Wen D. Culler D. Tygar 2002 SPINS: Security protocols for sensor networks Wireless Networks J. (WINE) 8 5 521 534 10.1023/A:1016598314198 1030.68814
    • (2002) Wireless Networks J. (WINE) , vol.8 , Issue.5 , pp. 521-534
    • Perrig, A.1    Szewczyk, R.2    Wen, V.3    Culler, D.4    Tygar, D.5
  • 34
    • 70849129424 scopus 로고    scopus 로고
    • Secure and highly-available aggregation queries in large-scale sensor networks via set samplings
    • Yu, H.: Secure and highly-available aggregation queries in large-scale sensor networks via set sampling. In: ACM/IEEE IPSN (2009)
    • (2009) ACM/IEEE IPSN
    • Yu, H.1


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