{"id":"https://openalex.org/W4416866464","doi":"https://doi.org/10.1007/978-3-032-12287-2_10","title":"Slightly Sublinear Trapdoor Hash Functions and\u00a0PIR from\u00a0Low-Noise LPN","display_name":"Slightly Sublinear Trapdoor Hash Functions and\u00a0PIR from\u00a0Low-Noise LPN","publication_year":2025,"publication_date":"2025-12-01","ids":{"openalex":"https://openalex.org/W4416866464","doi":"https://doi.org/10.1007/978-3-032-12287-2_10"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-032-12287-2_10","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-12287-2_10","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-12287-2_10.pdf","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":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-12287-2_10.pdf","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/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Damiano Abram","raw_affiliation_strings":["The University of Edinburgh, Edinburgh, UK"],"raw_orcid":"https://orcid.org/0009-0004-3916-7550","affiliations":[{"raw_affiliation_string":"The University of Edinburgh, Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007500399","display_name":"Giulio Malavolta","orcid":"https://orcid.org/0009-0009-9737-0094"},"institutions":[{"id":"https://openalex.org/I71209653","display_name":"Bocconi University","ror":"https://ror.org/05crjpb27","country_code":"IT","type":"education","lineage":["https://openalex.org/I71209653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giulio Malavolta","raw_affiliation_strings":["Bocconi University, Milan, Italy"],"raw_orcid":"https://orcid.org/0009-0009-9737-0094","affiliations":[{"raw_affiliation_string":"Bocconi University, Milan, Italy","institution_ids":["https://openalex.org/I71209653"]}]},{"author_position":"last","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":true,"raw_author_name":"Lawrence Roy","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"raw_orcid":"https://orcid.org/0009-0003-8436-0029","affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5050543367"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34829089,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"280","last_page":"300"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9502000212669373,"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.9502000212669373,"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.02070000022649765,"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/T10388","display_name":"Advanced Steganography and Watermarking Techniques","score":0.004800000227987766,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/hash-function","display_name":"Hash function","score":0.8342999815940857},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.5640000104904175},{"id":"https://openalex.org/keywords/cryptographic-hash-function","display_name":"Cryptographic hash function","score":0.5436999797821045},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.4894999861717224},{"id":"https://openalex.org/keywords/double-hashing","display_name":"Double hashing","score":0.47920000553131104},{"id":"https://openalex.org/keywords/security-of-cryptographic-hash-functions","display_name":"Security of cryptographic hash functions","score":0.46869999170303345},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4440000057220459},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.4343999922275543},{"id":"https://openalex.org/keywords/hash-chain","display_name":"Hash chain","score":0.43140000104904175}],"concepts":[{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.8342999815940857},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7724000215530396},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.5640000104904175},{"id":"https://openalex.org/C7608002","wikidata":"https://www.wikidata.org/wiki/Q477202","display_name":"Cryptographic hash function","level":3,"score":0.5436999797821045},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5404999852180481},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.4894999861717224},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.47920000553131104},{"id":"https://openalex.org/C165511393","wikidata":"https://www.wikidata.org/wiki/Q7252276","display_name":"Security of cryptographic hash functions","level":5,"score":0.46869999170303345},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45410001277923584},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4440000057220459},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.4343999922275543},{"id":"https://openalex.org/C135783594","wikidata":"https://www.wikidata.org/wiki/Q5678864","display_name":"Hash chain","level":3,"score":0.43140000104904175},{"id":"https://openalex.org/C122907437","wikidata":"https://www.wikidata.org/wiki/Q5318999","display_name":"Dynamic perfect hashing","level":5,"score":0.42980000376701355},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.41850000619888306},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.4169999957084656},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3953000009059906},{"id":"https://openalex.org/C15927051","wikidata":"https://www.wikidata.org/wiki/Q246593","display_name":"Cryptographic primitive","level":4,"score":0.3935999870300293},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3765000104904175},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.3506999909877777},{"id":"https://openalex.org/C190157925","wikidata":"https://www.wikidata.org/wiki/Q1968605","display_name":"SHA-2","level":4,"score":0.3504999876022339},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.3310999870300293},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3278999924659729},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.3181999921798706},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30309998989105225},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.3003000020980835},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.2775999903678894},{"id":"https://openalex.org/C116058348","wikidata":"https://www.wikidata.org/wiki/Q846912","display_name":"Universal hashing","level":5,"score":0.2712000012397766},{"id":"https://openalex.org/C141492731","wikidata":"https://www.wikidata.org/wiki/Q1052621","display_name":"Message authentication code","level":3,"score":0.2596000134944916}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-032-12287-2_10","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-12287-2_10","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-12287-2_10.pdf","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/00193b2e-7276-48b9-b3a0-c2b1a8d81913","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/00193b2e-7276-48b9-b3a0-c2b1a8d81913","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Abram, D, Malavolta, G & Roy, L 2026, Slightly Sublinear Trapdoor Hash Functions and\u00a0PIR from\u00a0Low-Noise LPN. in B Applebaum & H Lin (eds), Theory of Cryptography - 23rd International Conference, TCC 2025, Proceedings. Springer Science+Business Media, Lecture Notes in Computer Science, vol. 16268 LNCS, pp. 280-300, 23rd International Conference on Theory of Cryptography, TCC 2025, Aarhus, Denmark, 01/12/2025. https://doi.org/10.1007/978-3-032-12287-2_10","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/cea3ab63-506a-493d-941b-d4fc8c5ba550","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/cea3ab63-506a-493d-941b-d4fc8c5ba550","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"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, Malavolta, G & Roy, L 2025, Slightly sublinear trapdoor hash functions and PIR from low-noise LPN. in B Applebaum & H Lin (eds), Proceedings of the 23rd International Conference on Theory of Cryptography, Part 1. Lecture Notes in Computer Science, vol. 16268, Cham, Switzerland, pp. 280-300, The 23rd Theory of Cryptography Conference, Aarhus, Denmark, 1/12/25. https://doi.org/10.1007/978-3-032-12287-2_10","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.1007/978-3-032-12287-2_10","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-12287-2_10","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-12287-2_10.pdf","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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G18682879","display_name":"EXC 2092: CyberSicherheit im Zeitalter gro\u00dfskaliger Angreifer (CASA)","funder_award_id":"390781972","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4416866464.pdf","grobid_xml":"https://content.openalex.org/works/W4416866464.grobid-xml"},"referenced_works_count":42,"referenced_works":["https://openalex.org/W31442624","https://openalex.org/W72398006","https://openalex.org/W1562285034","https://openalex.org/W1565337244","https://openalex.org/W1589034595","https://openalex.org/W1856342626","https://openalex.org/W1964723977","https://openalex.org/W1972913305","https://openalex.org/W2026103826","https://openalex.org/W2065151783","https://openalex.org/W2125903279","https://openalex.org/W2130389396","https://openalex.org/W2152688060","https://openalex.org/W2154654620","https://openalex.org/W2171001107","https://openalex.org/W2485198172","https://openalex.org/W2750848363","https://openalex.org/W2792153250","https://openalex.org/W2798359482","https://openalex.org/W2890999648","https://openalex.org/W2950017470","https://openalex.org/W2965686579","https://openalex.org/W2989630101","https://openalex.org/W2989843281","https://openalex.org/W2991416436","https://openalex.org/W3013660109","https://openalex.org/W3095197392","https://openalex.org/W3164947441","https://openalex.org/W3166503321","https://openalex.org/W4251261743","https://openalex.org/W4285126658","https://openalex.org/W4311322189","https://openalex.org/W4312442909","https://openalex.org/W4365807333","https://openalex.org/W4385654331","https://openalex.org/W4385654459","https://openalex.org/W4385654635","https://openalex.org/W4395959403","https://openalex.org/W4395960800","https://openalex.org/W4401616830","https://openalex.org/W4409851657","https://openalex.org/W4411319990"],"related_works":[],"abstract_inverted_index":{"Trapdoor":[0],"hash":[1,6,22],"functions":[2],"(TDHs)":[3],"are":[4,37],"compressing":[5],"functions,":[7],"with":[8,26,68,108,131],"an":[9,14,101],"additional":[10],"trapdoor":[11],"functionality:":[12],"Given":[13],"encoding":[15,30],"key":[16],"for":[17,46,79,119],"a":[18,21,27,38,42,120],"function":[19],"f,":[20],"on":[23],"x":[24],"together":[25],"(small)":[28],"input":[29],"allow":[31],"one":[32],"to":[33],"recover":[34],"f(x).":[35],"TDHs":[36],"versatile":[39],"tool":[40],"and":[41],"useful":[43],"building":[44],"block":[45],"more":[47],"complex":[48],"cryptographic":[49],"protocols.":[50],"In":[51],"this":[52],"work,":[53],"we":[54,103],"propose":[55],"the":[56,61,65,85,127],"first":[57,128],"TDH":[58],"construction":[59,90],"assuming":[60],"(quasi-polynomial)":[62],"hardness":[63],"of":[64,122],"LPN":[66],"problem":[67],"noise":[69],"rate":[70],"$$\\varepsilon":[71],"=":[72],"O(\\log":[73],"^{1+\\beta":[74],"}":[75,95,116],"n":[76],"/":[77,112],"n)$$":[78],"$$\\beta":[80],">0$$":[81],",":[82,118],"i.e.,":[83],"in":[84],"so-called":[86],"low-noise":[87],"regime.":[88],"The":[89],"achieves":[91],"$$2^{\\varTheta":[92],"(\\log":[93,114],"^{1-\\beta":[94,115],"\\lambda":[96],")}$$":[97],"compression":[98],"factor.":[99],"As":[100],"application,":[102],"obtain":[104],"private-information":[105],"retrieval":[106],"(PIR)":[107],"communication":[109,133],"complexity":[110,134],"$$L":[111],"2^{\\varTheta":[113],"L)}$$":[117],"database":[121],"size":[123],"L.":[124],"This":[125],"is":[126],"PIR":[129],"scheme":[130],"non-trivial":[132],"(asymptotically":[135],"smaller":[136],"than":[137],"L)":[138],"from":[139],"any":[140],"code-based":[141],"assumption.":[142]},"counts_by_year":[],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-12-01T00:00:00"}