{"id":"https://openalex.org/W4388894112","doi":"https://doi.org/10.1109/pst58708.2023.10320182","title":"Private set intersection using RSA subgroups with constant-size encryptions","display_name":"Private set intersection using RSA subgroups with constant-size encryptions","publication_year":2023,"publication_date":"2023-08-21","ids":{"openalex":"https://openalex.org/W4388894112","doi":"https://doi.org/10.1109/pst58708.2023.10320182"},"language":"en","primary_location":{"id":"doi:10.1109/pst58708.2023.10320182","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pst58708.2023.10320182","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 20th Annual International Conference on Privacy, Security and Trust (PST)","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/A5051616146","display_name":"Sigurd Eskeland","orcid":"https://orcid.org/0000-0003-0045-3387"},"institutions":[{"id":"https://openalex.org/I144648426","display_name":"Norwegian Computing Center","ror":"https://ror.org/02gm7te43","country_code":"NO","type":"nonprofit","lineage":["https://openalex.org/I144648426"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Sigurd Eskeland","raw_affiliation_strings":["Norsk Regnesentral,Oslo,Norway,0314"],"affiliations":[{"raw_affiliation_string":"Norsk Regnesentral,Oslo,Norway,0314","institution_ids":["https://openalex.org/I144648426"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5051616146"],"corresponding_institution_ids":["https://openalex.org/I144648426"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15217118,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"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.9944000244140625,"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/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9810000061988831,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/intersection","display_name":"Intersection (aeronautics)","score":0.7823483943939209},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6610731482505798},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6276238560676575},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6150790452957153},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5987840294837952},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5953994989395142},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.57220858335495},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5579041242599487},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5312283635139465},{"id":"https://openalex.org/keywords/secure-multi-party-computation","display_name":"Secure multi-party computation","score":0.47110515832901},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4313163161277771},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33405250310897827},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27234405279159546}],"concepts":[{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.7823483943939209},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6610731482505798},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6276238560676575},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6150790452957153},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5987840294837952},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5953994989395142},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.57220858335495},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5579041242599487},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5312283635139465},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.47110515832901},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4313163161277771},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33405250310897827},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27234405279159546},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/pst58708.2023.10320182","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pst58708.2023.10320182","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 20th Annual International Conference on Privacy, Security and Trust (PST)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1485216661","https://openalex.org/W1510216169","https://openalex.org/W1577229502","https://openalex.org/W1596831315","https://openalex.org/W1836919303","https://openalex.org/W2026179596","https://openalex.org/W2043944888","https://openalex.org/W2091827019","https://openalex.org/W2107884898","https://openalex.org/W2143087446","https://openalex.org/W2149603017","https://openalex.org/W2164409696","https://openalex.org/W2212846837","https://openalex.org/W2782492233","https://openalex.org/W2794288670","https://openalex.org/W2947287050","https://openalex.org/W3214336257","https://openalex.org/W6676898160"],"related_works":["https://openalex.org/W2348909947","https://openalex.org/W4292672442","https://openalex.org/W2362101859","https://openalex.org/W2791431590","https://openalex.org/W2941610985","https://openalex.org/W4235810826","https://openalex.org/W2350688482","https://openalex.org/W4387560420","https://openalex.org/W2810615277","https://openalex.org/W2141593530"],"abstract_inverted_index":{"Private":[0],"set":[1,73],"intersection":[2],"(PSI)":[3],"evaluation":[4,47],"is":[5,52,77,102],"a":[6,25],"well-known":[7],"secure":[8],"multiparty":[9],"computation":[10],"problem":[11],"that":[12,51,62],"has":[13],"received":[14],"much":[15],"attention.":[16],"Authors":[17],"generally":[18],"tend":[19],"to":[20,44,59,71,80],"state":[21],"improved":[22],"performance":[23],"as":[24],"goal":[26],"and":[27,41,68,84,92],"justification":[28],"for":[29,48],"their":[30],"proposed":[31],"PSI":[32,46,97],"schemes.":[33],"In":[34],"this":[35],"paper,":[36],"we":[37],"propose":[38],"an":[39],"original":[40],"new":[42],"approach":[43],"two-party":[45],"small":[49,55],"sets":[50,101],"based":[53],"on":[54],"RSA":[56],"subgroups.":[57],"Contrary":[58],"previous":[60],"approaches":[61],"at":[63],"best":[64],"incur":[65],"linear":[66],"communication":[67,83],"computational":[69,85],"complexity":[70,86],"the":[72,78],"size,":[74],"our":[75],"scheme":[76,98],"first":[79],"achieve":[81],"constant":[82],"incurring":[87],"only":[88],"2":[89],"group":[90],"elements":[91],"5":[93],"exponentiations.":[94],"An":[95],"extended":[96],"handling":[99],"larger":[100],"also":[103],"proposed.":[104]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}