{"id":"https://openalex.org/W4416549420","doi":"https://doi.org/10.1145/3719027.3765181","title":"Fast Amortized Bootstrapping with Small Keys and Polynomial Noise Overhead","display_name":"Fast Amortized Bootstrapping with Small Keys and Polynomial Noise Overhead","publication_year":2025,"publication_date":"2025-11-19","ids":{"openalex":"https://openalex.org/W4416549420","doi":"https://doi.org/10.1145/3719027.3765181"},"language":null,"primary_location":{"id":"doi:10.1145/3719027.3765181","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3719027.3765181","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 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/A5069499774","display_name":"Antonio Guimar\u00e3es","orcid":"https://orcid.org/0000-0001-5110-6639"},"institutions":[{"id":"https://openalex.org/I4210162154","display_name":"IMDEA Software Institute","ror":"https://ror.org/04xvfkh51","country_code":"ES","type":"facility","lineage":["https://openalex.org/I105140100","https://openalex.org/I4210162154"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Antonio Guimar\u00e3es","raw_affiliation_strings":["IMDEA Software Institute, Madrid, Spain"],"raw_orcid":"https://orcid.org/0000-0001-5110-6639","affiliations":[{"raw_affiliation_string":"IMDEA Software Institute, Madrid, Spain","institution_ids":["https://openalex.org/I4210162154"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062966441","display_name":"Hilder V. L. Pereira","orcid":"https://orcid.org/0000-0003-1303-3760"},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"education","lineage":["https://openalex.org/I181391015"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Hilder V. L. Pereira","raw_affiliation_strings":["Institute of Computing, University of Campinas (UNICAMP), Campinas, Brazil"],"raw_orcid":"https://orcid.org/0000-0003-1303-3760","affiliations":[{"raw_affiliation_string":"Institute of Computing, University of Campinas (UNICAMP), Campinas, Brazil","institution_ids":["https://openalex.org/I181391015"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7588,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.89637334,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2967","last_page":"2981"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9775999784469604,"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.9775999784469604,"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.006099999882280827,"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/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.002899999963119626,"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/homomorphic-encryption","display_name":"Homomorphic encryption","score":0.8493000268936157},{"id":"https://openalex.org/keywords/bootstrapping","display_name":"Bootstrapping (finance)","score":0.7174999713897705},{"id":"https://openalex.org/keywords/learning-with-errors","display_name":"Learning with errors","score":0.5884000062942505},{"id":"https://openalex.org/keywords/lattice","display_name":"Lattice (music)","score":0.47189998626708984},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4499000012874603},{"id":"https://openalex.org/keywords/security-parameter","display_name":"Security parameter","score":0.38769999146461487},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.38260000944137573},{"id":"https://openalex.org/keywords/subset-sum-problem","display_name":"Subset sum problem","score":0.3776000142097473},{"id":"https://openalex.org/keywords/encryption","display_name":"Encryption","score":0.3610999882221222}],"concepts":[{"id":"https://openalex.org/C158338273","wikidata":"https://www.wikidata.org/wiki/Q2154943","display_name":"Homomorphic encryption","level":3,"score":0.8493000268936157},{"id":"https://openalex.org/C207609745","wikidata":"https://www.wikidata.org/wiki/Q4944086","display_name":"Bootstrapping (finance)","level":2,"score":0.7174999713897705},{"id":"https://openalex.org/C2779014939","wikidata":"https://www.wikidata.org/wiki/Q6510239","display_name":"Learning with errors","level":3,"score":0.5884000062942505},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47929999232292175},{"id":"https://openalex.org/C2781204021","wikidata":"https://www.wikidata.org/wiki/Q6497091","display_name":"Lattice (music)","level":2,"score":0.47189998626708984},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4499000012874603},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44130000472068787},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4388999938964844},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41429999470710754},{"id":"https://openalex.org/C2776711565","wikidata":"https://www.wikidata.org/wiki/Q7445058","display_name":"Security parameter","level":3,"score":0.38769999146461487},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.38260000944137573},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.3776000142097473},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.3610999882221222},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.35510000586509705},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.3546999990940094},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3529999852180481},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3416999876499176},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.33329999446868896},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.3197999894618988},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3012000024318695},{"id":"https://openalex.org/C151635116","wikidata":"https://www.wikidata.org/wiki/Q193878","display_name":"Chinese remainder theorem","level":2,"score":0.28600001335144043},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.27900001406669617},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.27900001406669617},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.27309998869895935},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26899999380111694},{"id":"https://openalex.org/C7720571","wikidata":"https://www.wikidata.org/wiki/Q1136880","display_name":"Power of two","level":2,"score":0.260699987411499},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.2524999976158142}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3719027.3765181","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3719027.3765181","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 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":37,"referenced_works":["https://openalex.org/W56544557","https://openalex.org/W913176383","https://openalex.org/W1966731635","https://openalex.org/W2061949491","https://openalex.org/W2089477764","https://openalex.org/W2098290658","https://openalex.org/W2176745559","https://openalex.org/W2177209050","https://openalex.org/W2400700555","https://openalex.org/W2477092523","https://openalex.org/W2554750353","https://openalex.org/W2589601466","https://openalex.org/W2592509728","https://openalex.org/W2603065436","https://openalex.org/W2768174108","https://openalex.org/W2768505000","https://openalex.org/W2794737742","https://openalex.org/W2885405362","https://openalex.org/W2947287050","https://openalex.org/W2950842792","https://openalex.org/W2954442424","https://openalex.org/W3003331030","https://openalex.org/W3134663857","https://openalex.org/W3176410512","https://openalex.org/W4205873558","https://openalex.org/W4285276028","https://openalex.org/W4320154905","https://openalex.org/W4365806556","https://openalex.org/W4365806600","https://openalex.org/W4365806969","https://openalex.org/W4389868578","https://openalex.org/W4389868694","https://openalex.org/W4394788406","https://openalex.org/W4400953596","https://openalex.org/W4405181463","https://openalex.org/W4405183111","https://openalex.org/W4405200462"],"related_works":[],"abstract_inverted_index":{"Most":[0],"homomorphic":[1],"encryption":[2],"(FHE)":[3],"schemes":[4,50,68],"exploit":[5],"a":[6,82,99],"technique":[7],"called":[8],"single-instruction":[9],"multiple-data":[10],"(SIMD)":[11],"to":[12,119],"process":[13,105],"several":[14],"messages":[15,107],"in":[16,23],"parallel.":[17],"However,":[18],"they":[19],"base":[20],"their":[21],"security":[22,65,85],"somehow":[24],"strong":[25],"assumptions,":[26],"such":[27],"as":[28],"the":[29,40,44,61,64,88],"hardness":[30],"of":[31,43,66,90],"approximate":[32],"lattice":[33,72,124],"problems":[34,73,125],"with":[35,74,126],"superpolynomial":[36],"approximation":[37,77,128],"factor.":[38,129],"On":[39,60],"other":[41],"extreme":[42],"spectrum,":[45],"there":[46],"are":[47],"lightweight":[48],"FHE":[49,121],"that":[51,103],"have":[52],"much":[53,83],"faster":[54],"bootstrapping":[55,102],"but":[56],"no":[57],"SIMD":[58],"capabilities.":[59],"positive":[62],"side,":[63],"these":[67],"is":[69,81],"based":[70,122],"on":[71,123],"(low-degree)":[75],"polynomial":[76,127],"factor":[78],"only,":[79],"which":[80],"weaker":[84],"assumption.":[86],"Aiming":[87],"best":[89],"those":[91],"two":[92],"options,":[93],"Micciancio":[94],"and":[95,116],"Sorrell":[96],"(ICALP'18)":[97],"proposed":[98],"new":[100],"amortized":[101],"can":[104],"many":[106],"at":[108],"once,":[109],"yielding":[110],"sublinear":[111],"time":[112],"complexity":[113],"per":[114],"message,":[115],"allowing":[117],"one":[118],"construct":[120]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-23T00:00:00"}