Robust RSA distributed signatures for large-scale long-lived ad hoc networks
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...
Saved in:
Published in | Journal of computer security Vol. 15; no. 1; pp. 171 - 196 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
London, England
SAGE Publications
01.01.2007
|
Subjects | |
Online Access | Get full text |
ISSN | 0926-227X 1875-8924 |
DOI | 10.3233/JCS-2007-15107 |
Cover
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. |
---|---|
AbstractList | 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. 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. |
Author | Mancini, Luigi V. Zanin, Giorgio Di Pietro, Roberto |
Author_xml | – sequence: 1 givenname: Giorgio surname: Zanin fullname: Zanin, Giorgio email: zanin@di.uniroma1.it organization: , – sequence: 2 givenname: Roberto surname: Di Pietro fullname: Di Pietro, Roberto organization: , – sequence: 3 givenname: Luigi V. surname: Mancini fullname: Mancini, Luigi V. email: mancini@di.uniroma1.it organization: , |
BookMark | eNp1kM9LwzAAhYNMcJtePefkRTLzo0mT4xg6lYGwKXgLaZrUzq6ZSav439s5r57e5XsP3jcBoza0DoBLgmeMMnbzuNgginGOCCc4PwFjInOOpKLZCIyxogJRmr-egUlKW4wpIUqOwWodij51cL2Zw7JOXayLvnMlTHXVmq6PLkEfImxMrBxK1jQONqGtUFN_DpQp4VuwsHXdV4jv6RycetMkd_GXU_Byd_u8uEerp-XDYr5ClgrSIZFZmUleKCN8yfKCW2Uyp3JZOicZE9xzIiixJhPWcuql5Z4QQ0pPMoxNyabg6ri7j-Gjd6nTuzpZ1zSmdaFPmiqcMSXwAM6OoI0hpei83sd6Z-K3JlgfpOlBmj5I07_ShsL1sZBM5fQ29LEdjvxH_wAIsW6J |
ContentType | Journal Article |
Copyright | IOS Press and the authors. All rights reserved |
Copyright_xml | – notice: IOS Press and the authors. All rights reserved |
DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
DOI | 10.3233/JCS-2007-15107 |
DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
DatabaseTitleList | Computer and Information Systems Abstracts |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Computer Science |
EISSN | 1875-8924 |
EndPage | 196 |
ExternalDocumentID | 10_3233_JCS_2007_15107 10.3233_JCS-2007-15107 |
GroupedDBID | .4S .DC 0R~ 4.4 6KP 8VB AAGLT AAQXI ABDBF ABJNI ABUJY ACGFS ACPQW ACUHS ADMLS ADZMO AEMOZ AFRHK AGIAB AHDMH AHQJS AJNRN AKVCP ALMA_UNASSIGNED_HOLDINGS ARCSS ARTOV ASPBG AVWKF CAG COF EAD EAP EAS EAU EBA EBE EBR EBS EBU EDO EIS EJD EMK EPL EST ESX FIL HZ~ I-F IL9 IOS ITG ITH J8X K1G MET MIO MV1 O9- P2P PQQKQ QWB SAUOL SCNPE SFC TH9 TUS XJE ZL0 AAPII AAYXX AJGYC ALIRC CITATION 7SC 8FD JQ2 L7M L~C L~D |
ID | FETCH-LOGICAL-c261t-64c8485b9a6fd37b5c9a4e978dee83365f51621ca46cc52f8c5f11a1df1400ad3 |
ISSN | 0926-227X |
IngestDate | Fri Sep 05 07:13:23 EDT 2025 Wed Sep 10 06:09:21 EDT 2025 Tue Jun 17 22:27:38 EDT 2025 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 1 |
Keywords | Threshold cryptosystem signature scheme ubiquitous service secret sharing ad hoc networks wireless network peer-to-peer network |
Language | English |
LinkModel | OpenURL |
MergedId | FETCHMERGED-LOGICAL-c261t-64c8485b9a6fd37b5c9a4e978dee83365f51621ca46cc52f8c5f11a1df1400ad3 |
Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
PQID | 29043960 |
PQPubID | 23500 |
PageCount | 26 |
ParticipantIDs | proquest_miscellaneous_29043960 crossref_primary_10_3233_JCS_2007_15107 sage_journals_10_3233_JCS_2007_15107 |
PublicationCentury | 2000 |
PublicationDate | 20070101 2007-01-01 |
PublicationDateYYYYMMDD | 2007-01-01 |
PublicationDate_xml | – month: 1 year: 2007 text: 20070101 day: 1 |
PublicationDecade | 2000 |
PublicationPlace | London, England |
PublicationPlace_xml | – name: London, England |
PublicationTitle | Journal of computer security |
PublicationYear | 2007 |
Publisher | SAGE Publications |
Publisher_xml | – name: SAGE Publications |
SSID | ssj0021198 |
Score | 1.7319726 |
Snippet | Ad hoc environments are subject to tight security and architectural constraints, which call for distributed, adaptive, robust and efficient solutions. In this... |
SourceID | proquest crossref sage |
SourceType | Aggregation Database Index Database Publisher |
StartPage | 171 |
Title | Robust RSA distributed signatures for large-scale long-lived ad hoc networks |
URI | https://journals.sagepub.com/doi/full/10.3233/JCS-2007-15107 https://www.proquest.com/docview/29043960 |
Volume | 15 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9swDBa29rLL3sOypw4FdjDURbIe9jHtlhXFOgx9DLkZsiynAQJ7qJ1Lf30py48kW4BuFyOwBQERP1EkRfJD6ABOSMnNWBCVg7vKU5aRmFtFJCjLHM5zlnNXO3z2Q55c8dOZmA2pQ011SZ0emtu_1pX8j1ThHcjVVcn-g2T7SeEF_Ab5whMkDM97yfi8TFdVHZxfTNxFi-euAgPS5WQ0_TqbXgvB0iV7kwqEYYNlWczJEjRcFugsuC5NUPg88GqHlWpa1oegaonu-kizLnz7gW-L8mbus7kai3gR_FzY2pfP-Lzt_tuZa-5R-Hrs1WK-CH4dbkQd1FbUwV937QgsMkkYUzN_wni1Cl4RiWJfLd3rXfEHvrwSpZ6UpT2PqWe83Vb1IXOh6Onp8YUPt4Ll4ulzt9pnt0OTzYEP0T5Tyt3r70-OvhxNex-d0oY-uf8Tvs-nm-Hz5gybdszgnKzlAzYmyuVT9LiVGp54oDxDD2zxHD3peDtwq8ZfoO8eNxhwg9dwgwfcYMANXsMNHnCDdYYBN7jDzUt0Nf16eXxCWlYNYsBbrglszYhHIo21zLNQpcLEmttYRZm1URhKkQsqGTWaS2Ngr0ZG5JRqmuXgi491Fr5Ce0VZ2NcI53kqQpVRLTTlWSgiycHBSMOIUT1OWTRCn7o1Sn775ikJOJ2dPBwFqkqa1Ryhj90SJqDf3KWVLmy5qhIWu-JtOR6hA7eySbv9qh0TvbnfsLfo0YDqd2ivvlnZ92Bd1umHFhF3ib11yQ |
linkProvider | EBSCOhost |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Robust+RSA+distributed+signatures+for+large-scale+long-lived+ad+hoc+networks&rft.jtitle=Journal+of+computer+security&rft.au=Zanin%2C+Giorgio&rft.au=Di+Pietro%2C+Roberto&rft.au=Mancini%2C+Luigi+V.&rft.date=2007-01-01&rft.pub=SAGE+Publications&rft.issn=0926-227X&rft.eissn=1875-8924&rft.volume=15&rft.issue=1&rft.spage=171&rft.epage=196&rft_id=info:doi/10.3233%2FJCS-2007-15107&rft.externalDocID=10.3233_JCS-2007-15107 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0926-227X&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0926-227X&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0926-227X&client=summon |