{"id":"https://openalex.org/W3139421608","doi":"https://doi.org/10.3233/jhs-210652","title":"Oblivious stable sorting protocol and oblivious binary search protocol for secure multi-party computation","display_name":"Oblivious stable sorting protocol and oblivious binary search protocol for secure multi-party computation","publication_year":2021,"publication_date":"2021-03-19","ids":{"openalex":"https://openalex.org/W3139421608","doi":"https://doi.org/10.3233/jhs-210652","mag":"3139421608"},"language":"en","primary_location":{"id":"doi:10.3233/jhs-210652","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jhs-210652","pdf_url":null,"source":{"id":"https://openalex.org/S133922704","display_name":"Journal of High Speed Networks","issn_l":"0926-6801","issn":["0926-6801","1875-8940"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of High Speed Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045074020","display_name":"Koteswararao Ch","orcid":"https://orcid.org/0000-0002-7398-0076"},"institutions":[{"id":"https://openalex.org/I122964287","display_name":"National Institute of Technology Tiruchirappalli","ror":"https://ror.org/047x65e68","country_code":"IN","type":"education","lineage":["https://openalex.org/I122964287"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Ch Koteswara Rao","raw_affiliation_strings":["Computer Science and Engineering Department, National Institute of Technology\u00a0\u2013 Tiruchirappalli, Tamil Nadu\u00a0\u2013 620015, India. E-mails:\u00a0kunwar@nitt.edu,\u00a0106117011@nitt.edu"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, National Institute of Technology\u00a0\u2013 Tiruchirappalli, Tamil Nadu\u00a0\u2013 620015, India. E-mails:\u00a0kunwar@nitt.edu,\u00a0106117011@nitt.edu","institution_ids":["https://openalex.org/I122964287"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074927441","display_name":"Kunwar Singh","orcid":"https://orcid.org/0000-0001-5889-0964"},"institutions":[{"id":"https://openalex.org/I122964287","display_name":"National Institute of Technology Tiruchirappalli","ror":"https://ror.org/047x65e68","country_code":"IN","type":"education","lineage":["https://openalex.org/I122964287"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Kunwar Singh","raw_affiliation_strings":["Computer Science and Engineering Department, National Institute of Technology\u00a0\u2013 Tiruchirappalli, Tamil Nadu\u00a0\u2013 620015, India. E-mails:\u00a0kunwar@nitt.edu,\u00a0106117011@nitt.edu"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, National Institute of Technology\u00a0\u2013 Tiruchirappalli, Tamil Nadu\u00a0\u2013 620015, India. E-mails:\u00a0kunwar@nitt.edu,\u00a0106117011@nitt.edu","institution_ids":["https://openalex.org/I122964287"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101943453","display_name":"Anoop Kumar","orcid":"https://orcid.org/0009-0007-9124-7541"},"institutions":[{"id":"https://openalex.org/I122964287","display_name":"National Institute of Technology Tiruchirappalli","ror":"https://ror.org/047x65e68","country_code":"IN","type":"education","lineage":["https://openalex.org/I122964287"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Anoop Kumar","raw_affiliation_strings":["Computer Science and Engineering Department, National Institute of Technology\u00a0\u2013 Tiruchirappalli, Tamil Nadu\u00a0\u2013 620015, India. E-mails:\u00a0kunwar@nitt.edu,\u00a0106117011@nitt.edu"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, National Institute of Technology\u00a0\u2013 Tiruchirappalli, Tamil Nadu\u00a0\u2013 620015, India. E-mails:\u00a0kunwar@nitt.edu,\u00a0106117011@nitt.edu","institution_ids":["https://openalex.org/I122964287"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045074020"],"corresponding_institution_ids":["https://openalex.org/I122964287"],"apc_list":null,"apc_paid":null,"fwci":0.1365,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.50913615,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"27","issue":"1","first_page":"67","last_page":"82"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7931644320487976},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6178783774375916},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.6046000123023987},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.48012757301330566},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4794967770576477},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.4592876136302948},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45768606662750244},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41252878308296204},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18933570384979248},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.09223943948745728}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7931644320487976},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6178783774375916},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.6046000123023987},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.48012757301330566},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4794967770576477},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.4592876136302948},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45768606662750244},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41252878308296204},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18933570384979248},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.09223943948745728},{"id":"https://openalex.org/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/jhs-210652","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jhs-210652","pdf_url":null,"source":{"id":"https://openalex.org/S133922704","display_name":"Journal of High Speed Networks","issn_l":"0926-6801","issn":["0926-6801","1875-8940"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of High Speed Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W27720104","https://openalex.org/W114088334","https://openalex.org/W150396298","https://openalex.org/W151752673","https://openalex.org/W1485800369","https://openalex.org/W1565007622","https://openalex.org/W1704895987","https://openalex.org/W1888364621","https://openalex.org/W2003661250","https://openalex.org/W2006453614","https://openalex.org/W2013623332","https://openalex.org/W2027471022","https://openalex.org/W2054995322","https://openalex.org/W2076458424","https://openalex.org/W2082801123","https://openalex.org/W2092422002","https://openalex.org/W2130901615","https://openalex.org/W2141389982","https://openalex.org/W2735884948","https://openalex.org/W2810992153","https://openalex.org/W2910815950","https://openalex.org/W2941458609","https://openalex.org/W2949869114","https://openalex.org/W2951395850","https://openalex.org/W2954564073","https://openalex.org/W2990399857","https://openalex.org/W3029286359","https://openalex.org/W3047575081","https://openalex.org/W6752830663","https://openalex.org/W6761832155","https://openalex.org/W6765059575","https://openalex.org/W6765427374"],"related_works":["https://openalex.org/W2809748609","https://openalex.org/W3033694952","https://openalex.org/W2372558933","https://openalex.org/W2349288944","https://openalex.org/W797244100","https://openalex.org/W4298155039","https://openalex.org/W2801186172","https://openalex.org/W2367560286","https://openalex.org/W2181812531","https://openalex.org/W2368845094"],"abstract_inverted_index":{"Multi-party":[0],"computation":[1,23],"(MPC)":[2],"sorting":[3,81,198],"and":[4,27,41,56,75,91,112,140,186],"searching":[5,218],"protocols":[6,50,65],"are":[7,51,66],"frequently":[8],"used":[9,52],"in":[10,17,98,137,211],"different":[11],"databases":[12],"with":[13],"varied":[14],"applications,":[15],"as":[16,53,72,89],"cooperative":[18],"intrusion":[19],"detection":[20],"systems,":[21],"private":[22],"of":[24,86,95,134,147,156,171],"set":[25],"intersection":[26],"oblivious":[28,60],"RAM.":[29],"Ivan":[30],"Damgard":[31],"et":[32],"al.":[33],"have":[34,57],"proposed":[35,58,64,79,102,122,174,196,216],"two":[36,49,59,128],"techniques":[37],"i.e.,":[38],"bit-decomposition":[39],"protocol":[40,45,82,103,126,162,178,199,206,219],"bit-wise":[42],"less":[43],"than":[44,202],"for":[46],"MPC.":[47],"These":[48],"building":[54],"blocks":[55],"MPC":[61],"protocols.":[62],"The":[63,78,101,121,173,195,215],"based":[67],"on":[68],"data-dependent":[69],"algorithms":[70],"such":[71],"insertion":[73],"sort":[74],"binary":[76,124,176,230],"search.":[77],"multi-party":[80,123,175,197,217],"takes":[83,127],"the":[84,87,93,96,132,135,141,145,148,154,157,161,164,203,208,222,228],"shares":[85,94,133,146,170],"elements":[88,97,136],"input":[90,209],"outputs":[92],"sorted":[99,138,213],"order.":[100,214],"exhibits":[104,179],"O":[105,113,180,187],"(":[106,114,181,188],"1":[107,182],")":[108,118,183,192],"constant":[109],"round":[110,184],"complexity":[111,185],"n":[115,117,189,191],"log":[116,190],"communication":[119,193],"complexity.":[120,194],"search":[125,158,177,231],"inputs.":[129],"One":[130],"is":[131,144,210],"order":[139],"other":[142],"one":[143],"element":[149,159],"to":[150,227],"be":[151],"searched.":[152],"If":[153],"position":[155],"exists,":[160],"returns":[163,169],"corresponding":[165],"shares,":[166],"otherwise":[167],"it":[168],"zero.":[172],"works":[200],"better":[201],"existing":[204],"quicksort":[205],"when":[207,225],"almost":[212,221],"gives":[220],"same":[223],"results,":[224],"compared":[226],"general":[229],"algorithm.":[232]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}