Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th 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
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
An asynchronous [(n - 1)/3]-resilient consensus protocol
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Admission Control in Peer Groups
NCA '03 Proceedings of the Second IEEE International Symposium on Network Computing and Applications
Self-Securing Ad Hoc Wireless Networks
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Providing Robust and Ubiquitous Security Support for Mobile Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
On the Utility of Distributed Cryptography in P2P and MANETs: The Case of Membership Control
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Admission control in Peer-to-Peer: design and performance evaluation
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
An attack on the proactive RSA signature scheme in the URSA ad hoc network access control protocol
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
URSA: ubiquitous and robust access control for mobile ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Energy aware lossless data compression
Proceedings of the 1st international conference on Mobile systems, applications and services
Efficient Node Admission for Short-lived Mobile Ad Hoc Networks
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Robust threshold DSS signatures
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Secure distributed key generation for discrete-log based cryptosystems
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Distributed Pseudo-random functions and KDCs
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Identity-Based access control for ad hoc groups
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
IEEE Transactions on Information Theory
Noninteractive self-certification for long-lived mobile ad hoc networks
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
A stochastic analysis of secure joint decision processes in peer-to-peer systems
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Simulations, models, and testbeds: A mutual catalysis
Performance Evaluation
| Hi-index | 0.00 |
Mobile ad hoc networks (MANETs) have many well-known applications in military settings as well as in emergency and rescue operations. However, lack of infrastructure and lack of centralized control make MANETs inherently insecure, and therefore specialized security services are needed for their deployment. Self-certification is an essential and fundamental security service in MANETs. It is needed to securely cope with dynamic membership and topology and to bootstrap other important security primitives and services without the assistance of any centralized trusted authority. An ideal protocol must involve minimal interaction among the MANET nodes, since connectivity can be unstable. Also, since MANETs are often composed of weak or resource-limited devices, self-certification protocol must be efficient in terms of computation and communication. Unfortunately, previously proposed protocols are far from being ideal. In this paper, we propose fully non-interactive self-certification protocol based on bi-variate polynomial secret sharing and threshold BLS signature techniques. In contrast with prior work, our techniques do not require any interaction and do not involve any costly reliable broadcast communication among MANET nodes. We thoroughly analyze our proposal and show that it compares favorably to previous mechanisms.