{"id":"https://openalex.org/W2060393385","doi":"https://doi.org/10.1145/2810103.2813601","title":"Automating Fast and Secure Translations from Type-I to Type-III Pairing Schemes","display_name":"Automating Fast and Secure Translations from Type-I to Type-III Pairing Schemes","publication_year":2015,"publication_date":"2015-10-06","ids":{"openalex":"https://openalex.org/W2060393385","doi":"https://doi.org/10.1145/2810103.2813601","mag":"2060393385"},"language":"en","primary_location":{"id":"doi:10.1145/2810103.2813601","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2810103.2813601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security","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/A5072635090","display_name":"Joseph A. Akinyele","orcid":null},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Joseph A. Akinyele","raw_affiliation_strings":["Johns Hopkins University, Baltimore, MD, USA"],"affiliations":[{"raw_affiliation_string":"Johns Hopkins University, Baltimore, MD, USA","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029779272","display_name":"Christina Garman","orcid":"https://orcid.org/0009-0006-5077-5404"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christina Garman","raw_affiliation_strings":["Johns Hopkins University, Baltimore, MD, USA"],"affiliations":[{"raw_affiliation_string":"Johns Hopkins University, Baltimore, MD, USA","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083731744","display_name":"Susan Hohenberger","orcid":null},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Susan Hohenberger","raw_affiliation_strings":["Johns Hopkins University, Baltimore, MD, USA"],"affiliations":[{"raw_affiliation_string":"Johns Hopkins University, Baltimore, MD, USA","institution_ids":["https://openalex.org/I145311948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5072635090"],"corresponding_institution_ids":["https://openalex.org/I145311948"],"apc_list":null,"apc_paid":null,"fwci":6.903,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.96873605,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1370","last_page":"1381"},"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9995999932289124,"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/T11130","display_name":"Coding theory and cryptography","score":0.9991000294685364,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pairing","display_name":"Pairing","score":0.7657778263092041},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7275650501251221},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.6601989269256592},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5819642543792725},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5656490325927734},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5397430658340454},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.47813713550567627},{"id":"https://openalex.org/keywords/secure-multi-party-computation","display_name":"Secure multi-party computation","score":0.4768182635307312},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4672520160675049},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2730637490749359},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25652122497558594}],"concepts":[{"id":"https://openalex.org/C14103023","wikidata":"https://www.wikidata.org/wiki/Q11681459","display_name":"Pairing","level":3,"score":0.7657778263092041},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7275650501251221},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.6601989269256592},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5819642543792725},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5656490325927734},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5397430658340454},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.47813713550567627},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.4768182635307312},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4672520160675049},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2730637490749359},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25652122497558594},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C54101563","wikidata":"https://www.wikidata.org/wiki/Q124131","display_name":"Superconductivity","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2810103.2813601","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2810103.2813601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G38644319","display_name":null,"funder_award_id":"N00014-14-1-0333","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G3955588834","display_name":null,"funder_award_id":"CNS-1228443","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W49963507","https://openalex.org/W97295072","https://openalex.org/W174958306","https://openalex.org/W1484751769","https://openalex.org/W1491262044","https://openalex.org/W1546774120","https://openalex.org/W1553083934","https://openalex.org/W1592092778","https://openalex.org/W1635220080","https://openalex.org/W1888254701","https://openalex.org/W1905774212","https://openalex.org/W1931527931","https://openalex.org/W1999078045","https://openalex.org/W2014239329","https://openalex.org/W2039683463","https://openalex.org/W2078590992","https://openalex.org/W2098147685","https://openalex.org/W2112842125","https://openalex.org/W2117685508","https://openalex.org/W2117797270","https://openalex.org/W2152924492","https://openalex.org/W2951309919"],"related_works":["https://openalex.org/W2379597415","https://openalex.org/W2089259585","https://openalex.org/W185246777","https://openalex.org/W2206791037","https://openalex.org/W654550811","https://openalex.org/W2125679084","https://openalex.org/W2951438088","https://openalex.org/W2963730492","https://openalex.org/W2005198731","https://openalex.org/W2170398668"],"abstract_inverted_index":{"Pairing-based":[0],"cryptography":[1],"has":[2],"exploded":[3],"over":[4],"the":[5,31,65,72,84,112,118,141,147],"last":[6],"decade,":[7],"as":[8],"this":[9],"algebraic":[10,115],"setting":[11,116],"offers":[12],"good":[13],"functionality":[14],"and":[15,34,61,71,95,140],"efficiency.":[16],"However,":[17],"there":[18,46,123],"is":[19,44,55,69,82],"a":[20,134,137],"huge":[21],"security":[22,120],"gap":[23],"between":[24],"how":[25,35,57],"schemes":[26,58],"are":[27,37,59,99,124],"usually":[28,125],"analyzed":[29],"in":[30,64,91,114],"academic":[32],"literature":[33],"they":[36],"typically":[38,56,83],"implemented.":[39],"The":[40],"issue":[41],"at":[42],"play":[43],"that":[45],"exist":[47],"multiple":[48,126],"types":[49],"of":[50,93,129],"pairings:":[51],"Type-I":[52,135],"called":[53,80],"\"symmetric\"":[54],"presented":[60],"proven":[62],"secure":[63],"literature,":[66],"because":[67],"it":[68],"simpler":[70],"complexity":[73],"assumptions":[74],"can":[75],"be":[76],"weaker;":[77],"however,":[78],"Type-III":[79,138],"\"asymmetric\"":[81],"most":[85],"efficient":[86],"choice":[87],"for":[88],"an":[89],"implementation":[90],"terms":[92],"bandwidth":[94],"computation":[96],"time.":[97],"There":[98],"two":[100],"main":[101],"complexities":[102],"when":[103],"moving":[104],"from":[105,133],"one":[106],"pairing":[107],"type":[108],"to":[109,131,136],"another.":[110],"First,":[111],"change":[113],"invalidates":[117],"original":[119],"proof.":[121],"Second,":[122],"(possibly":[127],"thousands)":[128],"ways":[130],"translate":[132],"scheme,":[139],"\"best\"":[142],"translation":[143],"may":[144],"depend":[145],"on":[146],"application.":[148]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}