{"id":"https://openalex.org/W1969297838","doi":"https://doi.org/10.1109/itw.2011.6089577","title":"A new zero-knowledge code based identification scheme with reduced communication","display_name":"A new zero-knowledge code based identification scheme with reduced communication","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W1969297838","doi":"https://doi.org/10.1109/itw.2011.6089577","mag":"1969297838"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2011.6089577","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2011.6089577","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Information Theory Workshop","raw_type":"proceedings-article"},"type":"conference-paper","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/A5066826284","display_name":"Carlos Aguilar","orcid":"https://orcid.org/0000-0001-7966-5993"},"institutions":[{"id":"https://openalex.org/I65806277","display_name":"Universit\u00e9 de Limoges","ror":"https://ror.org/02cp04407","country_code":"FR","type":"education","lineage":["https://openalex.org/I65806277"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Carlos Aguilar","raw_affiliation_strings":["Universit\u00e9 de Limoges, France","Universit\u00e9 de Limoges (France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Limoges, France","institution_ids":["https://openalex.org/I65806277"]},{"raw_affiliation_string":"Universit\u00e9 de Limoges (France)","institution_ids":["https://openalex.org/I65806277"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019785896","display_name":"Philippe Gaborit","orcid":"https://orcid.org/0000-0002-4034-521X"},"institutions":[{"id":"https://openalex.org/I65806277","display_name":"Universit\u00e9 de Limoges","ror":"https://ror.org/02cp04407","country_code":"FR","type":"education","lineage":["https://openalex.org/I65806277"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Philippe Gaborit","raw_affiliation_strings":["Universit\u00e9 de Limoges, France","Universit\u00e9 de Limoges (France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Limoges, France","institution_ids":["https://openalex.org/I65806277"]},{"raw_affiliation_string":"Universit\u00e9 de Limoges (France)","institution_ids":["https://openalex.org/I65806277"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019937970","display_name":"Julien Schrek","orcid":null},"institutions":[{"id":"https://openalex.org/I65806277","display_name":"Universit\u00e9 de Limoges","ror":"https://ror.org/02cp04407","country_code":"FR","type":"education","lineage":["https://openalex.org/I65806277"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Julien Schrek","raw_affiliation_strings":["Universit\u00e9 de Limoges, France","Universit\u00e9 de Limoges (France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Limoges, France","institution_ids":["https://openalex.org/I65806277"]},{"raw_affiliation_string":"Universit\u00e9 de Limoges (France)","institution_ids":["https://openalex.org/I65806277"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I65806277"],"apc_list":null,"apc_paid":null,"fwci":13.9176,"has_fulltext":false,"cited_by_count":71,"citation_normalized_percentile":{"value":0.98909972,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"648","last_page":"652"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9988999962806702,"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/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"}}],"keywords":[{"id":"https://openalex.org/keywords/zero-knowledge-proof","display_name":"Zero-knowledge proof","score":0.7934961318969727},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.6017784476280212},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5993252992630005},{"id":"https://openalex.org/keywords/identification-scheme","display_name":"Identification scheme","score":0.587083101272583},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5475059151649475},{"id":"https://openalex.org/keywords/security-parameter","display_name":"Security parameter","score":0.5382850170135498},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5370461344718933},{"id":"https://openalex.org/keywords/public-key-cryptography","display_name":"Public-key cryptography","score":0.5022702217102051},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4950060248374939},{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.4774754047393799},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.4682667553424835},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.46522092819213867},{"id":"https://openalex.org/keywords/coding-theory","display_name":"Coding theory","score":0.46123433113098145},{"id":"https://openalex.org/keywords/identification","display_name":"Identification (biology)","score":0.4288625717163086},{"id":"https://openalex.org/keywords/commitment-scheme","display_name":"Commitment scheme","score":0.41815873980522156},{"id":"https://openalex.org/keywords/message-authentication-code","display_name":"Message authentication code","score":0.41631361842155457},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.3686562776565552},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.36287593841552734},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3614409267902374},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2938218414783478},{"id":"https://openalex.org/keywords/encryption","display_name":"Encryption","score":0.13081330060958862},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.11685904860496521}],"concepts":[{"id":"https://openalex.org/C176329583","wikidata":"https://www.wikidata.org/wiki/Q191943","display_name":"Zero-knowledge proof","level":3,"score":0.7934961318969727},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.6017784476280212},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5993252992630005},{"id":"https://openalex.org/C2778922385","wikidata":"https://www.wikidata.org/wiki/Q3475620","display_name":"Identification scheme","level":3,"score":0.587083101272583},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5475059151649475},{"id":"https://openalex.org/C2776711565","wikidata":"https://www.wikidata.org/wiki/Q7445058","display_name":"Security parameter","level":3,"score":0.5382850170135498},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5370461344718933},{"id":"https://openalex.org/C203062551","wikidata":"https://www.wikidata.org/wiki/Q201339","display_name":"Public-key cryptography","level":3,"score":0.5022702217102051},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4950060248374939},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.4774754047393799},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.4682667553424835},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.46522092819213867},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.46123433113098145},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.4288625717163086},{"id":"https://openalex.org/C91399829","wikidata":"https://www.wikidata.org/wiki/Q1115684","display_name":"Commitment scheme","level":3,"score":0.41815873980522156},{"id":"https://openalex.org/C141492731","wikidata":"https://www.wikidata.org/wiki/Q1052621","display_name":"Message authentication code","level":3,"score":0.41631361842155457},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.3686562776565552},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.36287593841552734},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3614409267902374},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2938218414783478},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.13081330060958862},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.11685904860496521},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C59822182","wikidata":"https://www.wikidata.org/wiki/Q441","display_name":"Botany","level":1,"score":0.0},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw.2011.6089577","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2011.6089577","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Information Theory Workshop","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1495716978","https://openalex.org/W1527005907","https://openalex.org/W1897146492","https://openalex.org/W1981078592","https://openalex.org/W2001841415","https://openalex.org/W3099207695"],"related_works":["https://openalex.org/W3028977572","https://openalex.org/W2089957637","https://openalex.org/W4367593104","https://openalex.org/W1576843907","https://openalex.org/W2951182814","https://openalex.org/W2949886604","https://openalex.org/W4285248495","https://openalex.org/W2908156179","https://openalex.org/W3173632279","https://openalex.org/W2949471063"],"abstract_inverted_index":{"In":[0],"this":[1,61,126],"paper":[2,62],"we":[3,66,131],"present":[4],"a":[5,32,48,68,120,133,178,191,203,217,220],"new":[6,105,121,134,170],"5-pass":[7],"identification":[8,28],"scheme":[9,29,44,74,171],"with":[10,96,138],"asymptotic":[11],"cheating":[12,81],"probability":[13,82],"\u00bd":[14],"based":[15,102,144,182,238],"on":[16,70,103,145,154,183,239],"the":[17,26,71,80,108,115,155,173],"syndrome":[18],"decoding":[19],"problem.":[20],"Our":[21,99],"protocol":[22],"is":[23,63,101,128,161],"related":[24],"to":[25,37,46,77,83,91,136,235],"Stern":[27,72],"but":[30,95],"has":[31,172],"reduced":[33],"communication":[34,210],"cost":[35,211],"compared":[36,234],"previous":[38,236],"code-based":[39],"zero-knowledge":[40,142,179],"schemes,":[41],"moreover":[42],"our":[43,169],"permits":[45,76],"obtain":[47],"very":[49,89],"low":[50],"size":[51,193,223],"of":[52,60,114,123,152,176,188,194,212,222,224,232],"public":[53,117,197],"key":[54,110,118,198],"and":[55,196,219],"secret":[56,109,195],"key.":[57],"The":[58],"contribution":[59],"twofold,":[64],"first":[65],"propose":[67,132],"variation":[69],"authentication":[73,215],"which":[75],"decrease":[78],"asymptotically":[79],"1/2":[84,92],"rather":[85,163],"than":[86,164],"2/3":[87],"(and":[88],"close":[90],"in":[93,141,150],"practice)":[94],"less":[97],"communication.":[98],"solution":[100],"deriving":[104],"challenges":[106],"from":[107],"through":[111],"cyclic":[112],"shifts":[113],"initial":[116],"syndrome;":[119],"proof":[122,181],"soundness":[124],"for":[125,207,214],"case":[127],"given":[129],"Secondly":[130],"way":[135],"deal":[137],"hashed":[139],"commitments":[140],"schemes":[143,237],"Stern's":[146],"scheme,":[147],"so":[148],"that":[149],"terms":[151],"communication,":[153],"average,":[156],"only":[157],"one":[158],"hash":[159],"value":[160],"sent":[162],"two":[165],"or":[166],"three.":[167],"Overall":[168],"good":[174],"features":[175],"having":[177],"security":[180,228],"well":[184],"known":[185],"hard":[186],"problem":[187],"coding":[189,240],"theory,":[190],"small":[192,204],"(a":[199],"few":[200],"hundred":[201],"bits),":[202],"calculation":[205],"complexity,":[206],"an":[208,230],"overall":[209],"19kb":[213],"(for":[216,227],"216security)":[218],"signature":[221],"93kb":[225],"(11.5kB)":[226],"280),":[229],"improvement":[231],"40%":[233],"theory.":[241]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}