{"id":"https://openalex.org/W1583291366","doi":null,"title":"Learning noisy characters, multiplication codes, and cryptographic hardcore predicates","display_name":"Learning noisy characters, multiplication codes, and cryptographic hardcore predicates","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1583291366","mag":"1583291366"},"language":"en","primary_location":{"id":"mag:1583291366","doi":null,"is_oa":false,"landing_page_url":"http://people.csail.mit.edu/akavia/AkaviaPhDThesis.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":[],"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/A5110776230","display_name":"Shafi Goldwasser","orcid":"https://orcid.org/0000-0003-4728-1535","observed_orcids":["https://orcid.org/0000-0003-4728-1535"]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shafi Goldwasser","raw_affiliation_strings":["Massachusetts Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035202691","display_name":"Adi Akavia","orcid":"https://orcid.org/0000-0003-0853-3576","observed_orcids":["https://orcid.org/0000-0003-0853-3576"]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Adi Akavia","raw_affiliation_strings":["Massachusetts Institute of Technology"],"raw_orcid":"https://orcid.org/0000-0003-0853-3576","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.8496000170707703,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.8496000170707703,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.13369999825954437,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.008200000040233135,"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/one-way-functions","display_name":"one-way functions","score":0.996999979019165},{"id":"https://openalex.org/keywords/error-correcting-codes","display_name":"error-correcting codes","score":0.7860000133514404},{"id":"https://openalex.org/keywords/list-decoding","display_name":"list decoding","score":0.878000020980835},{"id":"https://openalex.org/keywords/discrete-logarithm-problem","display_name":"discrete logarithm problem","score":0.9750000238418579},{"id":"https://openalex.org/keywords/sparse-fourier-transform","display_name":"sparse Fourier transform","score":0.8389999866485596},{"id":"https://openalex.org/keywords/sublinear-algorithms","display_name":"sublinear-time algorithms","score":0.9509999752044678},{"id":"https://openalex.org/keywords/adversarial-perturbations","display_name":"adversarial perturbations","score":0.8330000042915344}],"concepts":[{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.652271032333374},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5877716541290283},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.49618157744407654},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.48760929703712463},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48468974232673645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4795546233654022},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4537047743797302},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.43045830726623535},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38738951086997986},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3787611126899719},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3122899532318115},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.2980729937553406}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:1583291366","doi":null,"is_oa":false,"landing_page_url":"http://people.csail.mit.edu/akavia/AkaviaPhDThesis.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":84,"referenced_works":["https://openalex.org/W83351988","https://openalex.org/W218251222","https://openalex.org/W1490590996","https://openalex.org/W1492537195","https://openalex.org/W1499049447","https://openalex.org/W1505096007","https://openalex.org/W1529679142","https://openalex.org/W1532961226","https://openalex.org/W1551827995","https://openalex.org/W1564025554","https://openalex.org/W1564773445","https://openalex.org/W1575519488","https://openalex.org/W1580599221","https://openalex.org/W1589182929","https://openalex.org/W1593724039","https://openalex.org/W1594962164","https://openalex.org/W1595415026","https://openalex.org/W1608415167","https://openalex.org/W1635427980","https://openalex.org/W1901622511","https://openalex.org/W1954490473","https://openalex.org/W1967703498","https://openalex.org/W1977886630","https://openalex.org/W1979598217","https://openalex.org/W1980073965","https://openalex.org/W1983593474","https://openalex.org/W1994091697","https://openalex.org/W1994790157","https://openalex.org/W1996360405","https://openalex.org/W2004229705","https://openalex.org/W2006506233","https://openalex.org/W2012365979","https://openalex.org/W2015281423","https://openalex.org/W2018738738","https://openalex.org/W2027528470","https://openalex.org/W2028146521","https://openalex.org/W2033361557","https://openalex.org/W2040890430","https://openalex.org/W2041404167","https://openalex.org/W2042194938","https://openalex.org/W2053086236","https://openalex.org/W2058330889","https://openalex.org/W2061106457","https://openalex.org/W2061949491","https://openalex.org/W2065151783","https://openalex.org/W2068096733","https://openalex.org/W2073346043","https://openalex.org/W2085759780","https://openalex.org/W2087207261","https://openalex.org/W2087895821","https://openalex.org/W2089272132","https://openalex.org/W2095546965","https://openalex.org/W2095693260","https://openalex.org/W2099107826","https://openalex.org/W2100661986","https://openalex.org/W2103012681","https://openalex.org/W2106215079","https://openalex.org/W2106435708","https://openalex.org/W2107764994","https://openalex.org/W2108104892","https://openalex.org/W2116231125","https://openalex.org/W2119243017","https://openalex.org/W2121417875","https://openalex.org/W2122270497","https://openalex.org/W2128061541","https://openalex.org/W2128531813","https://openalex.org/W2128765501","https://openalex.org/W2133321180","https://openalex.org/W2137118456","https://openalex.org/W2138036903","https://openalex.org/W2138779125","https://openalex.org/W2147731984","https://openalex.org/W2148575324","https://openalex.org/W2152263739","https://openalex.org/W2154021956","https://openalex.org/W2156186849","https://openalex.org/W2164284862","https://openalex.org/W2165100639","https://openalex.org/W2172705463","https://openalex.org/W2293231900","https://openalex.org/W2296174482","https://openalex.org/W2296616510","https://openalex.org/W2914377170","https://openalex.org/W2986959318"],"related_works":["https://openalex.org/W2152263739","https://openalex.org/W7139762166","https://openalex.org/W2967990036","https://openalex.org/W4240929017","https://openalex.org/W7096081157","https://openalex.org/W376040148","https://openalex.org/W4395688856","https://openalex.org/W3028755775","https://openalex.org/W180045563","https://openalex.org/W2918960014"],"abstract_inverted_index":{"We":[0,118,245],"present":[1,224,247,280],"results":[2,60,287],"in":[3,61,174,195,203,205,238,241,254,264,270,284,288,308,312],"cryptography,":[4,11],"coding":[5,101,291],"theory":[6],"and":[7,29,38,53,75,91,130,140,152,163,184,269,290],"sublinear":[8,221,277],"algorithms.":[9],"\r\nIn":[10,100,220],"we":[12,95,103,113,146,169,188,223,279,298,314],"introduce":[13,104],"a":[14,20,26,33,84,105,212,333],"unifying":[15],"framework":[16,68],"for":[17,25,44,78,97,122,144,167,186,228,250,305,330],"proving":[18],"that":[19,112],"Boolean":[21],"predicate":[22],"is":[23,262],"hardcore":[24,42,80],"one-way":[27,47],"function":[28,48],"apply":[30],"it":[31],"to":[32],"broad":[34],"family":[35],"of":[36,73,87,108,137,160,181,234,273],"functions":[37],"predicates,":[39,81],"showing":[40,79,125],"new":[41,85,92],"predicates":[43],"well":[45,56],"known":[46],"candidates":[49],"such":[50],"as":[51,55,57,208,215,303],"RSA":[52],"discrete-log":[54],"reproving":[58],"old":[59],"an":[62],"entirely":[63],"different":[64],"way.":[65],"Our":[66],"proof":[67],"extends":[69],"the":[70,225,230,242,255,259,265,271,317],"list-decoding":[71,93],"method":[72],"Goldreich":[74],"Levin":[76],"[40]":[77],"by":[82,257],"introducing":[83],"class":[86,107,272],"error":[88,109],"correcting":[89,110,155],"codes":[90,111,116,200],"algorithm":[94,173,194,227,322,329],"develop":[96,119],"these":[98],"codes.":[99],"theory,":[102],"novel":[106],"name:":[114],"Multiplication":[115],"(MPC).":[117],"decoding":[120,151,172,193],"algorithms":[121,249,278,302],"MPC":[123,136,159,180,199],"codes,":[124],"they":[126],"achieve":[127],"desirable":[128],"combinatorial":[129],"algorithmic":[131],"properties,":[132],"including:":[133],"(1)":[134],"binary":[135,158,179],"constant":[138,161,182],"distance":[139,162,185],"exponential":[141],"encoding":[142,165],"length":[143,166],"which":[145,168,187,258],"provide":[147,170,189],"efficient":[148,171],"local":[149,153],"list":[150],"self":[154],"algorithms;":[156],"(2)":[157],"polynomial":[164,191],"random":[175],"noise":[176,197],"models;":[177],"(3)":[178],"rate":[183],"(non":[190],"time)":[192],"adversarial":[196],"model.":[198],"are":[201,281],"unique":[202],"particular":[204],"achieving":[206,285],"properties":[207],"above":[209],"while":[210],"having":[211],"large":[213],"group":[214],"their":[216],"underlying":[217],"algebraic":[218],"structure.":[219],"algorithms,":[222],"SFT":[226,328],"finding":[229],"sparse":[231,334],"Fourier":[232],"approximation":[233,267,335],"complex":[235],"multi-dimensional":[236],"signals":[237],"time":[239],"logarithmic":[240],"signal":[243,261],"length.":[244],"also":[246],"additional":[248],"related":[251],"settings,":[252],"differing":[253],"model":[256],"input":[260],"given,":[263],"considered":[266],"measure,":[268],"addressed":[274],"signals.":[275],"The":[276],"central":[282],"components":[283],"our":[286,301,324],"cryptography":[289],"theory.":[292],"Reaching":[293],"beyond":[294],"theoretical":[295],"computer":[296],"science,":[297],"suggest":[299,315],"employing":[300],"tools":[304],"performance":[306],"enhancement":[307],"data":[309],"intensive":[310],"applications,":[311],"particular,":[313],"replacing":[316],"O(N":[318],"log":[319],"N)-time":[320,327],"FFT":[321],"with":[323],"Qd":[325],"(log":[326],"settings":[331],"where":[332],"suffices.":[336],"(Copies":[337],"available":[338],"exclusively":[339],"from":[340],"MIT":[341],"Libraries,":[342],"Rm.":[343],"14-0551,":[344],"Cambridge,":[345],"MA":[346],"02139-4307.":[347],"Ph.":[348],"617-253-5668;":[349],"Fax":[350],"617-253-1690.)":[351]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-09-26T08:19:03.415552","created_date":"2016-06-24T00:00:00"}