Secure mobile subscription of sensor-encrypted data

In an end-to-end encryption model for a wireless sensor network (WSN), the network control center preloads encryption and decryption keys to the sensor nodes and the subscribers respectively, such that a subscriber can use a mobile device in the deployment field to decrypt the sensed data encrypted by the more resource-constrained sensor nodes. This paper proposes SMS-SED, a provably secure yet practically efficient key assignment system featuring a discrete time-based access control, to better support a business model where the sensors deployer rents the WSN to customers who desires a higher flexibility beyond subscribing to strictly consecutive periods. In SMS-SED, a node or a mobile device stores a secret key of size independent of the total number of sensor nodes and time periods. We evaluated the feasibility of deploying 2000 nodes for 4096 time periods at 1024-bit of security as a case study, studied the trade off of increasing the storage requirement of a node to significantly reduce its computation time, and provided formal security argument in the random oracle model.

[1]  Robert H. Deng,et al.  Time-Bound Hierarchical Key Assignment: An Overview , 2010, IEICE Trans. Inf. Syst..

[2]  Adrian Perrig,et al.  Distributed detection of node replication attacks in sensor networks , 2005, 2005 IEEE Symposium on Security and Privacy (S&P'05).

[3]  Birgit Pfitzmann,et al.  Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees , 1997, EUROCRYPT.

[4]  Radha Poovendran,et al.  Secure Localization and Time Synchronization for Wireless Sensor and Ad Hoc Networks , 2006, Advances in Information Security.

[5]  Virgil D. Gligor,et al.  A key-management scheme for distributed sensor networks , 2002, CCS '02.

[6]  Dawn Xiaodong Song,et al.  Random key predistribution schemes for sensor networks , 2003, 2003 Symposium on Security and Privacy, 2003..

[7]  Yiming Ye,et al.  Security of Tzeng's Time-Bound Key Assignment Scheme for Access Control in a Hierarchy , 2003, IEEE Trans. Knowl. Data Eng..

[8]  Donggang Liu,et al.  Establishing pairwise keys in distributed sensor networks , 2005, TSEC.

[9]  Aziz Mohaisen,et al.  Hierarchical Grid-based Pairwise Key Pre-distribution in Wireless Sensor Networks , 2009, Int. J. Netw. Secur..

[10]  Daniele Micciancio,et al.  The RSA Group is Pseudo-Free , 2005, Journal of Cryptology.

[11]  Wen-Guey Tzeng,et al.  A Time-Bound Cryptographic Key Assignment Scheme for Access Control in a Hierarchy , 2002, IEEE Trans. Knowl. Data Eng..

[12]  Ronald Cramer,et al.  Signature schemes based on the strong RSA assumption , 2000, TSEC.

[13]  Victor Shoup,et al.  Practical Threshold Signatures , 2000, EUROCRYPT.

[14]  Yunghsiang Sam Han,et al.  A pairwise key predistribution scheme for wireless sensor networks , 2005, TSEC.

[15]  Yunghsiang Sam Han,et al.  A key management scheme for wireless sensor networks using deployment knowledge , 2004, IEEE INFOCOM 2004.

[16]  Xun Yi,et al.  Security of Chien's efficient time-bound hierarchical key assignment scheme , 2005, IEEE Transactions on Knowledge and Data Engineering.

[17]  Willy Susilo,et al.  Server-aided signatures verification secure against collusion attack , 2011, ASIACCS '11.

[18]  Peter I. Corke,et al.  secFleck: A Public Key Technology Platform for Wireless Sensor Networks , 2009, EWSN.

[19]  Hung-Yu Chen,et al.  Efficient time-bound hierarchical key assignment scheme , 2004 .

[20]  Mihir Bellare,et al.  The EAX Mode of Operation , 2004, FSE.

[21]  Donggang Liu,et al.  Improving key predistribution with deployment knowledge in static sensor networks , 2005, TOSN.

[22]  Joseph K. Liu,et al.  Identity-based online/offline key encapsulation and encryption , 2011, ASIACCS '11.

[23]  Paul Pritchard.  Linear Prime-Number Sieves: A Family Tree , 1987, Sci. Comput. Program..

[24]  Yannis Bakos,et al.  Bundling Information Goods: Pricing, Profits and Efficiency , 1998 .

[25]  Hung-Yu Chien,et al.  Efficient time-bound hierarchical key assignment scheme , 2004, IEEE Transactions on Knowledge and Data Engineering.

[26]  Josh Benaloh,et al.  Efficient Broadcast Time-Stamping , 1991 .

[27]  Daniel J. Bernstein,et al.  Prime sieves using binary quadratic forms , 2003, Math. Comput..

[28]  Yevgeniy Dodis,et al.  ID-based encryption for complex hierarchies with applications to forward security and broadcast encryption , 2004, CCS '04.