{"id":"https://openalex.org/W4403175079","doi":"https://doi.org/10.62056/a3qj5w7sf","title":"Unforgeability of Blind Schnorr in the Limited Concurrency Setting","display_name":"Unforgeability of Blind Schnorr in the Limited Concurrency Setting","publication_year":2024,"publication_date":"2024-10-07","ids":{"openalex":"https://openalex.org/W4403175079","doi":"https://doi.org/10.62056/a3qj5w7sf"},"language":"en","primary_location":{"id":"doi:10.62056/a3qj5w7sf","is_oa":true,"landing_page_url":"https://doi.org/10.62056/a3qj5w7sf","pdf_url":"https://cic.iacr.org/p/1/3/16/pdf","source":{"id":"https://openalex.org/S4394708374","display_name":"IACR Communications in Cryptology","issn_l":"3006-5496","issn":["3006-5496"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320989","host_organization_name":"International Association for Cryptologic Research","host_organization_lineage":["https://openalex.org/P4310320989"],"host_organization_lineage_names":["International Association for Cryptologic Research"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IACR Communications in Cryptology","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://cic.iacr.org/p/1/3/16/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5107804235","display_name":"Franklin Harding","orcid":"https://orcid.org/0009-0004-9811-1610"},"institutions":[{"id":"https://openalex.org/I175594653","display_name":"John Brown University","ror":"https://ror.org/02ct41q97","country_code":"US","type":"education","lineage":["https://openalex.org/I175594653"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Franklin Harding","raw_affiliation_strings":["Brown University"],"raw_orcid":"https://orcid.org/0009-0004-9811-1610","affiliations":[{"raw_affiliation_string":"Brown University","institution_ids":["https://openalex.org/I175594653"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063390216","display_name":"Jiayu Xu","orcid":"https://orcid.org/0000-0002-0881-9980"},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jiayu Xu","raw_affiliation_strings":["Oregon State University"],"raw_orcid":"https://orcid.org/0000-0002-0881-9980","affiliations":[{"raw_affiliation_string":"Oregon State University","institution_ids":["https://openalex.org/I131249849"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14337381,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9998999834060669,"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9998999834060669,"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/T10237","display_name":"Cryptography and Data Security","score":0.9994000196456909,"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.9905999898910522,"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/computer-science","display_name":"Computer science","score":0.6900972723960876},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.6893719434738159},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3420200049877167}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6900972723960876},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.6893719434738159},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3420200049877167}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.62056/a3qj5w7sf","is_oa":true,"landing_page_url":"https://doi.org/10.62056/a3qj5w7sf","pdf_url":"https://cic.iacr.org/p/1/3/16/pdf","source":{"id":"https://openalex.org/S4394708374","display_name":"IACR Communications in Cryptology","issn_l":"3006-5496","issn":["3006-5496"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320989","host_organization_name":"International Association for Cryptologic Research","host_organization_lineage":["https://openalex.org/P4310320989"],"host_organization_lineage_names":["International Association for Cryptologic Research"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IACR Communications in Cryptology","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.62056/a3qj5w7sf","is_oa":true,"landing_page_url":"https://doi.org/10.62056/a3qj5w7sf","pdf_url":"https://cic.iacr.org/p/1/3/16/pdf","source":{"id":"https://openalex.org/S4394708374","display_name":"IACR Communications in Cryptology","issn_l":"3006-5496","issn":["3006-5496"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320989","host_organization_name":"International Association for Cryptologic Research","host_organization_lineage":["https://openalex.org/P4310320989"],"host_organization_lineage_names":["International Association for Cryptologic Research"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IACR Communications in Cryptology","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6600000262260437,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4403175079.pdf"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1479744988","https://openalex.org/W1510550025","https://openalex.org/W1545286522","https://openalex.org/W1548701190","https://openalex.org/W1576411270","https://openalex.org/W1601001795","https://openalex.org/W2094557617","https://openalex.org/W2137848579","https://openalex.org/W2153193245","https://openalex.org/W2164988972","https://openalex.org/W2884510571","https://openalex.org/W3022524423","https://openalex.org/W3176137886","https://openalex.org/W4214547344","https://openalex.org/W4295895483","https://openalex.org/W4385654206","https://openalex.org/W4396712433","https://openalex.org/W4401602145","https://openalex.org/W4401602186"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052","https://openalex.org/W4402327032","https://openalex.org/W2382290278"],"abstract_inverted_index":{"Blind":[0],"signature":[1,10],"schemes":[2],"enable":[3],"a":[4,8,12,15,29,82,108],"user":[5],"to":[6,58,160],"obtain":[7],"digital":[9],"on":[11],"message":[13,20],"from":[14,172],"signer":[16],"without":[17],"revealing":[18],"the":[19,23,43,59,67,85,96,99,113,119,142],"itself.":[21],"Among":[22],"most":[24,133],"fundamental":[25],"examples":[26],"of":[27,46,70,98,115],"such":[28],"scheme":[30],"is":[31,56,79,151],"blind":[32,63,116,127,154],"Schnorr,":[33],"but":[34],"recent":[35],"results":[36],"show":[37,125],"that":[38,126,149,153],"it":[39,55,150],"does":[40,65],"not":[41],"satisfy":[42,66],"standard":[44],"notion":[45,69],"security":[47,114,167],"against":[48],"malicious":[49],"users,":[50],"One-More":[51],"Unforgeability":[52],"(OMUF),":[53],"as":[54,107],"vulnerable":[57],"ROS":[60],"attack.":[61],"However,":[62],"Schnorr":[64,117,128,155],"weaker":[68],"sequential":[71],"OMUF,":[72],"in":[73,84,118],"which":[74],"only":[75],"one":[76],"signing":[77,135,164],"session":[78],"open":[80,140],"at":[81,132],"time,":[83],"Algebraic":[86],"Group":[87],"Model":[88,93],"(AGM)":[89],"+":[90],"Random":[91],"Oracle":[92],"(ROM),":[94],"assuming":[95,144],"hardness":[97],"Discrete":[100],"Logarithm":[101],"(DL)":[102],"problem.":[103],"This":[104],"paper":[105],"serves":[106],"first":[109],"step":[110],"towards":[111],"characterizing":[112],"limited":[120],"concurrency":[121],"setting.":[122],"Specifically,":[123],"we":[124],"satisfies":[129,156],"OMUF":[130,157],"when":[131],"two":[134],"sessions":[136],"can":[137],"be":[138],"concurrently":[139],"(in":[141],"AGM+ROM,":[143],"DL).":[145],"Our":[146,166],"argument":[147],"suggests":[148],"plausible":[152],"for":[158],"up":[159],"polylogarithmically":[161],"many":[162],"concurrent":[163],"sessions.":[165],"proof":[168],"involves":[169],"interesting":[170],"techniques":[171],"linear":[173],"algebra":[174],"and":[175],"combinatorics.":[176]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}