Zobrazit v EDS

Ouroboros: An Efficient and Provably Secure KEM Family.

Uloženo v:
Podrobná bibliografie
Název: Ouroboros: An Efficient and Provably Secure KEM Family.
Autoři: Aragon, Nicolas, Blazy, Olivier, Deneuville, Jean-Christophe, Gaborit, Philippe, Zemor, Gilles
Zdroj: IEEE Transactions on Information Theory; Sep2022, Vol. 68 Issue 9, p6233-6244, 12p
Témata: CODING theory, CYCLIC codes, DECODING algorithms, CRYPTOSYSTEMS, WORK structure
Abstrakt: In this paper we introduce Ouroboros, a new family of Key Exchange protocols based on coding theory. The protocols propose a middle ground between the cryptosystems based on $\mathsf {QC}$ - $\mathsf {MDPC}$ codes, which feature small parameter sizes, but have a security reduction to two problems: the syndrome decoding problem and the indistinguishability of the code, and the HQC protocol, which features bigger parameters but has a security reduction to the syndrome decoding problem only. Ouroboros features a reduction to the syndrome decoding problem with only a small overhead compared to the $\mathsf {QC}$ - $\mathsf {MDPC}$ based cryptosystems. The approach is based on an ideal structure and also works for the rank metric. This yields a simple, secure and efficient approach for key exchange, the Ouroboros family of protocols. For the Hamming metric we obtain the same type of parameters (and almost the same simple decoding) as for $\mathsf {MDPC}$ based cryptosystems, but with a security reduction to decoding random quasi-cyclic codes in the Random Oracle Model. This represents a reduction of up to 38% on the public key size compared to HQC, for the most secure parameters. For the rank metric, we obtain better parameters than for RQC, saving up to 31% on the public key for the most secure set of parameters, using non homogeneous errors in Ouroboros. In this full version, the protocol and decoding algorithm have been slightly improved, additional details are given in the security proof, and the protocol is fully described for the rank metric. [ABSTRACT FROM AUTHOR]
Copyright of IEEE Transactions on Information Theory is the property of IEEE 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.)
Databáze: Complementary Index
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:edb&genre=article&issn=00189448&ISBN=&volume=68&issue=9&date=20220901&spage=6233&pages=6233-6244&title=IEEE Transactions on Information Theory&atitle=Ouroboros%3A%20An%20Efficient%20and%20Provably%20Secure%20KEM%20Family.&aulast=Aragon%2C%20Nicolas&id=DOI:10.1109/TIT.2022.3168439
    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=Aragon%20N
    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: 158603978
RelevancyScore: 932
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 931.681945800781
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Ouroboros: An Efficient and Provably Secure KEM Family.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Aragon%2C+Nicolas%22">Aragon, Nicolas</searchLink><br /><searchLink fieldCode="AR" term="%22Blazy%2C+Olivier%22">Blazy, Olivier</searchLink><br /><searchLink fieldCode="AR" term="%22Deneuville%2C+Jean-Christophe%22">Deneuville, Jean-Christophe</searchLink><br /><searchLink fieldCode="AR" term="%22Gaborit%2C+Philippe%22">Gaborit, Philippe</searchLink><br /><searchLink fieldCode="AR" term="%22Zemor%2C+Gilles%22">Zemor, Gilles</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: IEEE Transactions on Information Theory; Sep2022, Vol. 68 Issue 9, p6233-6244, 12p
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22CODING+theory%22">CODING theory</searchLink><br /><searchLink fieldCode="DE" term="%22CYCLIC+codes%22">CYCLIC codes</searchLink><br /><searchLink fieldCode="DE" term="%22DECODING+algorithms%22">DECODING algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22CRYPTOSYSTEMS%22">CRYPTOSYSTEMS</searchLink><br /><searchLink fieldCode="DE" term="%22WORK+structure%22">WORK structure</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: In this paper we introduce Ouroboros, a new family of Key Exchange protocols based on coding theory. The protocols propose a middle ground between the cryptosystems based on $\mathsf {QC}$ - $\mathsf {MDPC}$ codes, which feature small parameter sizes, but have a security reduction to two problems: the syndrome decoding problem and the indistinguishability of the code, and the HQC protocol, which features bigger parameters but has a security reduction to the syndrome decoding problem only. Ouroboros features a reduction to the syndrome decoding problem with only a small overhead compared to the $\mathsf {QC}$ - $\mathsf {MDPC}$ based cryptosystems. The approach is based on an ideal structure and also works for the rank metric. This yields a simple, secure and efficient approach for key exchange, the Ouroboros family of protocols. For the Hamming metric we obtain the same type of parameters (and almost the same simple decoding) as for $\mathsf {MDPC}$ based cryptosystems, but with a security reduction to decoding random quasi-cyclic codes in the Random Oracle Model. This represents a reduction of up to 38% on the public key size compared to HQC, for the most secure parameters. For the rank metric, we obtain better parameters than for RQC, saving up to 31% on the public key for the most secure set of parameters, using non homogeneous errors in Ouroboros. In this full version, the protocol and decoding algorithm have been slightly improved, additional details are given in the security proof, and the protocol is fully described for the rank metric. [ABSTRACT FROM AUTHOR]
– Name: Abstract
  Label:
  Group: Ab
  Data: <i>Copyright of IEEE Transactions on Information Theory is the property of IEEE 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=158603978
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1109/TIT.2022.3168439
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 12
        StartPage: 6233
    Subjects:
      – SubjectFull: CODING theory
        Type: general
      – SubjectFull: CYCLIC codes
        Type: general
      – SubjectFull: DECODING algorithms
        Type: general
      – SubjectFull: CRYPTOSYSTEMS
        Type: general
      – SubjectFull: WORK structure
        Type: general
    Titles:
      – TitleFull: Ouroboros: An Efficient and Provably Secure KEM Family.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Aragon, Nicolas
      – PersonEntity:
          Name:
            NameFull: Blazy, Olivier
      – PersonEntity:
          Name:
            NameFull: Deneuville, Jean-Christophe
      – PersonEntity:
          Name:
            NameFull: Gaborit, Philippe
      – PersonEntity:
          Name:
            NameFull: Zemor, Gilles
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 09
              Text: Sep2022
              Type: published
              Y: 2022
          Identifiers:
            – Type: issn-print
              Value: 00189448
          Numbering:
            – Type: volume
              Value: 68
            – Type: issue
              Value: 9
          Titles:
            – TitleFull: IEEE Transactions on Information Theory
              Type: main
ResultId 1