{"id":"https://openalex.org/W4395959403","doi":"https://doi.org/10.1007/978-3-031-58751-1_11","title":"Succinct Homomorphic Secret Sharing","display_name":"Succinct Homomorphic Secret Sharing","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4395959403","doi":"https://doi.org/10.1007/978-3-031-58751-1_11"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-58751-1_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-58751-1_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://pure.au.dk/portal/en/publications/9f0a8100-77b3-411d-9be1-5e98c475fa38","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075381059","display_name":"Damiano Abram","orcid":"https://orcid.org/0009-0004-3916-7550"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Damiano Abram","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark","Aarhus University, Natural Sciences, Department of Computer Science, DK"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Aarhus University, Natural Sciences, Department of Computer Science, DK","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050543367","display_name":"Lawrence Roy","orcid":"https://orcid.org/0009-0003-8436-0029"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Lawrence Roy","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark","Aarhus University, Natural Sciences, Department of Computer Science, DK"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Aarhus University, Natural Sciences, Department of Computer Science, DK","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018185386","display_name":"Peter Sch\u00f6ll","orcid":"https://orcid.org/0000-0002-7937-8422"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Peter Scholl","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark","Aarhus University, Natural Sciences, Department of Computer Science, DK"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Aarhus University, Natural Sciences, Department of Computer Science, DK","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5075381059"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":12.4679,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.98968703,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"301","last_page":"330"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9998999834060669,"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":0.9998999834060669,"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.9901000261306763,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9864000082015991,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/homomorphic-encryption","display_name":"Homomorphic encryption","score":0.896956205368042},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8604078888893127},{"id":"https://openalex.org/keywords/homomorphic-secret-sharing","display_name":"Homomorphic secret sharing","score":0.688686192035675},{"id":"https://openalex.org/keywords/secret-sharing","display_name":"Secret sharing","score":0.5568236708641052},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4851454198360443},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.43267005681991577},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.2930338978767395},{"id":"https://openalex.org/keywords/encryption","display_name":"Encryption","score":0.0966213047504425}],"concepts":[{"id":"https://openalex.org/C158338273","wikidata":"https://www.wikidata.org/wiki/Q2154943","display_name":"Homomorphic encryption","level":3,"score":0.896956205368042},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8604078888893127},{"id":"https://openalex.org/C132161212","wikidata":"https://www.wikidata.org/wiki/Q5891458","display_name":"Homomorphic secret sharing","level":4,"score":0.688686192035675},{"id":"https://openalex.org/C3087436","wikidata":"https://www.wikidata.org/wiki/Q1386603","display_name":"Secret sharing","level":3,"score":0.5568236708641052},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4851454198360443},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.43267005681991577},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.2930338978767395},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.0966213047504425}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-031-58751-1_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-58751-1_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:openaire/9f0a8100-77b3-411d-9be1-5e98c475fa38","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/9f0a8100-77b3-411d-9be1-5e98c475fa38","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Abram, D, Roy, L & Scholl, P 2024, Succinct Homomorphic Secret Sharing. in M Joye & G Leander (eds), Advances in Cryptology -- EUROCRYPT 2024. Springer Nature, Cham, pp. 301-330. https://doi.org/10.1007/978-3-031-58751-1_11","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/9f0a8100-77b3-411d-9be1-5e98c475fa38","is_oa":true,"landing_page_url":"https://www.scopus.com/pages/publications/85193597302","pdf_url":null,"source":{"id":"https://openalex.org/S4306400063","display_name":"Scopus (Elsevier)","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":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Abram, D, Roy, L & Scholl, P 2024, Succinct Homomorphic Secret Sharing. in M Joye & G Leander (eds), Advances in Cryptology -- EUROCRYPT 2024. Springer Nature, Cham, pp. 301-330. https://doi.org/10.1007/978-3-031-58751-1_11","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/f8dadf78-4a52-48bc-8907-3778d8deff98","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/f8dadf78-4a52-48bc-8907-3778d8deff98","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Abram , D , Roy , L D & Scholl , P 2024 , Succinct Homomorphic Secret Sharing . in Eurocrypt 2024 .","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/9f0a8100-77b3-411d-9be1-5e98c475fa38","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/9f0a8100-77b3-411d-9be1-5e98c475fa38","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Abram, D, Roy, L & Scholl, P 2024, Succinct Homomorphic Secret Sharing. in M Joye & G Leander (eds), Advances in Cryptology -- EUROCRYPT 2024. Springer Nature, Cham, pp. 301-330. https://doi.org/10.1007/978-3-031-58751-1_11","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W20180677","https://openalex.org/W2038761522","https://openalex.org/W2067596507","https://openalex.org/W2069717895","https://openalex.org/W2142048307","https://openalex.org/W2489433463","https://openalex.org/W2810336582","https://openalex.org/W2810615277","https://openalex.org/W2934305357","https://openalex.org/W2950017470","https://openalex.org/W2968502565","https://openalex.org/W2979237310","https://openalex.org/W3157351706","https://openalex.org/W3159942927","https://openalex.org/W3190538822","https://openalex.org/W3214651532","https://openalex.org/W4210592236","https://openalex.org/W4308411105","https://openalex.org/W4308642594","https://openalex.org/W4312588025","https://openalex.org/W4365807333","https://openalex.org/W4385654331","https://openalex.org/W4385654747","https://openalex.org/W4395959403"],"related_works":["https://openalex.org/W4316659877","https://openalex.org/W2006088653","https://openalex.org/W3035389378","https://openalex.org/W2607647996","https://openalex.org/W2768332800","https://openalex.org/W2357909631","https://openalex.org/W2363629235","https://openalex.org/W1557783852","https://openalex.org/W2348427614","https://openalex.org/W2356937512"],"abstract_inverted_index":{"This":[0],"work":[1],"introduces":[2],"homomorphic":[3,130],"secret":[4],"sharing":[5],"(HSS)":[6],"with":[7,71,108,110],"succinct":[8,37,121],"share":[9,31],"size.":[10],"In":[11,36],"HSS,":[12,38,122],"private":[13],"inputs":[14,43],"are":[15],"shared":[16,82],"between":[17],"parties,":[18],"who":[19],"can":[20,44,61],"then":[21,62,116],"homomorphically":[22],"evaluate":[23,64],"a":[24,30,39,65,100,111],"function":[25,34,66],"on":[26,68,93],"their":[27],"shares,":[28,70],"obtaining":[29],"of":[32,41,56,120],"the":[33,42,54,69,72,80,95],"output.":[35],"portion":[40],"be":[45,77],"distributed":[46],"using":[47,128],"shares":[48],"whose":[49],"size":[50],"is":[51],"sublinear":[52],"in":[53,79,103],"number":[55],"such":[57],"inputs.":[58,83],"The":[59],"parties":[60],"locally":[63],"f":[67,75],"restriction":[73],"that":[74],"must":[76],"linear":[78],"succinctly":[81],"We":[84,115],"construct":[85],"succinct,":[86],"two-party":[87],"HSS":[88],"for":[89],"branching":[90],"programs,":[91],"based":[92],"either":[94],"decisional":[96],"composite":[97],"residuosity":[98],"assumption,":[99],"DDH-like":[101],"assumption":[102],"class":[104],"groups,":[105],"or":[106,132],"learning":[107],"errors":[109],"superpolynomial":[112],"modulus-to-noise":[113],"ratio.":[114],"give":[117],"several":[118],"applications":[119],"which":[123],"were":[124],"only":[125],"previously":[126],"known":[127],"fully":[129],"encryption,":[131],"stronger":[133],"tools:":[134]},"counts_by_year":[{"year":2025,"cited_by_count":13},{"year":2024,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}