Zobrazit v EDS

HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems

Uloženo v:
Podrobná bibliografie
Název: HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems
Autoři: Duc, Alexandre, Vaudenay, Serge
Přispěvatelé: Youssef, Amr, Nitaj, Abderrahmane, Hassanien, Aboul Ella
Informace o vydavateli: Springer
Berlin
Rok vydání: 2013
Sbírka: Ecole Polytechnique Fédérale Lausanne (EPFL): Infoscience
Témata: Code-based cryptosystem, learning from parity with noise problem, LPN, minimum distance problem, random linear code, public-key cryptosystem
Popis: We propose HELEN, a code-based public-key cryptosystem whose security is based on the hardness of the Learning from Parity with Noise problem (LPN) and the decisional minimum distance problem. We show that the resulting cryptosystem achieves indistinguishability under chosen plaintext attacks (IND-CPA security). Using the Fujisaki-Okamoto generic construction, HELEN achieves IND-CCA security in the random oracle model. Our cryptosystem looks like the Alekhnovich cryptosystem. However, we carefully study its complexity and we further propose concrete optimized parameters. ; LASEC
Druh dokumentu: conference object
Jazyk: unknown
ISBN: 978-3-642-38552-0
3-642-38552-4
Relation: https://infoscience.epfl.ch/record/187368/files/helen-full.pdf; Proceedings of the 6th International Conference on Cryptology in Africa; Lecture Notes in Computer Science; 7918; AFRICACRYPT 2013, 6th International Conference on Cryptology in Africa; https://infoscience.epfl.ch/handle/20.500.14299/93139
DOI: 10.1007/978-3-642-38553-7_6
Dostupnost: https://doi.org/10.1007/978-3-642-38553-7_6
https://infoscience.epfl.ch/handle/20.500.14299/93139
https://hdl.handle.net/20.500.14299/93139
Přístupové číslo: edsbas.301DB164
Databáze: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://doi.org/10.1007/978-3-642-38553-7_6#
    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=Duc%20A
    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.301DB164
RelevancyScore: 790
AccessLevel: 3
PubType: Conference
PubTypeId: conference
PreciseRelevancyScore: 790.314270019531
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Duc%2C+Alexandre%22">Duc, Alexandre</searchLink><br /><searchLink fieldCode="AR" term="%22Vaudenay%2C+Serge%22">Vaudenay, Serge</searchLink>
– Name: Author
  Label: Contributors
  Group: Au
  Data: Youssef, Amr<br />Nitaj, Abderrahmane<br />Hassanien, Aboul Ella
– Name: Publisher
  Label: Publisher Information
  Group: PubInfo
  Data: Springer<br />Berlin
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2013
– Name: Subset
  Label: Collection
  Group: HoldingsInfo
  Data: Ecole Polytechnique Fédérale Lausanne (EPFL): Infoscience
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Code-based+cryptosystem%22">Code-based cryptosystem</searchLink><br /><searchLink fieldCode="DE" term="%22learning+from+parity+with+noise+problem%22">learning from parity with noise problem</searchLink><br /><searchLink fieldCode="DE" term="%22LPN%22">LPN</searchLink><br /><searchLink fieldCode="DE" term="%22minimum+distance+problem%22">minimum distance problem</searchLink><br /><searchLink fieldCode="DE" term="%22random+linear+code%22">random linear code</searchLink><br /><searchLink fieldCode="DE" term="%22public-key+cryptosystem%22">public-key cryptosystem</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: We propose HELEN, a code-based public-key cryptosystem whose security is based on the hardness of the Learning from Parity with Noise problem (LPN) and the decisional minimum distance problem. We show that the resulting cryptosystem achieves indistinguishability under chosen plaintext attacks (IND-CPA security). Using the Fujisaki-Okamoto generic construction, HELEN achieves IND-CCA security in the random oracle model. Our cryptosystem looks like the Alekhnovich cryptosystem. However, we carefully study its complexity and we further propose concrete optimized parameters. ; LASEC
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: conference object
– Name: Language
  Label: Language
  Group: Lang
  Data: unknown
– Name: ISBN
  Label: ISBN
  Group: ISBN
  Data: 978-3-642-38552-0<br />3-642-38552-4
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: https://infoscience.epfl.ch/record/187368/files/helen-full.pdf; Proceedings of the 6th International Conference on Cryptology in Africa; Lecture Notes in Computer Science; 7918; AFRICACRYPT 2013, 6th International Conference on Cryptology in Africa; https://infoscience.epfl.ch/handle/20.500.14299/93139
– Name: DOI
  Label: DOI
  Group: ID
  Data: 10.1007/978-3-642-38553-7_6
– Name: URL
  Label: Availability
  Group: URL
  Data: https://doi.org/10.1007/978-3-642-38553-7_6<br />https://infoscience.epfl.ch/handle/20.500.14299/93139<br />https://hdl.handle.net/20.500.14299/93139
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.301DB164
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.301DB164
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/978-3-642-38553-7_6
    Languages:
      – Text: unknown
    Subjects:
      – SubjectFull: Code-based cryptosystem
        Type: general
      – SubjectFull: learning from parity with noise problem
        Type: general
      – SubjectFull: LPN
        Type: general
      – SubjectFull: minimum distance problem
        Type: general
      – SubjectFull: random linear code
        Type: general
      – SubjectFull: public-key cryptosystem
        Type: general
    Titles:
      – TitleFull: HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Duc, Alexandre
      – PersonEntity:
          Name:
            NameFull: Vaudenay, Serge
      – PersonEntity:
          Name:
            NameFull: Youssef, Amr
      – PersonEntity:
          Name:
            NameFull: Nitaj, Abderrahmane
      – PersonEntity:
          Name:
            NameFull: Hassanien, Aboul Ella
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2013
          Identifiers:
            – Type: isbn-print
              Value: 9783642385520
            – Type: isbn-print
              Value: 3642385524
            – Type: issn-locals
              Value: edsbas
ResultId 1