{"id":"https://openalex.org/W2765341110","doi":"https://doi.org/10.1109/desec.2017.8073798","title":"Secure minimum weighted bipartite matching","display_name":"Secure minimum weighted bipartite matching","publication_year":2017,"publication_date":"2017-08-01","ids":{"openalex":"https://openalex.org/W2765341110","doi":"https://doi.org/10.1109/desec.2017.8073798","mag":"2765341110"},"language":"en","primary_location":{"id":"doi:10.1109/desec.2017.8073798","is_oa":false,"landing_page_url":"https://doi.org/10.1109/desec.2017.8073798","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Conference on Dependable and Secure Computing","raw_type":"proceedings-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/A5036633741","display_name":"Balamurugan Anandan","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Balamurugan Anandan","raw_affiliation_strings":["Department of Computer Science and CERIAS, Purdue University, West Lafayette, Indiana, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and CERIAS, Purdue University, West Lafayette, Indiana, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080294173","display_name":"Chris Clifton","orcid":"https://orcid.org/0000-0001-7274-1471"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chris Clifton","raw_affiliation_strings":["Department of Computer Science and CERIAS, Purdue University, West Lafayette, Indiana, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and CERIAS, Purdue University, West Lafayette, Indiana, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036633741"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":0.195,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.62965739,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9998000264167786,"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.9972000122070312,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8952678442001343},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7583165168762207},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6523594856262207},{"id":"https://openalex.org/keywords/differential-privacy","display_name":"Differential privacy","score":0.5697418451309204},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.557939887046814},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5172362923622131},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5146690011024475},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5142533183097839},{"id":"https://openalex.org/keywords/secure-multi-party-computation","display_name":"Secure multi-party computation","score":0.47758033871650696},{"id":"https://openalex.org/keywords/secure-two-party-computation","display_name":"Secure two-party computation","score":0.4729078710079193},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.4701267182826996},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.44918641448020935},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.433468759059906},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.4238317608833313},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37497150897979736},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18064084649085999}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8952678442001343},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7583165168762207},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6523594856262207},{"id":"https://openalex.org/C23130292","wikidata":"https://www.wikidata.org/wiki/Q5275358","display_name":"Differential privacy","level":2,"score":0.5697418451309204},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.557939887046814},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5172362923622131},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5146690011024475},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5142533183097839},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.47758033871650696},{"id":"https://openalex.org/C13652956","wikidata":"https://www.wikidata.org/wiki/Q7444883","display_name":"Secure two-party computation","level":4,"score":0.4729078710079193},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.4701267182826996},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.44918641448020935},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.433468759059906},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.4238317608833313},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37497150897979736},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18064084649085999},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"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/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/desec.2017.8073798","is_oa":false,"landing_page_url":"https://doi.org/10.1109/desec.2017.8073798","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Conference on Dependable and Secure Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1485800369","https://openalex.org/W1493407996","https://openalex.org/W1509999778","https://openalex.org/W1557833142","https://openalex.org/W1579771234","https://openalex.org/W1873763122","https://openalex.org/W1970141429","https://openalex.org/W1973991713","https://openalex.org/W1988374166","https://openalex.org/W2024197950","https://openalex.org/W2088492763","https://openalex.org/W2101771965","https://openalex.org/W2123139266","https://openalex.org/W2132172731","https://openalex.org/W2141420453","https://openalex.org/W2155720185","https://openalex.org/W2170993700","https://openalex.org/W2181401201","https://openalex.org/W2222512263","https://openalex.org/W2242625908","https://openalex.org/W2293904708","https://openalex.org/W6633508582","https://openalex.org/W6639246211"],"related_works":["https://openalex.org/W2083701517","https://openalex.org/W2082804893","https://openalex.org/W2382527959","https://openalex.org/W87038205","https://openalex.org/W2539281752","https://openalex.org/W2550686250","https://openalex.org/W2069340834","https://openalex.org/W2166322483","https://openalex.org/W2125679084","https://openalex.org/W3152465837"],"abstract_inverted_index":{"Simple":[0],"application":[1],"of":[2],"secure":[3],"multi-party":[4],"computation":[5],"techniques":[6],"on":[7],"an":[8],"algorithm":[9,19],"is":[10,20],"not":[11],"sufficient":[12],"to":[13,50],"guarantee":[14],"privacy,":[15],"if":[16,24],"the":[17,25,40],"underlying":[18],"data":[21,37],"dependent":[22],"or":[23],"output":[26],"can":[27,33,47],"leak":[28],"information.":[29],"The":[30],"first":[31],"issue":[32],"be":[34,48],"addressed":[35],"through":[36,42],"oblivious":[38],"computation,":[39],"second":[41],"differential":[43],"privacy.":[44],"However,":[45],"both":[46,58],"difficult":[49],"achieve":[51],"with":[52],"graph":[53],"algorithms.":[54],"This":[55],"paper":[56],"addresses":[57],"problems,":[59],"giving":[60],"a":[61],"differentially":[62],"private":[63],"data-oblivious":[64],"protocol":[65],"for":[66],"minimum":[67,72],"weighted":[68],"bipartite":[69],"matching":[70],"and":[71],"vertex":[73],"cover.":[74]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}