ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술대회 Data Randomization for Lightweight Secure Data Aggregation in Sensor Network
Cited 0 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
아지즈, 정익래, 홍도원, 조남수, 양대헌
발행일
200806
출처
International Conference on Ubiquitous Intelligence and Computing (UIC) 2008 (LNCS 5061), v.5061, pp.338-351
DOI
https://dx.doi.org/10.1007/978-3-540-69293-5_27
협약과제
08MK1100, 차세대 시큐리티 기술 개발, 조현숙
초록
Data aggregation is one of the main purposes for which sensor networks are developed. However, to secure the data aggregation schemes, several security-related issues have raised including the need for efficient implementations of cryptographic algorithms, secure key management schemes' design and many others. Several works has been introduced in this direction and succeeded to some extent in providing relatively efficient solutions. Yet, one of the questions to be answered is that, can we still aggregate the sensed data with less security-related computation while maintaining a marginal level of security and accuracy? In this paper, we consider data randomization as a possible approach for data aggregation. Since the individual single sensed record is not of a big concern when using data for aggregation, we show how data randomization can explicitly hide the exact single data records to securely exchange them between nodes. To improve the security and accuracy of this approach, we introduce a hybrid scheme that uses the cryptographic approach for a fraction of nodes. We study the efficiency of our schemes in terms of the estimate accuracy and the overhead. © 2008 Springer-Verlag Berlin Heidelberg.
KSP 제안 키워드
Cryptographic Algorithms, Efficient solution, Hybrid Scheme, Key Management Scheme, Network Data, Secure data aggregation, Sensor networks, efficient implementation, need for