Table of Contents
Fetching ...

On black-box separations of quantum digital signatures from pseudorandom states

Andrea Coladangelo, Saachi Mutreja

TL;DR

It is shown that there does not exist a black-box construction of a QDS scheme with classical signatures from pseudorandom states with linear, or greater, output length.

Abstract

It is well-known that digital signatures can be constructed from one-way functions in a black-box way. While one-way functions are essentially the minimal assumption in classical cryptography, this is not the case in the quantum setting. A variety of qualitatively weaker and inherently quantum assumptions (e.g. EFI pairs, one-way state generators, and pseudorandom states) are known to be sufficient for non-trivial quantum cryptography. While it is known that commitments, zero-knowledge proofs, and even multiparty computation can be constructed from these assumptions, it has remained an open question whether the same is true for quantum digital signatures schemes (QDS). In this work, we show that there $\textit{does not}$ exist a black-box construction of a QDS scheme with classical signatures from pseudorandom states with linear, or greater, output length. Our result complements that of Morimae and Yamakawa (2022), who described a $\textit{one-time}$ secure QDS scheme with classical signatures, but left open the question of constructing a standard $\textit{multi-time}$ secure one.

On black-box separations of quantum digital signatures from pseudorandom states

TL;DR

It is shown that there does not exist a black-box construction of a QDS scheme with classical signatures from pseudorandom states with linear, or greater, output length.

Abstract

It is well-known that digital signatures can be constructed from one-way functions in a black-box way. While one-way functions are essentially the minimal assumption in classical cryptography, this is not the case in the quantum setting. A variety of qualitatively weaker and inherently quantum assumptions (e.g. EFI pairs, one-way state generators, and pseudorandom states) are known to be sufficient for non-trivial quantum cryptography. While it is known that commitments, zero-knowledge proofs, and even multiparty computation can be constructed from these assumptions, it has remained an open question whether the same is true for quantum digital signatures schemes (QDS). In this work, we show that there exist a black-box construction of a QDS scheme with classical signatures from pseudorandom states with linear, or greater, output length. Our result complements that of Morimae and Yamakawa (2022), who described a secure QDS scheme with classical signatures, but left open the question of constructing a standard secure one.
Paper Structure (35 sections, 15 theorems, 46 equations, 1 algorithm)

This paper contains 35 sections, 15 theorems, 46 equations, 1 algorithm.

Key Result

Theorem 1.1

There is a quantum oracle $O$ relative to which:

Theorems & Definitions (35)

  • Theorem 1.1: Informal
  • Corollary 1.2: Informal
  • Remark 2.1
  • Theorem 3.2: Mec19
  • Lemma 3.3: kretschmer2021quantum
  • Definition 1: Pseudorandom Quantum State (PRS)
  • Definition 2: Pseudorandom unitary transformations (PRU) (JLS2018)
  • Definition 3
  • Definition 4: Implementations relative to an oracle
  • Definition 5
  • ...and 25 more