{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:40Z","timestamp":1750307800313,"version":"3.41.0"},"reference-count":9,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGBED Rev."],"published-print":{"date-parts":[[2008,1]]},"abstract":"<jats:p>In this paper, we present a methodology and preliminary result of computing the Tate Pairing on a supersingular curve over a prime field in the wireless sensors (MICAz Mote). The aim of this work is to study the feasibility of pairing based protocols and applications in sensors with limited computational resources. Tate pairing is the most computationally intensive computation in most pairing-based cryptographic algorithms. Our preliminary results showed that without hardware upgrades (esp. memory) or further optimization of algorithms and parameters, sensors not yet ready for computing pairing-based cryptographic algorithms.<\/jats:p>","DOI":"10.1145\/1366283.1366310","type":"journal-article","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T14:35:04Z","timestamp":1210084504000},"page":"1-2","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing cryptographic pairing in sensors"],"prefix":"10.1145","volume":"5","author":[{"given":"Zhibin","family":"Zhou","sequence":"first","affiliation":[{"name":"Arizona State University"}]},{"given":"Dijiang","family":"Huang","sequence":"additional","affiliation":[{"name":"Arizona State University"}]}],"member":"320","published-online":{"date-parts":[[2008,1]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"354","volume":"2442","author":"Barreto P.","year":"2002","journal-title":"Efficient algorithms for pairing-based cryptosystems. Advances in Cryptology--Crypto"},{"volume-title":"White Paper STMicroelectronics","year":"2005","author":"Bertoni G.","key":"e_1_2_1_2_1"},{"volume-title":"Algorithmic Number Theory 5th International Symposium, ANTS-V, 2369:  324-337","author":"Galbraith S.","key":"e_1_2_1_3_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_4_1","DOI":"10.1007\/978-3-540-28632-5_9"},{"unstructured":"{5} R. Laboratories. Rsaref: A cryptographic toolkit version 2.0. 1994.  {5} R. Laboratories. Rsaref: A cryptographic toolkit version 2.0. 1994.","key":"e_1_2_1_5_1"},{"unstructured":"{6} E. M. F. D. J. L. Leonardo B. Oliveira Diego Aranha and R. Dahab. TinyTate: Identity-Based Encryption for Sensor Networks.  {6} E. M. F. D. J. L. Leonardo B. Oliveira Diego Aranha and R. Dahab. TinyTate: Identity-Based Encryption for Sensor Networks.","key":"e_1_2_1_6_1"},{"unstructured":"{7} A. Liu and P. Ning. Tinyecc: Elliptic curve cryptography for sensor networks.  {7} A. Liu and P. Ning. Tinyecc: Elliptic curve cryptography for sensor networks.","key":"e_1_2_1_7_1"},{"unstructured":"{8} V. Miller. Short programs for functions on curves. Unpublished manuscript 1986.  {8} V. Miller. Short programs for functions on curves. Unpublished manuscript 1986.","key":"e_1_2_1_8_1"},{"doi-asserted-by":"crossref","unstructured":"{9} A. Ramachandran Z. Zhou and D. Huang. Computing Cryptographic Algorithms in Portable and Embedded Devices. to appear at IEEE PORTABLE 2007.  {9} A. Ramachandran Z. Zhou and D. Huang. Computing Cryptographic Algorithms in Portable and Embedded Devices. to appear at IEEE PORTABLE 2007 .","key":"e_1_2_1_9_1","DOI":"10.1109\/PORTABLE.2007.47"}],"container-title":["ACM SIGBED Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1366283.1366310","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1366283.1366310","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:30Z","timestamp":1750254990000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1366283.1366310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["10.1145\/1366283.1366310"],"URL":"https:\/\/doi.org\/10.1145\/1366283.1366310","relation":{},"ISSN":["1551-3688"],"issn-type":[{"type":"electronic","value":"1551-3688"}],"subject":[],"published":{"date-parts":[[2008,1]]},"assertion":[{"value":"2008-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}