{"id":"https://openalex.org/W7119503785","doi":"https://doi.org/10.62056/aesg893y6","title":"On the security of two blind signatures from code equivalence problems","display_name":"On the security of two blind signatures from code equivalence problems","publication_year":2026,"publication_date":"2026-01-08","ids":{"openalex":"https://openalex.org/W7119503785","doi":"https://doi.org/10.62056/aesg893y6"},"language":"en","primary_location":{"id":"doi:10.62056/aesg893y6","is_oa":true,"landing_page_url":"https://doi.org/10.62056/aesg893y6","pdf_url":"https://cic.iacr.org/p/2/4/27/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/2/4/27/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108298030","display_name":"Valerie Gilchrist","orcid":null},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Valerie Gilchrist","raw_affiliation_strings":["Universit\u00e9 Libre de Bruxelles"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Libre de Bruxelles","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104251093","display_name":"Laurane Marco","orcid":"https://orcid.org/0009-0009-5693-210X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Laurane Marco","raw_affiliation_strings":["EPFL"],"affiliations":[{"raw_affiliation_string":"EPFL","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046548183","display_name":"Christophe Petit","orcid":"https://orcid.org/0000-0003-3482-6743"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]},{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["BE","GB"],"is_corresponding":false,"raw_author_name":"Christophe Petit","raw_affiliation_strings":["University of Birmingham","Universit\u00e9 Libre de Bruxelles"],"affiliations":[{"raw_affiliation_string":"University of Birmingham","institution_ids":["https://openalex.org/I79619799"]},{"raw_affiliation_string":"Universit\u00e9 Libre de Bruxelles","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5092310326","display_name":"Gang Tang","orcid":"https://orcid.org/0000-0002-1135-466X"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Gang Tang","raw_affiliation_strings":["University of Birmingham"],"affiliations":[{"raw_affiliation_string":"University of Birmingham","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5108298030"],"corresponding_institution_ids":["https://openalex.org/I132053463"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06029933,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.5755000114440918,"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.5755000114440918,"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.12060000002384186,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.09690000116825104,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6881999969482422},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4724999964237213},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.44020000100135803},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.3476000130176544},{"id":"https://openalex.org/keywords/signature","display_name":"Signature (topology)","score":0.34119999408721924},{"id":"https://openalex.org/keywords/compact-space","display_name":"Compact space","score":0.33469998836517334},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.3077999949455261}],"concepts":[{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6881999969482422},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5637999773025513},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48339998722076416},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4724999964237213},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4618000090122223},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.44020000100135803},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4311000108718872},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3476000130176544},{"id":"https://openalex.org/C2779696439","wikidata":"https://www.wikidata.org/wiki/Q7512811","display_name":"Signature (topology)","level":2,"score":0.34119999408721924},{"id":"https://openalex.org/C18648836","wikidata":"https://www.wikidata.org/wiki/Q381892","display_name":"Compact space","level":2,"score":0.33469998836517334},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3077999949455261},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.2957000136375427},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C2988012377","wikidata":"https://www.wikidata.org/wiki/Q29966452","display_name":"Functional equivalence","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.2676999866962433},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.25870001316070557},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.2558000087738037},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.25110000371932983}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.62056/aesg893y6","is_oa":true,"landing_page_url":"https://doi.org/10.62056/aesg893y6","pdf_url":"https://cic.iacr.org/p/2/4/27/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"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/fb964a68-75f8-48d4-ba57-e1d8fd06fe18","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/fb964a68-75f8-48d4-ba57-e1d8fd06fe18","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Gilchrist, V, Marco, L, Petit, C & Tang, G 2026, 'On the security of two blind signatures from code equivalence problems', IACR Communications in Cryptology, vol. 2, no. 4. https://doi.org/10.62056/aesg893y6","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:infoscience.epfl.ch:20.500.14299/257796","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/257796","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"research article"}],"best_oa_location":{"id":"doi:10.62056/aesg893y6","is_oa":true,"landing_page_url":"https://doi.org/10.62056/aesg893y6","pdf_url":"https://cic.iacr.org/p/2/4/27/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":[],"awards":[{"id":"https://openalex.org/G1083587946","display_name":"Post-Quantum Cryptography: a Cryptanalysis Approach","funder_award_id":"EP/V011324/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320334840","display_name":"Fonds pour la Formation \u00e0 la Recherche dans l\u2019Industrie et dans l\u2019Agriculture","ror":"https://ror.org/03q83t159"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7119503785.pdf","grobid_xml":"https://content.openalex.org/works/W7119503785.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1976677460","https://openalex.org/W2062913926","https://openalex.org/W2086220066","https://openalex.org/W2107670183","https://openalex.org/W2116057145","https://openalex.org/W3038403579","https://openalex.org/W3204925326","https://openalex.org/W4214903266","https://openalex.org/W4236346465","https://openalex.org/W4292209587","https://openalex.org/W4308944961","https://openalex.org/W4384010644","https://openalex.org/W4387984351","https://openalex.org/W4389858283","https://openalex.org/W4390672596","https://openalex.org/W4396657260","https://openalex.org/W4401602328","https://openalex.org/W4405263002","https://openalex.org/W4405432222","https://openalex.org/W4408791156","https://openalex.org/W4409862724","https://openalex.org/W4410184171"],"related_works":[],"abstract_inverted_index":{"The":[0],"Linear":[1],"Code":[2,9],"Equivalence":[3,10],"(LCE)":[4],"problem":[5,12,94,109,132],"and":[6,42,49,123,150,171,173],"the":[7,52,59,64,93,100,127,140,161,176,184],"Matrix":[8],"(MCE)":[11],"are":[13,32,96,179],"two":[14],"examples":[15],"of":[16,54,66,71,111,139,163,194],"code-based":[17],"hard":[18],"problems":[19,73],"that":[20,175],"have":[21,74],"gained":[22],"attention":[23],"as":[24,39,97,99],"candidates":[25],"for":[26],"use":[27],"in":[28,51,63,81,135,160,199],"post-quantum":[29,55],"cryptography.":[30],"They":[31],"straightforward":[33],"to":[34,77,126,182],"implement,":[35],"can":[36],"be":[37],"viewed":[38],"group":[40,56],"actions,":[41],"offer":[43],"a":[44,118,136,191],"good":[45],"trade-off":[46],"between":[47],"compactness":[48],"performance":[50],"realm":[53],"actions.":[57],"With":[58],"community":[60],"gaining":[61],"confidence":[62],"security":[65],"these":[67,72],"problems,":[68],"new":[69],"variants":[70,95,110],"been":[75],"introduced":[76],"achieve":[78],"particular":[79],"functionalities":[80],"advanced":[82],"protocols":[83],"or":[84,113],"efficiency":[85],"improvements.":[86],"A":[87],"natural":[88],"question":[89],"is":[90],"then":[91],"whether":[92],"secure":[98],"original":[101,128],"ones.":[102],"In":[103],"this":[104],"work,":[105],"we":[106,153,189,197],"consider":[107,117,190],"three":[108],"LCE":[112,129],"MCE.":[114],"We":[115],"first":[116],"variant":[119],"based":[120],"on":[121],"LCE,":[122],"reduce":[124],"it":[125],"assumption.":[130],"This":[131],"was":[133],"presented":[134],"prior":[137],"version":[138,193],"blind":[141,165],"signature":[142,166],"scheme,":[143,167],"proposed":[144,159,178],"by":[145,168],"Duong,":[146],"Khuc,":[147],"Qiao,":[148],"Susilo":[149],"Zhang.":[151],"Second,":[152],"analyse":[154],"an":[155],"MCE":[156],"variant,":[157],"MIMCE,":[158],"context":[162],"another":[164],"Kutcha,":[169],"Legrow":[170],"Persichetti,":[172],"show":[174],"parameters":[177],"not":[180],"sufficient":[181],"reach":[183],"claimed":[185],"bit":[186],"security.":[187],"Finally,":[188],"multi-sample":[192],"MIMCE":[195],"which":[196],"solve":[198],"polynomial":[200],"time.":[201]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2026-01-09T00:00:00"}