{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T06:45:58Z","timestamp":1750747558956,"version":"3.41.0"},"reference-count":73,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2017,10,26]],"date-time":"2017-10-26T00:00:00Z","timestamp":1508976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Marie Curie Fellowship funded by the European Commission","award":["PCIG11-GA-2012-321980"],"award-info":[{"award-number":["PCIG11-GA-2012-321980"]}]},{"name":"EU TagItSmart! Project","award":["H2020-ICT30-2015-688061"],"award-info":[{"award-number":["H2020-ICT30-2015-688061"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2018,2,28]]},"abstract":"<jats:p>The large spread of sensors and smart devices in urban infrastructures are motivating research in the area of the Internet of Things (IoT) to develop new services and improve citizens\u2019 quality of life. Sensors and smart devices generate large amounts of measurement data from sensing the environment, which is used to enable services such as control of power consumption or traffic density. To deal with such a large amount of information and provide accurate measurements, service providers can adopt information fusion, which given the decentralized nature of urban deployments can be performed by means of consensus algorithms. These algorithms allow distributed agents to (iteratively) compute linear functions on the exchanged data, and take decisions based on the outcome, without the need for the support of a central entity. However, the use of consensus algorithms raises several security concerns, especially when private or security critical information is involved in the computation.<\/jats:p>\n          <jats:p>In this article we propose ODIN, a novel algorithm allowing information fusion over encrypted data. ODIN is a privacy-preserving extension of the popular consensus gossip algorithm, which prevents distributed agents from having direct access to the data while they iteratively reach consensus; agents cannot access even the final consensus value but can only retrieve partial information (e.g., a binary decision). ODIN uses efficient additive obfuscation and proxy re-encryption during the update steps and garbled circuits to make final decisions on the obfuscated consensus. We discuss the security of our proposal and show its practicability and efficiency on real-world resource-constrained devices, developing a prototype implementation for Raspberry Pi devices.<\/jats:p>","DOI":"10.1145\/3137573","type":"journal-article","created":{"date-parts":[[2017,10,26]],"date-time":"2017-10-26T14:19:33Z","timestamp":1509027573000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["ODIN"],"prefix":"10.1145","volume":"18","author":[{"given":"Moreno","family":"Ambrosin","sequence":"first","affiliation":[{"name":"University of Padua, Italy"}]},{"given":"Paolo","family":"Braca","sequence":"additional","affiliation":[{"name":"NATO STO CMRE, La Spezia, Italy"}]},{"given":"Mauro","family":"Conti","sequence":"additional","affiliation":[{"name":"University of Padua, Italy"}]},{"given":"Riccardo","family":"Lazzeretti","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Italy"}]}],"member":"320","published-online":{"date-parts":[[2017,10,26]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1024422"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978335"},{"volume-title":"Proceedings of CCS\u201915","author":"Asokan N.","key":"e_1_2_1_3_1","unstructured":"N. Asokan , F. Brasser , A. Ibrahim , A.-R. Sadeghi , M. Schunter , G. Tsudik , and C. Wachsmann . 2015. SEDA: Scalable embedded device attestation . In Proceedings of CCS\u201915 . ACM, New York, NY, 964--975. N. Asokan, F. Brasser, A. Ibrahim, A.-R. Sadeghi, M. Schunter, G. Tsudik, and C. Wachsmann. 2015. SEDA: Scalable embedded device attestation. In Proceedings of CCS\u201915. ACM, New York, NY, 964--975."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00862-7_19"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1127345.1127346"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2015.2438131"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2011.2108650"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2013.2250911"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44750-4_8"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5947692"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23822-2_11"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054122"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_13"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874516"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2016.2587327"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.917855"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2030610"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2010.09.011"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315269"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12678-9_19"},{"key":"e_1_2_1_21_1","volume-title":"Thomas","author":"Cover Thomas M.","year":"2012","unstructured":"Thomas M. Cover and Joy A . Thomas . 2012 . Elements of Information Theory. John Wiley & Sons . Thomas M. Cover and Joy A. Thomas. 2012. Elements of Information Theory. John Wiley & Sons."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2516930.2516944"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2052531"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516758"},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of NDSS\u201912","author":"Eldefrawy Karim","year":"2012","unstructured":"Karim Eldefrawy , Gene Tsudik , Aur\u00e9lien Francillon , and Daniele Perito . 2012 . SMART: Secure and minimal architecture for (establishing dynamic) root of trust . In Proceedings of NDSS\u201912 . 1--15. Karim Eldefrawy, Gene Tsudik, Aur\u00e9lien Francillon, and Daniele Perito. 2012. SMART: Secure and minimal architecture for (establishing dynamic) root of trust. In Proceedings of NDSS\u201912. 1--15."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5947695"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03168-7_14"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31284-7_33"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.834433"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.554205"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2381966.2381978"},{"key":"e_1_2_1_33_1","volume-title":"Hui and Pascal Thubert","author":"Jonathan","year":"2011","unstructured":"Jonathan W. Hui and Pascal Thubert . 2011 . Compression format for IPv6 datagrams in low power and lossy networks (6LoWPAN). RFC 6282. Available at https:\/\/tools.ietf.org\/html\/draft-ietf-6lowpan-hc-15. Jonathan W. Hui and Pascal Thubert. 2011. Compression format for IPv6 datagrams in low power and lossy networks (6LoWPAN). RFC 6282. Available at https:\/\/tools.ietf.org\/html\/draft-ietf-6lowpan-hc-15."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.3390\/jsan2020235"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of NDSS\u201903","author":"Ivan Anca-Andreea","year":"2003","unstructured":"Anca-Andreea Ivan and Yevgeniy Dodis . 2003 . Proxy cryptography revisited . In Proceedings of NDSS\u201903 . Anca-Andreea Ivan and Yevgeniy Dodis. 2003. Proxy cryptography revisited. In Proceedings of NDSS\u201903."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2003.812781"},{"volume-title":"Algorithmic Number Theory.","author":"Joux Antoine","key":"e_1_2_1_37_1","unstructured":"Antoine Joux . 2000. A one round protocol for tripartite Diffie--Hellman . In Algorithmic Number Theory. Vol. 1838 . Springer , 385--393. Antoine Joux. 2000. A one round protocol for tripartite Diffie--Hellman. In Algorithmic Number Theory. Vol. 1838. Springer, 385--393."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2235193"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/11935308_19"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-130464"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2219653"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/WIFS.2011.6123132"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2230540"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2361407.2361435"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6855039"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2015.2503268"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130413"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78440-1_21"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-001-0019-2"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9036-8"},{"volume-title":"Proceedings of ECC\u201913","author":"Nicolaos","key":"e_1_2_1_52_1","unstructured":"Nicolaos E. Manitara and Christoforos N. Hadjicostis. 2013. Privacy-preserving asymptotic average consensus . In Proceedings of ECC\u201913 . IEEE, Los Alamitos, CA, 760--765. Nicolaos E. Manitara and Christoforos N. Hadjicostis. 2013. Privacy-preserving asymptotic average consensus. In Proceedings of ECC\u201913. IEEE, Los Alamitos, CA, 760--765."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2005.864190"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.887293"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2007.4434297"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2158130"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2007.01.002"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/IDC.2007.374539"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73275-4_9"},{"volume-title":"Proceedings of CDC\u201908","author":"Saligrama Venkatesh","key":"e_1_2_1_61_1","unstructured":"Venkatesh Saligrama and David A. Castan\u00f3n . 2008. Reliable distributed estimation with intermittent communications . In Proceedings of CDC\u201908 . IEEE, Los Alamitos, CA, 6763--6768. Venkatesh Saligrama and David A. Castan\u00f3n. 2008. Reliable distributed estimation with intermittent communications. In Proceedings of CDC\u201908. IEEE, Los Alamitos, CA, 6763--6768."},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2004.1301329"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"e_1_2_1_64_1","volume-title":"Proceedings of ADHOCNETS\u201909","author":"Spanogiannopoulos George","year":"2009","unstructured":"George Spanogiannopoulos , Natalija Vlajic , and Dusan Stevanovic . 2009 . A simulation-based performance analysis of various multipath routing techniques in ZigBee sensor networks . In Proceedings of ADHOCNETS\u201909 . 300--315. George Spanogiannopoulos, Natalija Vlajic, and Dusan Stevanovic. 2009. A simulation-based performance analysis of various multipath routing techniques in ZigBee sensor networks. In Proceedings of ADHOCNETS\u201909. 300--315."},{"volume-title":"Proceedings of DRM\u201906","author":"Taban Gelareh","key":"e_1_2_1_65_1","unstructured":"Gelareh Taban , Alvaro A. C\u00e1rdenas , and Virgil D. Gligor . 2006. Towards a secure and interoperable DRM architecture . In Proceedings of DRM\u201906 . ACM, New York, NY, 69--78. Gelareh Taban, Alvaro A. C\u00e1rdenas, and Virgil D. Gligor. 2006. Towards a secure and interoperable DRM architecture. In Proceedings of DRM\u201906. ACM, New York, NY, 69--78."},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/JAIEE.1926.6534724"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/WIFS.2010.5711448"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1566-2535(02)00055-6"},{"volume-title":"Proceedings of INFOCOM\u201912","author":"Yan Qiben","key":"e_1_2_1_69_1","unstructured":"Qiben Yan , Ming Li , Tingting Jiang , Wenjing Lou , and Y. Thomas Hou . 2012. Vulnerability and protection for distributed consensus-based spectrum sensing in cognitive radio networks . In Proceedings of INFOCOM\u201912 . IEEE, Los Alamitos, CA, 900--908. Qiben Yan, Ming Li, Tingting Jiang, Wenjing Lou, and Y. Thomas Hou. 2012. Vulnerability and protection for distributed consensus-based spectrum sensing in cognitive radio networks. In Proceedings of INFOCOM\u201912. IEEE, Los Alamitos, CA, 900--908."},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2009.5379832"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462174"}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3137573","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3137573","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:10Z","timestamp":1750212670000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3137573"}},"subtitle":["<u>O<\/u>\n            bfuscation-Based Privacy-Preserving Consensus Algorithm for\n            <u>D<\/u>\n            ecentralized\n            <u>I<\/u>\n            nformation Fusion in Smart Device\n            <u>N<\/u>\n            etworks"],"short-title":[],"issued":{"date-parts":[[2017,10,26]]},"references-count":73,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,2,28]]}},"alternative-id":["10.1145\/3137573"],"URL":"https:\/\/doi.org\/10.1145\/3137573","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"type":"print","value":"1533-5399"},{"type":"electronic","value":"1557-6051"}],"subject":[],"published":{"date-parts":[[2017,10,26]]},"assertion":[{"value":"2016-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}