Two Variations of Peer Intermediaries for Key Establishment in Sensor Networks

• Main Authors: Jing-Yuan Rao, 饒敬遠
• Other Authors: Chia-Mu Yu
• Format: Others
• Language: zh-TW
• Published: 2016
• Online Access: http://ndltd.ncl.edu.tw/handle/90634014504991862750

碩士 === 元智大學 === 資訊工程學系 === 104 === Recently, the issue pertinent to sensor network security is a popular topic. Especially, due to the restriction of energy supplied by battery power of the sensors，symmetric cryptography is one of the suitable choices for the secret communication between sensors, while asymmetric cryptography is not appropriate because of its heavy loading on computation should consume a lot of energy. As a result of using symmetric cryptography, there are numerous research papers focusing on designing efficient key management scheme in sensor networks. PIKE [3] designed by Chan and Perrig is a scheme using peer intermediaries and their pre-installed keys to deliver secret message from one sensor to another. However, they did not consider the case that the sensors are scattered in nonuniform way. Moreover, O(logn) is enough for sensor networks to achieve expander topology while PIKE has O(√n) storage overhead. In this paper, we give a generalizations of PIKE to offer more choices for developers under different requirements. The Constant Storage Protocol, abbreviated as CSP, costs constant memory storage and is more suitable for group-based deployment.