Leveraging the hardness of dihedral coset problem for quantum cryptography

Yan, Xingyu; Gu, Lize; Suo, Jingwen; Wang, Licheng

doi:10.1007/s11128-022-03592-9

Cited by 1 publication

(2 citation statements)

References 49 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, the DCP assumption, being at least as hard as lattice problems, emerges as a promising candidate for quantum cryptographic applications. [60] Definition 2.3Dihedral coset problem (DCP) [53] . Given a modulus N, the input to the dihedral coset problem (DCP) is a tensor product of polynomial 𝓁 coset states, each coset state is defined by…”

Section: Dihedral Coset Problemmentioning

confidence: 99%

“…Therefore, the DCP assumption, being at least as hard as lattice problems, emerges as a promising candidate for quantum cryptographic applications. [ 60 ] Definition Given a modulus

N

, the input to the dihedral coset problem (DCP) is a tensor product of polynomial

\ell

coset states, each coset state is defined by

\begin{equation} \frac{1}{\sqrt {2}}(\ket {0,x}+\ket {1,(x+s)\mod {N}}) \end{equation}

…”

Section: Preliminariesmentioning

confidence: 99%

See 1 more Smart Citation

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

Yan,

Wang,

2024

Adv Quantum Tech

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Dihedral Coset Problemmentioning

confidence: 99%

“…Therefore, the DCP assumption, being at least as hard as lattice problems, emerges as a promising candidate for quantum cryptographic applications. [ 60 ] Definition Given a modulus