In EDS ansehen

Code-based signatures from new proofs of knowledge for the syndrome decoding problem.

Gespeichert in:
Bibliographische Detailangaben
Titel: Code-based signatures from new proofs of knowledge for the syndrome decoding problem.
Autoren: Bidoux, Loïc, Gaborit, Philippe, Kulkarni, Mukul, Mateu, Victor
Quelle: Designs, Codes & Cryptography; Feb2023, Vol. 91 Issue 2, p497-544, 48p
Schlagwörter: DECODING algorithms, PUBLIC key cryptography, INFORMATION theory, SYNDROMES, CRYPTOCURRENCIES, TRUST, CRYPTOGRAPHY
Abstract: In this paper, we study code-based signatures constructed from Proofs of Knowledge (PoK). This line of work can be traced back to Stern who introduced the first efficient PoK for the syndrome decoding problem in 1993 (Stern in A new identification scheme based on syndrome decoding. In: International cryptology conference (CRYPTO), 1993). Afterwards, different variations were proposed in order to reduce signature's size. In practice, obtaining a smaller signature size relies on the interaction of two main considerations: (i) the underlying protocol and its soundness error and (ii) the types of optimizations which are compatible with a given protocol. In particular, optimizations related to the possibility of using random seeds instead of long vectors have a great impact on the final signature length. Over the years, different variations were proposed to improve the Stern scheme such as the Veron scheme (with public key as a noisy codeword rather than a syndrome) (Véron in Appl Algebra Eng Commun Comput 8(1):57-69, 1997), the AGS scheme which is a 5-pass protocol with soundness error asymptotically equal to 1/2 (Aguilar et al. in A new zero-knowledge code based identification scheme with reduced communication. In: IEEE information theory workshop, 2011) and more recently the FJR approach which permits to decrease the soundness probability to 1/N but induces a performance overhead (Feneuil et al. in Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature. Cryptology ePrint archive, report 2021/1576, 2021). Overall the length of the signature depends on a trade-off between: the scheme in itself, the possible optimizations and the cost of the implementation. For instance, depending on the application one may prefer a 30% shorter signature at the cost of a ten times slower implementation rather than a longer signature but a faster implementation. The recent approaches which increase the cost of the implementation open the door to many different types of trade-offs. In this paper we propose three new schemes and different trade-offs, which are all interesting in themselves, since depending on potential future optimizations a scheme may eventually become more efficient than another. All the schemes we propose use a trusted helper: the first scheme permits to get a soundness error of 1/2, the second scheme permits to decrease the soundness error to 1/N but with a different approach than the recent FJR scheme and at last the third scheme proposes a Veron-like adaptation of the FJR scheme in which the public key is a noisy codeword rather than a syndrome. We provide extensive comparison which lists various trade-offs between our schemes and previous ones. The table highlights the benefits of our constructions for certain types of trade-offs. [ABSTRACT FROM AUTHOR]
Copyright of Designs, Codes & Cryptography is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Datenbank: Complementary Index
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:edb&genre=article&issn=09251022&ISBN=&volume=91&issue=2&date=20230201&spage=497&pages=497-544&title=Designs, Codes & Cryptography&atitle=Code-based%20signatures%20from%20new%20proofs%20of%20knowledge%20for%20the%20syndrome%20decoding%20problem.&aulast=Bidoux%2C%20Lo%C3%AFc&id=DOI:10.1007/s10623-022-01114-3
    Name: Full Text Finder
    Category: fullText
    Text: Full Text Finder
    Icon: https://imageserver.ebscohost.com/branding/images/FTF.gif
    MouseOverText: Full Text Finder
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Bidoux%20L
    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: edb
DbLabel: Complementary Index
An: 161796513
RelevancyScore: 944
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 943.757873535156
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Code-based signatures from new proofs of knowledge for the syndrome decoding problem.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Bidoux%2C+Loïc%22">Bidoux, Loïc</searchLink><br /><searchLink fieldCode="AR" term="%22Gaborit%2C+Philippe%22">Gaborit, Philippe</searchLink><br /><searchLink fieldCode="AR" term="%22Kulkarni%2C+Mukul%22">Kulkarni, Mukul</searchLink><br /><searchLink fieldCode="AR" term="%22Mateu%2C+Victor%22">Mateu, Victor</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: Designs, Codes & Cryptography; Feb2023, Vol. 91 Issue 2, p497-544, 48p
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22DECODING+algorithms%22">DECODING algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22PUBLIC+key+cryptography%22">PUBLIC key cryptography</searchLink><br /><searchLink fieldCode="DE" term="%22INFORMATION+theory%22">INFORMATION theory</searchLink><br /><searchLink fieldCode="DE" term="%22SYNDROMES%22">SYNDROMES</searchLink><br /><searchLink fieldCode="DE" term="%22CRYPTOCURRENCIES%22">CRYPTOCURRENCIES</searchLink><br /><searchLink fieldCode="DE" term="%22TRUST%22">TRUST</searchLink><br /><searchLink fieldCode="DE" term="%22CRYPTOGRAPHY%22">CRYPTOGRAPHY</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: In this paper, we study code-based signatures constructed from Proofs of Knowledge (PoK). This line of work can be traced back to Stern who introduced the first efficient PoK for the syndrome decoding problem in 1993 (Stern in A new identification scheme based on syndrome decoding. In: International cryptology conference (CRYPTO), 1993). Afterwards, different variations were proposed in order to reduce signature's size. In practice, obtaining a smaller signature size relies on the interaction of two main considerations: (i) the underlying protocol and its soundness error and (ii) the types of optimizations which are compatible with a given protocol. In particular, optimizations related to the possibility of using random seeds instead of long vectors have a great impact on the final signature length. Over the years, different variations were proposed to improve the Stern scheme such as the Veron scheme (with public key as a noisy codeword rather than a syndrome) (Véron in Appl Algebra Eng Commun Comput 8(1):57-69, 1997), the AGS scheme which is a 5-pass protocol with soundness error asymptotically equal to 1/2 (Aguilar et al. in A new zero-knowledge code based identification scheme with reduced communication. In: IEEE information theory workshop, 2011) and more recently the FJR approach which permits to decrease the soundness probability to 1/N but induces a performance overhead (Feneuil et al. in Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature. Cryptology ePrint archive, report 2021/1576, 2021). Overall the length of the signature depends on a trade-off between: the scheme in itself, the possible optimizations and the cost of the implementation. For instance, depending on the application one may prefer a 30% shorter signature at the cost of a ten times slower implementation rather than a longer signature but a faster implementation. The recent approaches which increase the cost of the implementation open the door to many different types of trade-offs. In this paper we propose three new schemes and different trade-offs, which are all interesting in themselves, since depending on potential future optimizations a scheme may eventually become more efficient than another. All the schemes we propose use a trusted helper: the first scheme permits to get a soundness error of 1/2, the second scheme permits to decrease the soundness error to 1/N but with a different approach than the recent FJR scheme and at last the third scheme proposes a Veron-like adaptation of the FJR scheme in which the public key is a noisy codeword rather than a syndrome. We provide extensive comparison which lists various trade-offs between our schemes and previous ones. The table highlights the benefits of our constructions for certain types of trade-offs. [ABSTRACT FROM AUTHOR]
– Name: Abstract
  Label:
  Group: Ab
  Data: <i>Copyright of Designs, Codes & Cryptography is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=161796513
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10623-022-01114-3
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 48
        StartPage: 497
    Subjects:
      – SubjectFull: DECODING algorithms
        Type: general
      – SubjectFull: PUBLIC key cryptography
        Type: general
      – SubjectFull: INFORMATION theory
        Type: general
      – SubjectFull: SYNDROMES
        Type: general
      – SubjectFull: CRYPTOCURRENCIES
        Type: general
      – SubjectFull: TRUST
        Type: general
      – SubjectFull: CRYPTOGRAPHY
        Type: general
    Titles:
      – TitleFull: Code-based signatures from new proofs of knowledge for the syndrome decoding problem.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Bidoux, Loïc
      – PersonEntity:
          Name:
            NameFull: Gaborit, Philippe
      – PersonEntity:
          Name:
            NameFull: Kulkarni, Mukul
      – PersonEntity:
          Name:
            NameFull: Mateu, Victor
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 02
              Text: Feb2023
              Type: published
              Y: 2023
          Identifiers:
            – Type: issn-print
              Value: 09251022
          Numbering:
            – Type: volume
              Value: 91
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Designs, Codes & Cryptography
              Type: main
ResultId 1