Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Special Issue on Security of Ad-hoc and Sensor Networks
Guest editors: Peng Ning and Wenliang Du
Article type: Research Article
Authors: Zanin, Giorgioa; * | Di Pietro, Robertob | Mancini, Luigi V.a
Affiliations: [a] Dipartimento di Informatica of the Università di Roma “La Sapienza”, Italy. E-mail: mancini@di.uniroma1.it, zanin@di.uniroma1.it | [b] Dipartimento di Matematica of Università di Roma Tre, Italy. E-mail: dipietro@mat.uniroma3.it
Correspondence: [*] Corresponding author. 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).
Abstract: 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.
Keywords: Threshold cryptosystem, signature scheme, secret sharing, peer-to-peer network, ad hoc networks, wireless network, ubiquitous service
DOI: 10.3233/JCS-2007-15107
Journal: Journal of Computer Security, vol. 15, no. 1, pp. 171-196, 2007
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl