A group mobility model for ad hoc wireless networks
MSWiM '99 Proceedings of the 2nd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Communications of the ACM
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Shared Generation of Authenticators and Signatures (Extended Abstract)
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Robust and Efficient Sharing of RSA Functions
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Resilient Data-Centric Storage in Wireless Ad-Hoc Sensor Networks
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Data-centric storage in sensornets
ACM SIGCOMM Computer Communication Review
Mobility helps security in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Optimal-resilience proactive public-key cryptosystems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Generating Network-Based Moving Objects
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Distributed localization in wireless sensor networks: a quantitative comparison
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
APSS: proactive secret sharing in asynchronous systems
ACM Transactions on Information and System Security (TISSEC)
EURASIP Journal on Wireless Communications and Networking
Catch Me (If You Can): Data Survival in Unattended Sensor Networks
PERCOM '08 Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications
Secure Data Sharing in Mobile Environments
MDM '08 Proceedings of the The Ninth International Conference on Mobile Data Management
Media sharing based on colocation prediction in urban transport
Proceedings of the 14th ACM international conference on Mobile computing and networking
Proceedings of the 6th ACM conference on Embedded network sensor systems
SurroundSense: mobile phone localization via ambience fingerprinting
Proceedings of the 15th annual international conference on Mobile computing and networking
Analysis of per-node traffic load in multi-hop wireless sensor networks
IEEE Transactions on Wireless Communications
TACKing together efficient authentication, revocation, and privacy in VANETs
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
MPSS: Mobile Proactive Secret Sharing
ACM Transactions on Information and System Security (TISSEC)
Mobile Data Offloading through Opportunistic Communications and Social Participation
IEEE Transactions on Mobile Computing
Increasing availability and security of an authentication service
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
The wireless data collected in mobile environments provides tremendous opportunities to build new applications in various domains such as Vehicular Ad Hoc Networks and mobile social networks. Storing the data decentralized in wireless devices brings major advantages over centralized ones. In this work, to facilitate effective access control of the wireless data in the distributed data storage, we propose a fully decentralized key management framework by utilizing a cryptography-based secret sharing method. The secret sharing method splits the keys into multiple shares and distributes them to multiple nodes. However, due to node mobility, these key shares may not be available in the neighborhood when they are needed for key reconstruction. To address this challenge, we propose the Transitive Prediction (TRAP) protocol that distributes key shares among devices that are traveling together. We develop three key distribution schemes that utilize the correlation relationship embedded among devices that are traveling together. Our key distribution schemes maximize the chance of successful key reconstruction and minimize the communication overhead. We provide theoretical analysis of the robustness and security of TRAP. Our simulation results, by using the generated data from city environment and NS-2 simulator, demonstrate the efficiency and effectiveness of our key distribution schemes.