{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:45Z","timestamp":1750220325340,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T00:00:00Z","timestamp":1639440000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,12,14]]},"DOI":"10.1145\/3486622.3493937","type":"proceedings-article","created":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T01:18:53Z","timestamp":1649899133000},"page":"430-437","source":"Crossref","is-referenced-by-count":3,"title":["Blockchain-based Practical Multi-agent Secure Comparison and its Application in Auctions"],"prefix":"10.1145","author":[{"given":"Sankarshan","family":"Damle","sequence":"first","affiliation":[{"name":"Machine Learning Lab, IIIT, Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boi","family":"Faltings","sequence":"additional","affiliation":[{"name":"Artificial Intelligence Laboratory, EPFL, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sujit","family":"Gujar","sequence":"additional","affiliation":[{"name":"International Institute of Information Technology (IIIT), Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,4,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"RSA Conference. Springer, 453\u2013472","author":"Abspoel Mark","year":"2019","unstructured":"Mark Abspoel , Niek\u00a0 J Bouman , Berry Schoenmakers , and Niels de Vreede . 2019 . Fast secure comparison for medium-sized integers and its application in binarized neural networks. In Cryptographers\u2019 Track at the RSA Conference. Springer, 453\u2013472 . Mark Abspoel, Niek\u00a0J Bouman, Berry Schoenmakers, and Niels de Vreede. 2019. Fast secure comparison for medium-sized integers and its application in binarized neural networks. In Cryptographers\u2019 Track at the RSA Conference. Springer, 453\u2013472."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1109\/SFCS.1989.63520"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1007\/978-3-540-30539-2_36"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1007\/11507840_26"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/319709.319726"},{"key":"e_1_3_2_1_6_1","volume-title":"Conference on the Theory and Application of Cryptographic Techniques. 87\u2013119","author":"Chaum David","year":"1987","unstructured":"David Chaum , Ivan\u00a0 B Damg\u00e5rd , and Jeroen Van\u00a0de Graaf . 1987 . Multiparty computations ensuring privacy of each party\u2019s input and correctness of the result . In Conference on the Theory and Application of Cryptographic Techniques. 87\u2013119 . David Chaum, Ivan\u00a0B Damg\u00e5rd, and Jeroen Van\u00a0de Graaf. 1987. Multiparty computations ensuring privacy of each party\u2019s input and correctness of the result. In Conference on the Theory and Application of Cryptographic Techniques. 87\u2013119."},{"key":"e_1_3_2_1_7_1","volume-title":"Efficient Secure Comparison Protocols.IACR Cryptology ePrint Archive 2016","author":"Couteau Geoffroy","year":"2016","unstructured":"Geoffroy Couteau . 2016. Efficient Secure Comparison Protocols.IACR Cryptology ePrint Archive 2016 ( 2016 ), 544. Geoffroy Couteau. 2016. Efficient Secure Comparison Protocols.IACR Cryptology ePrint Archive 2016 (2016), 544."},{"unstructured":"Sankarshan Damle Boi Faltings and Sujit Gujar. 2019. A Practical Solution to Yao\u2019s Millionaires\u2019 Problem and Its Application in Designing Secure Combinatorial Auction. CoRR abs\/1906.06567(2019). arXiv:1906.06567  Sankarshan Damle Boi Faltings and Sujit Gujar. 2019. A Practical Solution to Yao\u2019s Millionaires\u2019 Problem and Its Application in Designing Secure Combinatorial Auction. CoRR abs\/1906.06567(2019). arXiv:1906.06567","key":"e_1_3_2_1_8_1"},{"unstructured":"Sankarshan Damle Boi Faltings and Sujit Gujar. 2019. A Truthful Privacy-Preserving Approximately Efficient Combinatorial Auction For Single-minded Bidders.. In AAMAS. 1916\u20131918.  Sankarshan Damle Boi Faltings and Sujit Gujar. 2019. A Truthful Privacy-Preserving Approximately Efficient Combinatorial Auction For Single-minded Bidders.. In AAMAS. 1916\u20131918.","key":"e_1_3_2_1_9_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.21236\/ADA465464"},{"key":"e_1_3_2_1_11_1","volume-title":"RSA Conference. 457\u2013471","author":"Fischlin Marc","year":"2001","unstructured":"Marc Fischlin . 2001 . A cost-effective pay-per-multiplication comparison method for millionaires. In Cryptographers\u2019 Track at the RSA Conference. 457\u2013471 . Marc Fischlin. 2001. A cost-effective pay-per-multiplication comparison method for millionaires. In Cryptographers\u2019 Track at the RSA Conference. 457\u2013471."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1007\/BF00195207"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1109\/ACCESS.2018.2827025"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1142\/S0129054114400036"},{"volume-title":"A privacy-preserving algorithm for distributed constraint optimization","author":"Grinshpoun Tal","unstructured":"Tal Grinshpoun and Tamir Tassa . 2014. A privacy-preserving algorithm for distributed constraint optimization . In AAMAS. International Foundation for Autonomous Agents and Multiagent Systems , 909\u2013916. Tal Grinshpoun and Tamir Tassa. 2014. A privacy-preserving algorithm for distributed constraint optimization. In AAMAS. International Foundation for Autonomous Agents and Multiagent Systems, 909\u2013916.","key":"e_1_3_2_1_15_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1109\/HICSS.2003.1174464"},{"volume-title":"2011 World Congress on Information and Communication Technologies. 1123\u20131126","author":"Kaghazgaran P.","unstructured":"P. Kaghazgaran and B. Sadeghyan . 2011. Secure two party comparison over encrypted data . In 2011 World Congress on Information and Communication Technologies. 1123\u20131126 . P. Kaghazgaran and B. Sadeghyan. 2011. Secure two party comparison over encrypted data. In 2011 World Congress on Information and Communication Technologies. 1123\u20131126.","key":"e_1_3_2_1_17_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1145\/2757302.2757305"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the IJCAI\u201d 09 Distributed Constraint Reasoning Workshop (DCR\u201d 09)","author":"L\u00e9aut\u00e9 Thomas","year":"2009","unstructured":"Thomas L\u00e9aut\u00e9 , Brammert Ottens , and Radoslaw Szymanek . 2009 . FRODO 2.0: An open-source framework for distributed constraint optimization . In Proceedings of the IJCAI\u201d 09 Distributed Constraint Reasoning Workshop (DCR\u201d 09) . 160\u2013164. Thomas L\u00e9aut\u00e9, Brammert Ottens, and Radoslaw Szymanek. 2009. FRODO 2.0: An open-source framework for distributed constraint optimization. In Proceedings of the IJCAI\u201d 09 Distributed Constraint Reasoning Workshop (DCR\u201d 09). 160\u2013164."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/585265.585266"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1007\/11496137_31"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1155\/2017\/5207386"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1257\/jep.8.3.145"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/2574871"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1007\/978-3-319-98989-1_20"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/336992.337028"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.5555\/2750423.2750431"},{"key":"e_1_3_2_1_28_1","volume-title":"National\u00a0Institute of Standards, and Technology","author":"U.S.\u00a0Department of Commerce","year":"2012","unstructured":"U.S.\u00a0Department of Commerce , National\u00a0Institute of Standards, and Technology . 2012 . Secure Hash Standard - SHS: Federal Information Processing Standards Publication 180-4. CreateSpace Independent Publishing Platform , North Charleston, SC, USA. U.S.\u00a0Department of Commerce, National\u00a0Institute of Standards, and Technology. 2012. Secure Hash Standard - SHS: Federal Information Processing Standards Publication 180-4. CreateSpace Independent Publishing Platform, North Charleston, SC, USA."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1016\/j.elerap.2008.04.006"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1007\/978-3-642-03549-4_19"},{"key":"e_1_3_2_1_31_1","volume-title":"Annual International Cryptology Conference. Springer, 129\u2013140","author":"Pedersen Torben\u00a0Pryds","year":"1991","unstructured":"Torben\u00a0Pryds Pedersen . 1991 . Non-interactive and information-theoretic secure verifiable secret sharing . In Annual International Cryptology Conference. Springer, 129\u2013140 . Torben\u00a0Pryds Pedersen. 1991. Non-interactive and information-theoretic secure verifiable secret sharing. In Annual International Cryptology Conference. Springer, 129\u2013140."},{"doi-asserted-by":"crossref","unstructured":"Stephen\u00a0J Rassenti Vernon\u00a0L Smith and Robert\u00a0L Bulfin. 1982. A combinatorial auction mechanism for airport time slot allocation. The Bell Journal of Economics(1982) 402\u2013417.  Stephen\u00a0J Rassenti Vernon\u00a0L Smith and Robert\u00a0L Bulfin. 1982. A combinatorial auction mechanism for airport time slot allocation. The Bell Journal of Economics(1982) 402\u2013417.","key":"e_1_3_2_1_32_1","DOI":"10.2307\/3003463"},{"key":"e_1_3_2_1_33_1","volume-title":"Computationally manageable combinational auctions. Management science 44, 8","author":"Rothkopf H","year":"1998","unstructured":"Michael\u00a0 H Rothkopf , Aleksandar Peke\u010d , and Ronald\u00a0 M Harstad . 1998. Computationally manageable combinational auctions. Management science 44, 8 ( 1998 ), 1131\u20131147. Michael\u00a0H Rothkopf, Aleksandar Peke\u010d, and Ronald\u00a0M Harstad. 1998. Computationally manageable combinational auctions. Management science 44, 8 (1998), 1131\u20131147."},{"unstructured":"Tuomas Sandholm. 1999. An algorithm for optimal winner determination in combinatorial auctions. (1999).  Tuomas Sandholm. 1999. An algorithm for optimal winner determination in combinatorial auctions. (1999).","key":"e_1_3_2_1_34_1"},{"key":"e_1_3_2_1_35_1","volume-title":"International Conference on Financial Cryptography. Springer, 44\u201356","author":"Suzuki Koutarou","year":"2002","unstructured":"Koutarou Suzuki and Makoto Yokoo . 2002 . Secure combinatorial auctions by dynamic programming with polynomial secret sharing . In International Conference on Financial Cryptography. Springer, 44\u201356 . Koutarou Suzuki and Makoto Yokoo. 2002. Secure combinatorial auctions by dynamic programming with polynomial secret sharing. In International Conference on Financial Cryptography. Springer, 44\u201356."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.5555\/3176788.3176796"},{"unstructured":"Tamir Tassa Roie Zivan and Tal Grinshpoun. 2015. Max-Sum Goes Private.. In IJCAI Vol.\u00a01360. 425\u2013431.  Tamir Tassa Roie Zivan and Tal Grinshpoun. 2015. Max-Sum Goes Private.. In IJCAI Vol.\u00a01360. 425\u2013431.","key":"e_1_3_2_1_37_1"},{"unstructured":"Tamir Tassa Roie Zivan and Tal Grinshpoun. 2016. Preserving Privacy in Region Optimal DCOP Algorithms.. In IJCAI. 496\u2013502.  Tamir Tassa Roie Zivan and Tal Grinshpoun. 2016. Preserving Privacy in Region Optimal DCOP Algorithms.. In IJCAI. 496\u2013502.","key":"e_1_3_2_1_38_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_39_1","DOI":"10.1007\/BFb0054019"},{"key":"e_1_3_2_1_40_1","volume-title":"Sats: A universal spectrum auction test suite. In AAMAS. 51\u201359.","author":"Weiss Michael","year":"2017","unstructured":"Michael Weiss , Benjamin Lubin , and Sven Seuken . 2017 . Sats: A universal spectrum auction test suite. In AAMAS. 51\u201359. Michael Weiss, Benjamin Lubin, and Sven Seuken. 2017. Sats: A universal spectrum auction test suite. In AAMAS. 51\u201359."},{"volume-title":"The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title=Smart_contract.","author":"Wikipedia","unstructured":"Wikipedia contributors. 2018. Smart contract \u2014 Wikipedia , The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title=Smart_contract. Wikipedia contributors. 2018. Smart contract \u2014 Wikipedia, The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title=Smart_contract.","key":"e_1_3_2_1_41_1"},{"key":"e_1_3_2_1_42_1","volume-title":"Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper 151","author":"Gavin Wood","year":"2014","unstructured":"Gavin Wood 2014. Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper 151 , 2014 (2014), 1\u201332. Gavin Wood 2014. Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper 151, 2014 (2014), 1\u201332."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_43_1","DOI":"10.1109\/SFCS.1982.38"},{"volume-title":"2016 4th International Conference on Cloud Computing and Intelligence Systems (CCIS). 343\u2013349","author":"Yao Y.","unstructured":"Y. Yao , J. Wei , J. Liu , and R. Zhang . 2016. Efficiently secure multiparty computation based on homomorphic encryption . In 2016 4th International Conference on Cloud Computing and Intelligence Systems (CCIS). 343\u2013349 . Y. Yao, J. Wei, J. Liu, and R. Zhang. 2016. Efficiently secure multiparty computation based on homomorphic encryption. In 2016 4th International Conference on Cloud Computing and Intelligence Systems (CCIS). 343\u2013349.","key":"e_1_3_2_1_44_1"}],"event":{"sponsor":["SIGAI ACM Special Interest Group on Artificial Intelligence"],"acronym":"WI-IAT '21","name":"WI-IAT '21: IEEE\/WIC\/ACM International Conference on Web Intelligence","location":"ESSENDON VIC Australia"},"container-title":["IEEE\/WIC\/ACM International Conference on Web Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3486622.3493937","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3486622.3493937","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:06Z","timestamp":1750191126000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3486622.3493937"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,14]]},"references-count":44,"alternative-id":["10.1145\/3486622.3493937","10.1145\/3486622"],"URL":"https:\/\/doi.org\/10.1145\/3486622.3493937","relation":{},"subject":[],"published":{"date-parts":[[2021,12,14]]}}}