In EDS ansehen

A zero knowledge identification scheme based on the q-ary SD problem

Gespeichert in:
Bibliographische Detailangaben
Titel: A zero knowledge identification scheme based on the q-ary SD problem
Autoren: Cayrel, Pierre-Louis, Véron, Pascal, El Yousfi Alaoui, Sidi Mohamed
Weitere Verfasser: Laboratoire Hubert Curien (LabHC), Institut d'Optique Graduate School (IOGS)-Université Jean Monnet - Saint-Étienne (UJM)-Centre National de la Recherche Scientifique (CNRS), Institut de Mathématiques de Toulon - EA 2134 (IMATH), Université de Toulon (UTLN), Center for Advanced Security Research Darmstadt Darmstadt (CASED), Technische Universität Darmstadt - Technical University of Darmstadt (TU Darmstadt)
Quelle: Selected Areas in Cryptography ; https://inria.hal.science/hal-00674249 ; Selected Areas in Cryptography, Aug 2010, Waterloo, Canada. pp.171-186, ⟨10.1007/978-3-642-19574-7_12⟩
Verlagsinformationen: CCSD
Springer
Publikationsjahr: 2010
Bestand: Université de Lyon: HAL
Schlagwörter: ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]
Geographisches Schlagwort: Waterloo
Time: Waterloo, Canada
Beschreibung: International audience ; At CRYPTO'93, Stern proposed a 3-pass code-based identification scheme with a cheating probability of 2/3. In this paper, we propose a 5-pass code-based protocol with a lower communication complexity, allowing an impersonator to succeed with only a probability of 1/2. Furthermore, we propose to use double-circulant construction in order to dramatically reduce the size of the public key. The proposed scheme is zero-knowledge and relies on an NP-complete coding theory problem (namely the q-ary Syndrome Decoding problem). The parameters we suggest for the instantiation of this scheme take into account a recent study of (a generalization of) Stern's information set decoding algorithm, applicable to linear codes over arbitrary fields Fq; the public data of our construction is then 4 Kbytes, whereas that of Stern's scheme is 15 Kbytes for the same level of security. This provides a very practical identification scheme which is especially attractive for light-weight cryptography.
Publikationsart: conference object
Sprache: English
DOI: 10.1007/978-3-642-19574-7_12
Verfügbarkeit: https://inria.hal.science/hal-00674249
https://inria.hal.science/hal-00674249v1/document
https://inria.hal.science/hal-00674249v1/file/zkqsd.pdf
https://doi.org/10.1007/978-3-642-19574-7_12
Rights: info:eu-repo/semantics/OpenAccess
Dokumentencode: edsbas.421E4A03
Datenbank: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://inria.hal.science/hal-00674249#
    Name: EDS - BASE (s4221598)
    Category: fullText
    Text: View record from BASE
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Cayrel%20P
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edsbas
DbLabel: BASE
An: edsbas.421E4A03
RelevancyScore: 856
AccessLevel: 3
PubType: Conference
PubTypeId: conference
PreciseRelevancyScore: 856.324340820313
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A zero knowledge identification scheme based on the q-ary SD problem
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Cayrel%2C+Pierre-Louis%22">Cayrel, Pierre-Louis</searchLink><br /><searchLink fieldCode="AR" term="%22Véron%2C+Pascal%22">Véron, Pascal</searchLink><br /><searchLink fieldCode="AR" term="%22El+Yousfi+Alaoui%2C+Sidi+Mohamed%22">El Yousfi Alaoui, Sidi Mohamed</searchLink>
– Name: Author
  Label: Contributors
  Group: Au
  Data: Laboratoire Hubert Curien (LabHC)<br />Institut d'Optique Graduate School (IOGS)-Université Jean Monnet - Saint-Étienne (UJM)-Centre National de la Recherche Scientifique (CNRS)<br />Institut de Mathématiques de Toulon - EA 2134 (IMATH)<br />Université de Toulon (UTLN)<br />Center for Advanced Security Research Darmstadt Darmstadt (CASED)<br />Technische Universität Darmstadt - Technical University of Darmstadt (TU Darmstadt)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: Selected Areas in Cryptography ; https://inria.hal.science/hal-00674249 ; Selected Areas in Cryptography, Aug 2010, Waterloo, Canada. pp.171-186, ⟨10.1007/978-3-642-19574-7_12⟩
– Name: Publisher
  Label: Publisher Information
  Group: PubInfo
  Data: CCSD<br />Springer
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2010
– Name: Subset
  Label: Collection
  Group: HoldingsInfo
  Data: Université de Lyon: HAL
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22ACM%3A+E%2E%3A+Data%2FE%2E4%3A+CODING+AND+INFORMATION+THEORY%22">ACM: E.: Data/E.4: CODING AND INFORMATION THEORY</searchLink><br /><searchLink fieldCode="DE" term="%22[INFO%2EINFO-CR]Computer+Science+[cs]%2FCryptography+and+Security+[cs%2ECR]%22">[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]</searchLink>
– Name: Subject
  Label: Subject Geographic
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Waterloo%22">Waterloo</searchLink>
– Name: Subject
  Label: Time
  Group: Su
  Data: Waterloo, Canada
– Name: Abstract
  Label: Description
  Group: Ab
  Data: International audience ; At CRYPTO'93, Stern proposed a 3-pass code-based identification scheme with a cheating probability of 2/3. In this paper, we propose a 5-pass code-based protocol with a lower communication complexity, allowing an impersonator to succeed with only a probability of 1/2. Furthermore, we propose to use double-circulant construction in order to dramatically reduce the size of the public key. The proposed scheme is zero-knowledge and relies on an NP-complete coding theory problem (namely the q-ary Syndrome Decoding problem). The parameters we suggest for the instantiation of this scheme take into account a recent study of (a generalization of) Stern's information set decoding algorithm, applicable to linear codes over arbitrary fields Fq; the public data of our construction is then 4 Kbytes, whereas that of Stern's scheme is 15 Kbytes for the same level of security. This provides a very practical identification scheme which is especially attractive for light-weight cryptography.
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: conference object
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: DOI
  Label: DOI
  Group: ID
  Data: 10.1007/978-3-642-19574-7_12
– Name: URL
  Label: Availability
  Group: URL
  Data: https://inria.hal.science/hal-00674249<br />https://inria.hal.science/hal-00674249v1/document<br />https://inria.hal.science/hal-00674249v1/file/zkqsd.pdf<br />https://doi.org/10.1007/978-3-642-19574-7_12
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: info:eu-repo/semantics/OpenAccess
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.421E4A03
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.421E4A03
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/978-3-642-19574-7_12
    Languages:
      – Text: English
    Subjects:
      – SubjectFull: Waterloo
        Type: general
      – SubjectFull: ACM: E.: Data/E.4: CODING AND INFORMATION THEORY
        Type: general
      – SubjectFull: [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]
        Type: general
    Titles:
      – TitleFull: A zero knowledge identification scheme based on the q-ary SD problem
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Cayrel, Pierre-Louis
      – PersonEntity:
          Name:
            NameFull: Véron, Pascal
      – PersonEntity:
          Name:
            NameFull: El Yousfi Alaoui, Sidi Mohamed
      – PersonEntity:
          Name:
            NameFull: Laboratoire Hubert Curien (LabHC)
      – PersonEntity:
          Name:
            NameFull: Institut d'Optique Graduate School (IOGS)-Université Jean Monnet - Saint-Étienne (UJM)-Centre National de la Recherche Scientifique (CNRS)
      – PersonEntity:
          Name:
            NameFull: Institut de Mathématiques de Toulon - EA 2134 (IMATH)
      – PersonEntity:
          Name:
            NameFull: Université de Toulon (UTLN)
      – PersonEntity:
          Name:
            NameFull: Center for Advanced Security Research Darmstadt Darmstadt (CASED)
      – PersonEntity:
          Name:
            NameFull: Technische Universität Darmstadt - Technical University of Darmstadt (TU Darmstadt)
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2010
          Identifiers:
            – Type: issn-locals
              Value: edsbas
            – Type: issn-locals
              Value: edsbas.oa
          Titles:
            – TitleFull: Selected Areas in Cryptography ; https://inria.hal.science/hal-00674249 ; Selected Areas in Cryptography, Aug 2010, Waterloo, Canada. pp.171-186, ⟨10.1007/978-3-642-19574-7_12⟩
              Type: main
ResultId 1