A digital multisignature scheme using bijective public-key cryptosystems
ACM Transactions on Computer Systems (TOCS)
How to share a function securely
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Towards flexible credential verification in mobile ad-hoc networks
Proceedings of the second ACM international workshop on Principles of mobile computing
Asynchronous verifiable secret sharing and proactive cryptosystems
Proceedings of the 9th ACM conference on Computer and communications security
Key Management for Heterogeneous Ad Hoc Wireless Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Society and Group Oriented Cryptography: A New Concept
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
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
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Efficient Generation of Shared RSA Keys (Extended Abstract)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A Simplified Approach to Threshold and Proactive RSA
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A Digital Multisignature Scheme Based on the Fiat-Shamir Scheme
ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
A Structured ElGamal-Type Multisignature Scheme
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Optimal-resilience proactive public-key cryptosystems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Toward Secure Key Distribution in Truly Ad-Hoc Networks
SAINT-W '03 Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT'03 Workshops)
Securing Authentication and Privacy in Ad hoc Partitioned Networks
SAINT-W '03 Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT'03 Workshops)
Providing Robust and Ubiquitous Security Support for Mobile Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
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
An approach to certificate path discovery in mobile Ad Hoc networks
Proceedings of the 1st 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)
Fully self-organized peer-to-peer key management for mobile ad hoc networks
Proceedings of the 4th ACM workshop on Wireless security
APSS: proactive secret sharing in asynchronous systems
ACM Transactions on Information and System Security (TISSEC)
Efficient and robust key management for large mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient Node Admission for Short-lived Mobile Ad Hoc Networks
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Verifiable secret sharing and achieving simultaneity in the presence of faults
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
A practical scheme for non-interactive verifiable secret sharing
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Robust threshold DSS signatures
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Practical threshold signatures
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Shared RSA key generation in a mobile ad hoc network
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
| Hi-index | 0.00 |
Ad hoc environments are subject to tight security and architectural constraints, which call for distributed, adaptive, robust and efficient solutions. In this paper we propose a distributed signature protocol for large-scale long-lived ad hoc networks. The proposed protocol is based on RSA and a new (t,t)-secret sharing scheme. The nodes of the network are uniformly partitioned into t classes, and the nodes belonging to the same class are provided with the same share. Any t nodes, belonging to different classes, can collectively issue a signature, without any interaction. The scheme is at least as secure as any (t,n)-threshold scheme, i.e., an adversary can neither forge a signature nor disrupt the computation, unless it has compromised at least t nodes, belonging to different classes. Moreover, an attempt to disrupt the distributed service, by providing a fake signature share, would reveal the cheating node. Further, it is possible to easily increase the level of security, by shifting from a (t,t) to a (t+k,t+k) scheme, for a reasonable choice of parameter k, involving just a fraction of the nodes, so that the scheme is adaptive to the level of threat that the ad hoc network is subject to. Finally, the distributed signature protocol is efficient: the number of messages sent and received for generating a signature, as well as to increase the level of security, is small and both computations and memory required are small as well. All the authors have been partially funded by the WEB-MINDS project, supported by the Italian MIUR under the FIRB program. Roberto Di Pietro is also partially supported by the CNR-ISTI, Pisa, in the framework of the “SatNEx-II” NoE project (contract N. 27393).