{"id":"https://openalex.org/W2914754693","doi":"https://doi.org/10.1109/isit.2019.8849825","title":"Private Polynomial Computation for Noncolluding Coded Databases","display_name":"Private Polynomial Computation for Noncolluding Coded Databases","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2914754693","doi":"https://doi.org/10.1109/isit.2019.8849825","mag":"2914754693"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849825","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849825","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1901.10286","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Sarah A. Obead","orcid":null},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sarah A. Obead","raw_affiliation_strings":["Helen and John C. Hartmann Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, New Jersey, 07102, USA"],"affiliations":[{"raw_affiliation_string":"Helen and John C. Hartmann Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, New Jersey, 07102, USA","institution_ids":["https://openalex.org/I118118575"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Hsuan-Yin Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I2799829267","display_name":"Simula Research Laboratory","ror":"https://ror.org/00vn06n10","country_code":"NO","type":"facility","lineage":["https://openalex.org/I2799829267"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Hsuan-Yin Lin","raw_affiliation_strings":["Simula UiB, Bergen, N-5008, Norway"],"affiliations":[{"raw_affiliation_string":"Simula UiB, Bergen, N-5008, Norway","institution_ids":["https://openalex.org/I2799829267"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Eirik Rosnes","orcid":null},"institutions":[{"id":"https://openalex.org/I2799829267","display_name":"Simula Research Laboratory","ror":"https://ror.org/00vn06n10","country_code":"NO","type":"facility","lineage":["https://openalex.org/I2799829267"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Eirik Rosnes","raw_affiliation_strings":["Simula UiB, Bergen, N-5008, Norway"],"affiliations":[{"raw_affiliation_string":"Simula UiB, Bergen, N-5008, Norway","institution_ids":["https://openalex.org/I2799829267"]}]},{"author_position":"last","author":{"id":null,"display_name":"J\u00f6rg Kliewer","orcid":null},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J\u00f6rg Kliewer","raw_affiliation_strings":["Helen and John C. Hartmann Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, New Jersey, 07102, USA"],"affiliations":[{"raw_affiliation_string":"Helen and John C. Hartmann Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, New Jersey, 07102, USA","institution_ids":["https://openalex.org/I118118575"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I118118575"],"apc_list":null,"apc_paid":null,"fwci":0.7234,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.77773574,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1677","last_page":"1681"},"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.9987999796867371,"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.9973000288009644,"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/computation","display_name":"Computation","score":0.6880999803543091},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.6388000249862671},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5748999714851379},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5490000247955322},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5138999819755554},{"id":"https://openalex.org/keywords/lagrange-polynomial","display_name":"Lagrange polynomial","score":0.4250999987125397}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6880999803543091},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.6388000249862671},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5748999714851379},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5490000247955322},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5138999819755554},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46209999918937683},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4453999996185303},{"id":"https://openalex.org/C64208722","wikidata":"https://www.wikidata.org/wiki/Q861606","display_name":"Lagrange polynomial","level":3,"score":0.4250999987125397},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3882000148296356},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3756999969482422},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.36169999837875366},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.34549999237060547},{"id":"https://openalex.org/C161584116","wikidata":"https://www.wikidata.org/wiki/Q1952580","display_name":"Multivariate statistics","level":2,"score":0.32499998807907104},{"id":"https://openalex.org/C99221444","wikidata":"https://www.wikidata.org/wiki/Q1532069","display_name":"Private information retrieval","level":2,"score":0.2879999876022339},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2809000015258789},{"id":"https://openalex.org/C110812573","wikidata":"https://www.wikidata.org/wiki/Q175515","display_name":"Symbolic computation","level":2,"score":0.26829999685287476}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2019.8849825","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849825","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1901.10286","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1901.10286","pdf_url":"https://arxiv.org/pdf/1901.10286","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1901.10286","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1901.10286","pdf_url":"https://arxiv.org/pdf/1901.10286","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W2150307013","https://openalex.org/W2260085643","https://openalex.org/W2599749253","https://openalex.org/W2789160219","https://openalex.org/W2888580722","https://openalex.org/W2898063871","https://openalex.org/W2962692592","https://openalex.org/W2962900443","https://openalex.org/W2963413537","https://openalex.org/W2963485144","https://openalex.org/W2963942468","https://openalex.org/W2964081636","https://openalex.org/W2964177287","https://openalex.org/W6752557422","https://openalex.org/W6765302502"],"related_works":[],"abstract_inverted_index":{"We":[0,47],"consider":[1,74],"private":[2,64,88],"polynomial":[3,21,43],"computation":[4,66],"(PPC)":[5],"over":[6,27],"noncolluding":[7],"coded":[8,68,76,93,103],"databases.":[9,46,69],"In":[10,70],"such":[11],"a":[12,14,19,57,124],"setting":[13],"user":[15],"wishes":[16],"to":[17,44,115],"compute":[18],"multivariate":[20],"of":[22,59,102,127],"degree":[23],"at":[24],"most":[25],"g":[26],"f":[28],"variables":[29],"(or":[30],"messages)":[31],"stored":[32],"in":[33,63,130],"multiple":[34],"databases":[35,77,104],"while":[36,129],"revealing":[37],"no":[38],"information":[39,89],"about":[40],"the":[41,45,54,99,116,121,131,134],"desired":[42],"construct":[48],"two":[49],"novel":[50],"PPC":[51],"schemes,":[52],"where":[53],"first":[55],"is":[56],"generalization":[58],"our":[60],"previous":[61],"work":[62],"linear":[65],"for":[67,123],"this":[71],"scheme":[72,97],"we":[73],"Reed-Solomon":[75],"with":[78,105],"Lagrange":[79,92,107],"encoding,":[80],"which":[81],"leverages":[82],"ideas":[83],"from":[84,120],"recently":[85],"proposed":[86],"star-product":[87],"retrieval":[90],"and":[91],"computation.":[94],"The":[95],"second":[96],"considers":[98],"special":[100],"case":[101,133],"systematic":[106],"encoding.":[108],"Both":[109],"schemes":[110,119],"yield":[111],"improved":[112],"rates":[113,135],"compared":[114],"best":[117],"known":[118],"literature":[122],"small":[125],"number":[126],"messages,":[128],"asymptotic":[132],"match.":[136]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2019-02-21T00:00:00"}