{"id":"https://openalex.org/W4308644336","doi":"https://doi.org/10.1145/3548606.3560670","title":"Secret-Shared Joins with Multiplicity from Aggregation Trees","display_name":"Secret-Shared Joins with Multiplicity from Aggregation Trees","publication_year":2022,"publication_date":"2022-11-07","ids":{"openalex":"https://openalex.org/W4308644336","doi":"https://doi.org/10.1145/3548606.3560670"},"language":"en","primary_location":{"id":"doi:10.1145/3548606.3560670","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3548606.3560670","pdf_url":null,"source":{"id":"https://openalex.org/S4363608815","display_name":"Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 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/A5086787223","display_name":"Saikrishna Badrinarayanan","orcid":null},"institutions":[{"id":"https://openalex.org/I4210142583","display_name":"Snap (United States)","ror":"https://ror.org/04dgkhg68","country_code":"US","type":"company","lineage":["https://openalex.org/I4210142583"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Saikrishna Badrinarayanan","raw_affiliation_strings":["Snap, Palo Alto, CA, USA"],"affiliations":[{"raw_affiliation_string":"Snap, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I4210142583"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100657677","display_name":"Sourav Das","orcid":"https://orcid.org/0000-0002-2576-0482"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sourav Das","raw_affiliation_strings":["University of Illinois Urbana Champaign, Champaign, IL, USA"],"affiliations":[{"raw_affiliation_string":"University of Illinois Urbana Champaign, Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048421200","display_name":"Gayathri Garimella","orcid":null},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gayathri Garimella","raw_affiliation_strings":["Oregon State University, Corvallis, OR, USA"],"affiliations":[{"raw_affiliation_string":"Oregon State University, Corvallis, OR, USA","institution_ids":["https://openalex.org/I131249849"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049567046","display_name":"Srinivasan Raghuraman","orcid":null},"institutions":[{"id":"https://openalex.org/I4210148469","display_name":"Visa (United States)","ror":"https://ror.org/05t1y0b59","country_code":"US","type":"company","lineage":["https://openalex.org/I4210148469"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Srinivasan Raghuraman","raw_affiliation_strings":["Visa Research, Palo Alto, CA, USA"],"affiliations":[{"raw_affiliation_string":"Visa Research, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I4210148469"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070581119","display_name":"Peter Rindal","orcid":"https://orcid.org/0000-0003-2402-7411"},"institutions":[{"id":"https://openalex.org/I4210148469","display_name":"Visa (United States)","ror":"https://ror.org/05t1y0b59","country_code":"US","type":"company","lineage":["https://openalex.org/I4210148469"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peter Rindal","raw_affiliation_strings":["Visa Research, Palo Alto, CA, USA"],"affiliations":[{"raw_affiliation_string":"Visa Research, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I4210148469"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5086787223"],"corresponding_institution_ids":["https://openalex.org/I4210142583"],"apc_list":null,"apc_paid":null,"fwci":0.9365,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.76889511,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"209","last_page":"222"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/joins","display_name":"Joins","score":0.8752070665359497},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7392753958702087},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.6632931232452393},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4808800518512726},{"id":"https://openalex.org/keywords/sql","display_name":"SQL","score":0.43257176876068115},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.42589178681373596},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.230243980884552},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2244509756565094},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20457488298416138},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.20100346207618713},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12757647037506104}],"concepts":[{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.8752070665359497},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7392753958702087},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.6632931232452393},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4808800518512726},{"id":"https://openalex.org/C510870499","wikidata":"https://www.wikidata.org/wiki/Q47607","display_name":"SQL","level":2,"score":0.43257176876068115},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.42589178681373596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.230243980884552},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2244509756565094},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20457488298416138},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.20100346207618713},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12757647037506104}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3548606.3560670","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3548606.3560670","pdf_url":null,"source":{"id":"https://openalex.org/S4363608815","display_name":"Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security","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":18,"referenced_works":["https://openalex.org/W181949725","https://openalex.org/W632399495","https://openalex.org/W2535199873","https://openalex.org/W2569238585","https://openalex.org/W2753539753","https://openalex.org/W2765239305","https://openalex.org/W2766393794","https://openalex.org/W2767023267","https://openalex.org/W2795178974","https://openalex.org/W2889629344","https://openalex.org/W2898963020","https://openalex.org/W2900507195","https://openalex.org/W2922077514","https://openalex.org/W2963752132","https://openalex.org/W2968964112","https://openalex.org/W3013638630","https://openalex.org/W3108839201","https://openalex.org/W3166373439"],"related_works":["https://openalex.org/W2393491644","https://openalex.org/W4206577045","https://openalex.org/W3086237447","https://openalex.org/W650102067","https://openalex.org/W2740404111","https://openalex.org/W1550806730","https://openalex.org/W1496672428","https://openalex.org/W2589740103","https://openalex.org/W1966967794","https://openalex.org/W1501284171"],"abstract_inverted_index":{"We":[0],"present":[1],"novel":[2],"protocols":[3],"to":[4,20,57],"compute":[5],"SQL-like":[6],"join":[7,16,28,66],"operations":[8],"on":[9],"secret":[10,53],"shared":[11,54],"database":[12],"tables":[13,34,56],"with":[14],"non-unique":[15],"keys.":[17,88],"Previous":[18],"approaches":[19],"the":[21,24,27,32,52,84,87],"problem":[22],"had":[23,39],"restriction":[25],"that":[26],"keys":[29,67],"of":[30,51,64,80,83,86],"both":[31,50],"input":[33,55],"must":[35],"be":[36],"unique":[37],"or":[38,49],"quadratic":[40],"overhead.":[41],"Our":[42],"work":[43],"lifts":[44],"this":[45],"restriction,":[46],"allowing":[47],"one":[48],"have":[58],"an":[59],"unknown":[60],"and":[61,76],"unbounded":[62],"number":[63],"repeating":[65],"while":[68],"achieving":[69],"efficient":[70],"O(n":[71],"log":[72],"n)":[73,78],"asymptotic":[74],"communication/computation":[75],"O(log":[77],"rounds":[79],"interaction,":[81],"independent":[82],"multiplicity":[85]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}