{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:17:16Z","timestamp":1740143836662,"version":"3.37.3"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"2","funder":[{"DOI":"10.13039\/501100001868","name":"National Science Council Taiwan","doi-asserted-by":"publisher","award":["NSC 97-2221-E-007-055-MY3"],"id":[{"id":"10.13039\/501100001868","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Sen. Netw."],"published-print":{"date-parts":[[2012,3]]},"abstract":"Broadcast is an efficient communication channel on wireless sensor networks. Through authentic broadcast, deployed sensors can perform legitimate actions issued by a base station. According to previous literature, a complete solution for authentic broadcast is digital signature based on asymmetric cryptography. However, asymmetric cryptography utilizes expensive operations, which result in computational bottlenecks. Among these cryptosystems, Elliptic Curve Cryptography (ECC) seems to be the most efficient and the most popular choice. Unfortunately, signature verification in ECC is not efficient enough. In this article, we propose an authentic broadcast scheme based on RSA. Unlike conventional approaches, the proposed scheme adopts short moduli to enhance performance. Meanwhile, the weakness of short moduli can be fixed with rekeying strategies. To minimize the rekeying overhead, a Multi-Modulus RSA generation algorithm, which can reduce communication overhead by 50%, is proposed. We implemented the proposed scheme on MICAz. On 512-bit moduli, each verification spends at most 0.077 seconds, which is highly competitive with other public-key cryptosystems.<\/jats:p>","DOI":"10.1145\/2140522.2140526","type":"journal-article","created":{"date-parts":[[2012,4,3]],"date-time":"2012-04-03T14:56:22Z","timestamp":1333464982000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Practical RSA signature scheme based on periodical rekeying for wireless sensor networks"],"prefix":"10.1145","volume":"8","author":[{"given":"Shih-Ying","family":"Chang","sequence":"first","affiliation":[{"name":"National Tsing Hua University, Hsinchu, Taiwan"}]},{"given":"Yue-Hsun","family":"Lin","sequence":"additional","affiliation":[{"name":"National Tsing Hua University, Hsinchu, Taiwan"}]},{"given":"Hung-Min","family":"Sun","sequence":"additional","affiliation":[{"name":"National Tsing Hua University, Hsinchu, Taiwan"}]},{"given":"Mu-En","family":"Wu","sequence":"additional","affiliation":[{"name":"Academia Sinica, Taiwan"}]}],"member":"320","published-online":{"date-parts":[[2012,3,31]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(01)00302-4"},{"volume":"1807","volume-title":"Lecture Notes in Computer Science","author":"Cavallar S.","key":"e_1_2_1_2_1"},{"volume-title":"Proceedings of the IEEE Symposium on Security and Privacy. 197--215","author":"Chan H.","key":"e_1_2_1_3_1"},{"volume-title":"Proceedings of the 25th Workshop on Combinatorial Mathematics and Computation Theory.","author":"Chen J.-M.","key":"e_1_2_1_4_1"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/WiMob.2008.16"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1352533.1352539"},{"volume-title":"Proceedings of the 4th International Symposium on Information Processing in Sensor Networks. 382--387","author":"Fok C.-L.","key":"e_1_2_1_7_1"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30496-8_2"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/PERCOMW.2005.76"},{"volume":"2248","volume-title":"ASIACRYPT. Lecture Notes in Computer Science","author":"Gentry C.","key":"e_1_2_1_10_1"},{"key":"e_1_2_1_11_1","series-title":"Lecture Notes in Computer Science","volume-title":"NTRUSIGN: Digital signatures using the NTRU lattice. In Topics in Cryptology (CT-RSA)","author":"Hoffstein J.","year":"2003"},{"key":"e_1_2_1_12_1","series-title":"Lecture Notes in Computer Science","volume-title":"NSS: An NTRU lattice-based signature scheme. In Advances in Cryptology (EUROCRYPT)","author":"Hoffstein J.","year":"2001"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/345910.345920"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s102070100002"},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Jonsson J. and Kaliski B. 2003. Public-key cryptography standards (PKCS)# 1: RSA cryptography specifications version 2.1. RFC 3447. Jonsson J. and Kaliski B. 2003. Public-key cryptography standards (PKCS)# 1: RSA cryptography specifications version 2.1. RFC 3447.","DOI":"10.17487\/rfc3447"},{"key":"e_1_2_1_16_1","unstructured":"Kaliski B. 2004. TWIRL and RSA key size. RSA Laboratories Tech. Note. Kaliski B. 2004. TWIRL and RSA key size. RSA Laboratories Tech. Note."},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Kleinjung T. Aoki K. Franke J. Lenstra A. Thom E. Bos J. Gaudry P. Kruppa A. Montgomery P. Osvik D. A. te Riele H. Timofeev A. and Zimmermann P. 2010. Factorization of a 768-bit RSA modulus. Cryptology ePrint Archive Report 2010\/006. http:\/\/eprint.iacr.org\/. Kleinjung T. Aoki K. Franke J. Lenstra A. Thom E. Bos J. Gaudry P. Kruppa A. Montgomery P. Osvik D. A. te Riele H. Timofeev A. and Zimmermann P. 2010. Factorization of a 768-bit RSA modulus. Cryptology ePrint Archive Report 2010\/006. http:\/\/eprint.iacr.org\/.","DOI":"10.1007\/978-3-642-14623-7_18"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0091537"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPSN.2008.47"},{"volume":"3108","volume-title":"Information Security and Privacy. Lecture Notes in Computer Science","author":"Min S.","key":"e_1_2_1_20_1"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9031-0"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/501983.501988"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016598314198"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180345.1180366"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2394420.2394442"},{"volume-title":"RSAREF: A cryptographic toolkit (v2.0). Tech. report, RSA.","year":"1994","author":"Laboratories","key":"e_1_2_1_26_1"},{"key":"e_1_2_1_27_1","unstructured":"RSA Laboratories. 2007. The RSA Factoring Challenge. RSA. RSA Laboratories. 2007. The RSA Factoring Challenge. RSA."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/PERCOM.2005.18"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11935308_37"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2006.315852"}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2140522.2140526","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T19:10:48Z","timestamp":1672341048000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2140522.2140526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["10.1145\/2140522.2140526"],"URL":"https:\/\/doi.org\/10.1145\/2140522.2140526","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"type":"print","value":"1550-4859"},{"type":"electronic","value":"1550-4867"}],"subject":[],"published":{"date-parts":[[2012,3]]},"assertion":[{"value":"2009-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-03-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}