In EDS ansehen

HELEN: a Public-key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems

Gespeichert in:
Bibliographische Detailangaben
Titel: HELEN: a Public-key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems
Autoren: Alexandre Duc, Serge Vaudenay
Weitere Verfasser: The Pennsylvania State University CiteSeerX Archives
Quelle: http://infoscience.epfl.ch/record/187368/files/helen-full.pdf.
Bestand: CiteSeerX
Schlagwörter: Code-based cryptosystem, learning from parity with noise problem, minimum distance problem
Beschreibung: 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.
Publikationsart: text
Dateibeschreibung: application/pdf
Sprache: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.779
Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.779
http://infoscience.epfl.ch/record/187368/files/helen-full.pdf
Rights: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Dokumentencode: edsbas.4EB39AB5
Datenbank: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.779#
    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.4EB39AB5
RelevancyScore: 750
AccessLevel: 3
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 750
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="%22Alexandre+Duc%22">Alexandre Duc</searchLink><br /><searchLink fieldCode="AR" term="%22Serge+Vaudenay%22">Serge Vaudenay</searchLink>
– Name: Author
  Label: Contributors
  Group: Au
  Data: The Pennsylvania State University CiteSeerX Archives
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <i>http://infoscience.epfl.ch/record/187368/files/helen-full.pdf</i>.
– Name: Subset
  Label: Collection
  Group: HoldingsInfo
  Data: CiteSeerX
– 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="%22minimum+distance+problem%22">minimum distance problem</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.
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: text
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: application/pdf
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.779
– Name: URL
  Label: Availability
  Group: URL
  Data: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.779<br />http://infoscience.epfl.ch/record/187368/files/helen-full.pdf
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.4EB39AB5
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.4EB39AB5
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Text: English
    Subjects:
      – SubjectFull: Code-based cryptosystem
        Type: general
      – SubjectFull: learning from parity with noise problem
        Type: general
      – SubjectFull: minimum distance problem
        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: Alexandre Duc
      – PersonEntity:
          Name:
            NameFull: Serge Vaudenay
      – PersonEntity:
          Name:
            NameFull: The Pennsylvania State University CiteSeerX Archives
    IsPartOfRelationships:
      – BibEntity:
          Identifiers:
            – Type: issn-locals
              Value: edsbas
            – Type: issn-locals
              Value: edsbas.oa
          Titles:
            – TitleFull: http://infoscience.epfl.ch/record/187368/files/helen-full.pdf
              Type: main
ResultId 1