{"id":"https://openalex.org/W2572758683","doi":"https://doi.org/10.1145/3055399.3055483","title":"Non-malleable codes and extractors for small-depth circuits, and affine functions","display_name":"Non-malleable codes and extractors for small-depth circuits, and affine functions","publication_year":2017,"publication_date":"2017-06-15","ids":{"openalex":"https://openalex.org/W2572758683","doi":"https://doi.org/10.1145/3055399.3055483","mag":"2572758683"},"language":"en","primary_location":{"id":"doi:10.1145/3055399.3055483","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3055399.3055483","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3055483&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=3055483&type=pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045073799","display_name":"Eshan Chattopadhyay","orcid":"https://orcid.org/0000-0001-9140-3160"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eshan Chattopadhyay","raw_affiliation_strings":["IAS, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IAS, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100353875","display_name":"Xin Li","orcid":"https://orcid.org/0000-0002-4691-4508"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xin Li","raw_affiliation_strings":["Johns Hopkins University, USA","[Johns Hopkins University,USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Johns Hopkins University, USA","institution_ids":["https://openalex.org/I145311948"]},{"raw_affiliation_string":"[Johns Hopkins University,USA]","institution_ids":["https://openalex.org/I145311948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0029772,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"23","issue":null,"first_page":"1171","last_page":"1184"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9983000159263611,"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.9983000159263611,"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/T11130","display_name":"Coding theory and cryptography","score":0.9979000091552734,"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/T13182","display_name":"Quantum-Dot Cellular Automata","score":0.9940000176429749,"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/code-word","display_name":"Code word","score":0.6572125554084778},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.5290523767471313},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.5105298757553101},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.49610695242881775},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4884766638278961},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4450487494468689},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4240679144859314},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3577868640422821},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.32658618688583374},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.32574695348739624},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3102160692214966},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.13534173369407654}],"concepts":[{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6572125554084778},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.5290523767471313},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.5105298757553101},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.49610695242881775},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4884766638278961},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4450487494468689},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4240679144859314},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3577868640422821},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.32658618688583374},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.32574695348739624},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3102160692214966},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.13534173369407654},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3055399.3055483","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3055399.3055483","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3055483&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"mag:2572758683","is_oa":false,"landing_page_url":"http://eccc.hpi-web.de/report/2016/180","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":{"id":"doi:10.1145/3055399.3055483","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3055399.3055483","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3055483&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G353287232","display_name":null,"funder_award_id":"1526952, 1412958","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4694693377","display_name":"AF: Small: Fundamental Connections in Randomness and Complexity","funder_award_id":"1526952","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G540782784","display_name":null,"funder_award_id":"CCF\u20101412958","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6741262221","display_name":null,"funder_award_id":"CCF-1526952","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8339770419","display_name":"AF: Small: Randomness in Computation - Old Problems and New Directions","funder_award_id":"1617713","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8794390409","display_name":null,"funder_award_id":"CCF-1617713","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G882115978","display_name":"AF: Large: Theory of Computation - Pushing the State-of-the-Art","funder_award_id":"1412958","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310620","display_name":"University of Texas at Austin","ror":"https://ror.org/00hj54h04"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2572758683.pdf","grobid_xml":"https://content.openalex.org/works/W2572758683.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W78558797","https://openalex.org/W789266596","https://openalex.org/W1490273987","https://openalex.org/W1967175855","https://openalex.org/W1981712957","https://openalex.org/W2017290750","https://openalex.org/W2023554282","https://openalex.org/W2032056095","https://openalex.org/W2071829521","https://openalex.org/W2090418561","https://openalex.org/W2100218277","https://openalex.org/W2122270497","https://openalex.org/W2128726521","https://openalex.org/W2140805804","https://openalex.org/W2143460704","https://openalex.org/W2151303208","https://openalex.org/W2156238967","https://openalex.org/W2162685042","https://openalex.org/W2217040139","https://openalex.org/W2279000475","https://openalex.org/W2414609184","https://openalex.org/W2417650483","https://openalex.org/W2433413249","https://openalex.org/W2608772385","https://openalex.org/W3138266838"],"related_works":["https://openalex.org/W2626798791","https://openalex.org/W2952685809","https://openalex.org/W3013329636","https://openalex.org/W2795091282","https://openalex.org/W2077140897","https://openalex.org/W2952808201","https://openalex.org/W2532893978","https://openalex.org/W2296294380","https://openalex.org/W1536816541","https://openalex.org/W2790155673","https://openalex.org/W578938647","https://openalex.org/W1603472107","https://openalex.org/W2159460804","https://openalex.org/W2615288349","https://openalex.org/W1596576235","https://openalex.org/W3184795902","https://openalex.org/W2037117602","https://openalex.org/W2155972716","https://openalex.org/W2912895784","https://openalex.org/W3195630545"],"abstract_inverted_index":{"Non-malleable":[0],"codes":[1,91,113],"were":[2],"introduced":[3],"by":[4],"Dziembowski,":[5],"Pietrzak":[6],"and":[7,40,65,99,106],"Wichs":[8],"as":[9],"an":[10],"elegant":[11,38],"relaxation":[12],"of":[13,26,59,75,84,102,129],"error":[14],"correcting":[15],"codes,":[16],"where":[17,56],"the":[18,53,60,82,100],"motivation":[19],"is":[20],"to":[21,36,70],"handle":[22],"more":[23],"general":[24],"forms":[25],"tampering":[27,51,76],"while":[28],"still":[29],"providing":[30],"meaningful":[31],"guarantees.":[32],"This":[33],"has":[34],"led":[35],"many":[37,71],"constructions":[39],"applications":[41],"in":[42,52,118],"cryptography.":[43],"However,":[44,117],"most":[45],"works":[46,101],"so":[47],"far":[48],"only":[49,79,124],"studied":[50,89,111],"split-state":[54],"model":[55],"different":[57],"parts":[58],"codeword":[61],"are":[62,81],"tampered":[63,122],"independently,":[64],"thus":[66],"do":[67],"not":[68],"apply":[69],"other":[72],"natural":[73],"classes":[74],"functions.":[77,116],"The":[78],"exceptions":[80],"work":[83],"Agrawal":[85],"et":[86,104,108],"al.":[87,105],"which":[88,110],"non-malleable":[90,112],"against":[92,114],"bit":[93,123],"permutation":[94],"composed":[95],"with":[96],"bit-wise":[97],"tampering,":[98],"Faust":[103],"Ball":[107],"al.,":[109],"local":[115],"both":[119],"cases":[120],"each":[121],"depends":[125],"on":[126],"a":[127],"subset":[128],"input":[130],"bits.":[131]},"counts_by_year":[],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}