WEKO3
アイテム
Certification of Secure Encounter History Among Low Power Mobile Sensors
http://hdl.handle.net/10445/6477
http://hdl.handle.net/10445/6477240958bc-c2d4-47a4-b7be-9ef7731d8637
| Item type | 会議発表論文 / Conference Paper(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2011-09-02 | |||||
| タイトル | ||||||
| タイトル | Certification of Secure Encounter History Among Low Power Mobile Sensors | |||||
| 言語 | ||||||
| 言語 | eng | |||||
| 資源タイプ | ||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_5794 | |||||
| 資源タイプ | conference paper | |||||
| アクセス権 | ||||||
| アクセス権 | metadata only access | |||||
| アクセス権URI | http://purl.org/coar/access_right/c_14cb | |||||
| 著者 |
Sakai, Takurou
× Sakai, Takurou× Uchiyama, Akira× 中村, 嘉隆× Higashino, Teruo |
|||||
| 抄録 | ||||||
| 内容記述タイプ | Abstract | |||||
| 内容記述 | In this paper, we propose a technique for certifying encounter information with acquaintances in wireless sensor networks. In our technique, we assume that each user holds a small low power sensor with a short range wireless communication device such as ZigBee, and that multiple sensors called landmarks, which provide accurate location and time, are sparsely distributed in the target area. Each user’s sensor stores encounter information obtained from other users and landmarks in its memory, and it sends those information to its local server when it meets with landmarks which are connected to the Internet. At the same time, we assume that each user registers his/her private key and the list (called friend list) of his/her acquaintances in the Certification Authority (CA) server. When each user sends his/her encounter information to CA, CA informs the digital evidence about when and whom each user has met. In order to keep privacy of each encountered person, if an encountered person does not register the user’s name in his/her friend list, the user cannot know that the user has met with the encountered person. Thus, our technique guarantees anonymity and unlinkability of encounter information by using a hash function and symmetric-key encryption. We have implemented the proposed technique using a hash function SHA-1 on MOTE and confirmed efficiency of the proposed technique through experiments. In addition, we have theoretically analyzed its low energy consumption and practical ability about traceability. |
|||||
| 書誌情報 |
4th Annual IFIP WG 11.9 International Conference on Digital Forensics (ICDF2008) p. 95-110, 発行日 2008-01 |
|||||
| 査読有無 | ||||||
| 値 | あり/yes | |||||
| 研究業績種別 | ||||||
| 値 | 国際会議/International Conference | |||||
| 単著共著 | ||||||
| 値 | 共著/joint | |||||
