{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:28:09Z","timestamp":1740122889426,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"26","license":[{"start":{"date-parts":[[2024,1,27]],"date-time":"2024-01-27T00:00:00Z","timestamp":1706313600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,27]],"date-time":"2024-01-27T00:00:00Z","timestamp":1706313600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"DOI":"10.1007\/s11042-024-18139-6","type":"journal-article","created":{"date-parts":[[2024,1,27]],"date-time":"2024-01-27T03:01:56Z","timestamp":1706324516000},"page":"67763-67777","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The oblivious comparison sorting protocols for secure multi-party computation"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7398-0076","authenticated-orcid":false,"given":"Koteswara Rao","family":"Ch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunwar","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anoop","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,27]]},"reference":[{"key":"18139_CR1","doi-asserted-by":"crossref","unstructured":"Yao AC-C (1982) Protocols for secure computations. In: 23rd Annual symposium on foundations of computer science, vol\u00a082, pp\u00a0160\u2013164","DOI":"10.1109\/SFCS.1982.38"},{"key":"18139_CR2","doi-asserted-by":"crossref","unstructured":"Micali S, Goldreich O, Wigderson A (1987) How to play any mental game. In: Proceedings of the 19th annual ACM symposium on theory of computing. ACM, pp\u00a0218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"18139_CR3","unstructured":"J\u00f6nsson KV, Kreitz G, Uddin M (2011) Secure multi-party sorting and applications. Cryptology ePrint Archive"},{"key":"18139_CR4","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I, Meldgaard S, Nielsen JB (2011) Perfectly secure oblivious RAM without random oracles. In: Theory of cryptography conference. Springer, pp 144\u2013163","DOI":"10.1007\/978-3-642-19571-6_10"},{"key":"18139_CR5","unstructured":"Y.\u00a0Huang, D.\u00a0Evans, J.\u00a0Katz (2012) Private set intersection: are garbled circuits better than custom protocols? In: NDSS"},{"key":"18139_CR6","unstructured":"Wigderson A, Or MB, Goldwasser S (1988) Completeness theorems for non-cryptographic fault-tolerant distributed computing. In: Proceedings of the 20th annual symposium on the theory of computing, pp 1\u201310"},{"key":"18139_CR7","unstructured":"Goldwasser S (1987) How to play any mental game, or a completeness theorem for protocols with an honest majority. In: Proceedings of the nineteenth annual ACM symposium on Theory of computing, pp 218\u2013229"},{"key":"18139_CR8","doi-asserted-by":"crossref","unstructured":"Ajtai M, Koml\u00f3s J, Szemer\u00e9di E (1983) An 0 (n log n) sorting network. In: Proceedings of the 15th annual ACM symposium on theory of computing. ACM, pp 1\u20139","DOI":"10.1145\/800061.808726"},{"key":"18139_CR9","doi-asserted-by":"crossref","unstructured":"Batcher KE (1968) Sorting networks and their applications. In: Proceedings of the April 30\u2013May 2, spring joint computer conference. ACM, pp 307\u2013314","DOI":"10.1145\/1468075.1468121"},{"key":"18139_CR10","doi-asserted-by":"crossref","unstructured":"Goodrich MT, Mitzenmacher M (2011) Privacy-preserving access of outsourced data via oblivious ram simulation. In: International colloquium on automata, languages, and programming. Springer, pp\u00a0576\u2013587","DOI":"10.1007\/978-3-642-22012-8_46"},{"key":"18139_CR11","doi-asserted-by":"crossref","unstructured":"Wang G, Luo T, Goodrich MT, Du W, Zhu Z (2010) Bureaucratic protocols for secure two-party sorting, selection, and permuting. In: Proceedings of the 5th ACM symposium on information, computer and communications security. ACM, pp 226\u2013237","DOI":"10.1145\/1755688.1755716"},{"key":"18139_CR12","unstructured":"Malkhi D, Nisan N, Pinkas B, Sella et\u00a0al (2004) Fairplay-secure two-party computation system. In: USENIX security symposium, vol\u00a04, San Diego, p\u00a09"},{"key":"18139_CR13","doi-asserted-by":"crossref","unstructured":"Goodrich MT (2010) Randomized Shellsort: a simple oblivious sorting algorithm. In: Proceedings of the 21st annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, pp 1262\u20131277","DOI":"10.1137\/1.9781611973075.101"},{"key":"18139_CR14","doi-asserted-by":"crossref","unstructured":"Zhang B (2011) Generic constant-round oblivious sorting algorithm for MPC. In: International conference on provable security. Springer, pp\u00a0240\u2013256","DOI":"10.1007\/978-3-642-24316-5_17"},{"key":"18139_CR15","doi-asserted-by":"crossref","unstructured":"Bogdanov D, Laur S, Willemson J (2008) Sharemind: a framework for fast privacy-preserving computations. In: European symposium on research in computer security. Springer, pp 192\u2013206","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"18139_CR16","doi-asserted-by":"crossref","unstructured":"Hamada K, Kikuchi R, Ikarashi D, Chida K, Takahashi K (2012) Practically efficient multi-party sorting protocols from comparison sort algorithms. In: International conference on information security and cryptology. Springer, pp 202\u2013216","DOI":"10.1007\/978-3-642-37682-5_15"},{"key":"18139_CR17","unstructured":"Hamada K, Ikarashi D, Chida K, Takahashi K (2014) Oblivious radix sort: an efficient sorting algorithm for practical secure multi-party computation. IACR Cryptology ePrint Archive 121"},{"key":"18139_CR18","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I, Fitzi M, Kiltz E, Nielsen JB, Toft T (2006) Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In: Theory of cryptography conference. Springer, pp 285\u2013304","DOI":"10.1007\/11681878_15"},{"key":"18139_CR19","doi-asserted-by":"crossref","unstructured":"Nishide T, Ohta K (2007) Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. In: International workshop on public key cryptography. Springer, pp 343\u2013360","DOI":"10.1007\/978-3-540-71677-8_23"},{"key":"18139_CR20","unstructured":"Liu CL (1986) Elements of discrete mathematics. Tata McGraw-Hill Education"},{"issue":"2","key":"18139_CR21","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1080\/00207160.2014.928286","volume":"93","author":"K Singh","year":"2016","unstructured":"Singh K, Rangan CP, Banerjee AK (2016) Lattice-based identity-based resplittable threshold public key encryption scheme. Int J Comput Math 93(2):289\u2013307","journal-title":"Int J Comput Math"},{"key":"18139_CR22","doi-asserted-by":"crossref","unstructured":"Dikshit P, Singh K (2017) Efficient weighted threshold ECDSA for securing bitcoin wallet. In: 2017 ISEA Asia security and privacy (ISEASP). IEEE, pp 1\u20139","DOI":"10.1109\/ISEASP.2017.7976994"},{"key":"18139_CR23","unstructured":"Tal Rabin Technion (2014) Secure multiparty computation. https:\/\/www.youtube.com\/watch?v=NOtsxHoIcWQ"},{"key":"18139_CR24","unstructured":"Goldreich O (2009) Foundations of cryptography: vol 2, basic applications. Cambridge"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-024-18139-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-024-18139-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-024-18139-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T01:13:18Z","timestamp":1721610798000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-024-18139-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,27]]},"references-count":24,"journal-issue":{"issue":"26","published-online":{"date-parts":[[2024,8]]}},"alternative-id":["18139"],"URL":"https:\/\/doi.org\/10.1007\/s11042-024-18139-6","relation":{},"ISSN":["1573-7721"],"issn-type":[{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2024,1,27]]},"assertion":[{"value":"15 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 January 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}