{"id":"https://openalex.org/W2017964377","doi":"https://doi.org/10.1137/060671553","title":"New and Improved Constructions of Nonmalleable Cryptographic Protocols","display_name":"New and Improved Constructions of Nonmalleable Cryptographic Protocols","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2017964377","doi":"https://doi.org/10.1137/060671553","mag":"2017964377"},"language":"en","primary_location":{"id":"doi:10.1137/060671553","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060671553","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5081609749","display_name":"Rafael Pass","orcid":"https://orcid.org/0000-0001-7440-5690"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rafael Pass","raw_affiliation_strings":["rafael@cs.cornell.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"rafael@cs.cornell.edu#TAB#","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051186002","display_name":"Alon Rosen","orcid":"https://orcid.org/0000-0002-3021-7150"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alon Rosen","raw_affiliation_strings":["alon@eecs.harvard.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"alon@eecs.harvard.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5081609749"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":7.0246,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.96492217,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"38","issue":"2","first_page":"702","last_page":"752"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":1.0,"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":1.0,"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.9976999759674072,"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.9926999807357788,"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/hash-function","display_name":"Hash function","score":0.7117729783058167},{"id":"https://openalex.org/keywords/zero-knowledge-proof","display_name":"Zero-knowledge proof","score":0.7011326551437378},{"id":"https://openalex.org/keywords/commitment-scheme","display_name":"Commitment scheme","score":0.6850104331970215},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.6298702359199524},{"id":"https://openalex.org/keywords/cryptographic-protocol","display_name":"Cryptographic protocol","score":0.6102187037467957},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5670579075813293},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5650943517684937},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.5546398162841797},{"id":"https://openalex.org/keywords/cryptographic-primitive","display_name":"Cryptographic primitive","score":0.5335994362831116},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5251124501228333},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4638965129852295},{"id":"https://openalex.org/keywords/collision-resistance","display_name":"Collision resistance","score":0.4446151852607727},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4414900541305542},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.4333959221839905},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.384758859872818},{"id":"https://openalex.org/keywords/cryptographic-hash-function","display_name":"Cryptographic hash function","score":0.3345295786857605},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30736595392227173},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.22574415802955627},{"id":"https://openalex.org/keywords/perfect-hash-function","display_name":"Perfect hash function","score":0.2130100429058075},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12326756119728088}],"concepts":[{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.7117729783058167},{"id":"https://openalex.org/C176329583","wikidata":"https://www.wikidata.org/wiki/Q191943","display_name":"Zero-knowledge proof","level":3,"score":0.7011326551437378},{"id":"https://openalex.org/C91399829","wikidata":"https://www.wikidata.org/wiki/Q1115684","display_name":"Commitment scheme","level":3,"score":0.6850104331970215},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.6298702359199524},{"id":"https://openalex.org/C33884865","wikidata":"https://www.wikidata.org/wiki/Q1254335","display_name":"Cryptographic protocol","level":3,"score":0.6102187037467957},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5670579075813293},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5650943517684937},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.5546398162841797},{"id":"https://openalex.org/C15927051","wikidata":"https://www.wikidata.org/wiki/Q246593","display_name":"Cryptographic primitive","level":4,"score":0.5335994362831116},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5251124501228333},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4638965129852295},{"id":"https://openalex.org/C150909736","wikidata":"https://www.wikidata.org/wiki/Q1779448","display_name":"Collision resistance","level":5,"score":0.4446151852607727},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4414900541305542},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.4333959221839905},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.384758859872818},{"id":"https://openalex.org/C7608002","wikidata":"https://www.wikidata.org/wiki/Q477202","display_name":"Cryptographic hash function","level":3,"score":0.3345295786857605},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30736595392227173},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.22574415802955627},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.2130100429058075},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12326756119728088},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/060671553","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060671553","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.147.267","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.267","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cornell.edu/~rafael/papers/nmc-journal-final.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.90.2285","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.2285","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.harvard.edu/~alon/PAPERS/NMC/nmc-full.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","score":0.4399999976158142,"display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1970606468","https://openalex.org/W1970808997","https://openalex.org/W1995926987","https://openalex.org/W2011112377","https://openalex.org/W2012045293","https://openalex.org/W2015880590","https://openalex.org/W2038517014","https://openalex.org/W2049198367","https://openalex.org/W2080137555","https://openalex.org/W2151433956","https://openalex.org/W2911777915","https://openalex.org/W4210300416","https://openalex.org/W4250445866"],"related_works":["https://openalex.org/W1487949331","https://openalex.org/W1993458326","https://openalex.org/W2166496294","https://openalex.org/W2494893791","https://openalex.org/W2227130482","https://openalex.org/W2161264062","https://openalex.org/W2006897953","https://openalex.org/W1499074627","https://openalex.org/W3127928901","https://openalex.org/W1775939922"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,13,17,57,69,88,110,122,131],"new":[3,18],"constant-round":[4,19],"protocol":[5,11,20],"for":[6,21],"nonmalleable":[7,22,70,84,107,126],"zero-knowledge.":[8],"Using":[9],"this":[10],"as":[12,109],"subroutine,":[14],"we":[15,105],"obtain":[16],"commitments.":[23],"Our":[24,93],"constructions":[25,36],"rely":[26],"on":[27,39],"the":[28,40,65,82,97],"existence":[29,41],"of":[30,42,60,68,125],"(standard)":[31],"collision-resistant":[32],"hash":[33,46],"functions.":[34],"Previous":[35],"either":[37],"relied":[38],"trapdoor":[43],"permutations":[44],"and":[45,81,128],"functions":[47],"that":[48,73,86,104],"are":[49,64],"collision":[50],"resistant":[51],"against":[52],"subexponential-sized":[53],"circuits":[54],"or":[55],"required":[56],"superconstant":[58],"number":[59],"rounds.":[61],"Additional":[62],"results":[63,129],"first":[66,83],"construction":[67,124],"commitment":[71],"scheme":[72],"is":[74],"statistically":[75],"hiding":[76],"(with":[77],"respect":[78],"to":[79,121],"opening)":[80],"commitments":[85,127],"satisfy":[87],"strict":[89],"polynomial-time":[90],"simulation":[91],"requirement.":[92],"approach":[94],"differs":[95],"from":[96],"approaches":[98],"taken":[99],"in":[100,103,130],"previous":[101],"works":[102],"view":[106],"zero-knowledge":[108],"building":[111],"block":[112],"rather":[113],"than":[114],"an":[115],"end":[116],"goal.":[117],"This":[118],"gives":[119],"rise":[120],"modular":[123],"somewhat":[132],"simpler":[133],"analysis.":[134]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}