Zobraziť v EDS

Computationally Secure Semi‐Quantum All‐Or‐Nothing Oblivious Transfer from Dihedral Coset States.

Uložené v:
Podrobná bibliografia
Názov: Computationally Secure Semi‐Quantum All‐Or‐Nothing Oblivious Transfer from Dihedral Coset States.
Autori: Yan, Xingyu, Wang, Licheng, Gu, Lize
Zdroj: Advanced Quantum Technologies; May2024, Vol. 7 Issue 5, p1-14, 14p
Predmety: QUANTUM cryptography, POLYNOMIAL time algorithms, INFORMATION-theoretic security, HARDNESS
Abstrakt: The quest for perfect quantum oblivious transfer (QOT) with information‐theoretic security remains a challenge, necessitating the exploration of computationally secure QOT as a viable alternative. Unlike the unconditionally secure quantum key distribution (QKD), the computationally secure QOT relies on specific quantum‐safe computational hardness assumptions, such as the post‐quantum hardness of learning with errors (LWE) problem and quantum‐hard one‐way functions. This raises an intriguing question: Are there additional efficient quantum hardness assumptions that are suitable for QOT? In this work, leveraging the dihedral coset state derived from the dihedral coset problem (DCP), a basic variant of OT, known as the all‐or‐nothing OT, is studied in the semi‐quantum setting. Specifically, the DCP originates from the dihedral hidden subgroup problem (DHSP), conjectured to be challenging for any quantum polynomial‐time algorithms. First, a computationally secure quantum protocol is presented for all‐or‐nothing OT, which is then simplified into a semi‐quantum OT protocol with minimal quantumness, where the interaction needs merely classical communication. To efficiently instantiate the dihedral coset state, a powerful cryptographic tool called the LWE‐based noisy trapdoor claw‐free functions (NTCFs) is used. The construction requires only a three‐message interaction and ensures perfect statistical privacy for the receiver and computational privacy for the sender. [ABSTRACT FROM AUTHOR]
Copyright of Advanced Quantum Technologies is the property of Wiley-Blackwell 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áza: Complementary Index
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Yan%20X
    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: 177219765
RelevancyScore: 983
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 983.421264648438
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Computationally Secure Semi‐Quantum All‐Or‐Nothing Oblivious Transfer from Dihedral Coset States.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Yan%2C+Xingyu%22">Yan, Xingyu</searchLink><br /><searchLink fieldCode="AR" term="%22Wang%2C+Licheng%22">Wang, Licheng</searchLink><br /><searchLink fieldCode="AR" term="%22Gu%2C+Lize%22">Gu, Lize</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: Advanced Quantum Technologies; May2024, Vol. 7 Issue 5, p1-14, 14p
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22QUANTUM+cryptography%22">QUANTUM cryptography</searchLink><br /><searchLink fieldCode="DE" term="%22POLYNOMIAL+time+algorithms%22">POLYNOMIAL time algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22INFORMATION-theoretic+security%22">INFORMATION-theoretic security</searchLink><br /><searchLink fieldCode="DE" term="%22HARDNESS%22">HARDNESS</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The quest for perfect quantum oblivious transfer (QOT) with information‐theoretic security remains a challenge, necessitating the exploration of computationally secure QOT as a viable alternative. Unlike the unconditionally secure quantum key distribution (QKD), the computationally secure QOT relies on specific quantum‐safe computational hardness assumptions, such as the post‐quantum hardness of learning with errors (LWE) problem and quantum‐hard one‐way functions. This raises an intriguing question: Are there additional efficient quantum hardness assumptions that are suitable for QOT? In this work, leveraging the dihedral coset state derived from the dihedral coset problem (DCP), a basic variant of OT, known as the all‐or‐nothing OT, is studied in the semi‐quantum setting. Specifically, the DCP originates from the dihedral hidden subgroup problem (DHSP), conjectured to be challenging for any quantum polynomial‐time algorithms. First, a computationally secure quantum protocol is presented for all‐or‐nothing OT, which is then simplified into a semi‐quantum OT protocol with minimal quantumness, where the interaction needs merely classical communication. To efficiently instantiate the dihedral coset state, a powerful cryptographic tool called the LWE‐based noisy trapdoor claw‐free functions (NTCFs) is used. The construction requires only a three‐message interaction and ensures perfect statistical privacy for the receiver and computational privacy for the sender. [ABSTRACT FROM AUTHOR]
– Name: Abstract
  Label:
  Group: Ab
  Data: <i>Copyright of Advanced Quantum Technologies is the property of Wiley-Blackwell 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=177219765
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1002/qute.202300269
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 14
        StartPage: 1
    Subjects:
      – SubjectFull: QUANTUM cryptography
        Type: general
      – SubjectFull: POLYNOMIAL time algorithms
        Type: general
      – SubjectFull: INFORMATION-theoretic security
        Type: general
      – SubjectFull: HARDNESS
        Type: general
    Titles:
      – TitleFull: Computationally Secure Semi‐Quantum All‐Or‐Nothing Oblivious Transfer from Dihedral Coset States.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Yan, Xingyu
      – PersonEntity:
          Name:
            NameFull: Wang, Licheng
      – PersonEntity:
          Name:
            NameFull: Gu, Lize
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 05
              Text: May2024
              Type: published
              Y: 2024
          Identifiers:
            – Type: issn-print
              Value: 25119044
          Numbering:
            – Type: volume
              Value: 7
            – Type: issue
              Value: 5
          Titles:
            – TitleFull: Advanced Quantum Technologies
              Type: main
ResultId 1