Quantum commitments and signatures without one-way functions

Morimae, Tomoyuki; Yamakawa, Takashi

doi:10.48550/arxiv.2112.06369

Cited by 1 publication

(3 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we construct a commitment scheme that satisfies poly-copy statistical hiding and statistical sum-biding in the CHS model. The scheme is inspired by the quantum commitment scheme proposed in [MY21;MNY23]. In contrast to the scheme in [MY21], our construction is not of the canonical form [Yan22].…”

Section: Quantum Commitments In the Chs Modelmentioning

confidence: 99%

“…The scheme is inspired by the quantum commitment scheme proposed in [MY21;MNY23]. In contrast to the scheme in [MY21], our construction is not of the canonical form [Yan22]. To achieve binding, similar to [MNY23], the receiver needs to perform several SWAP tests.…”

Section: Quantum Commitments In the Chs Modelmentioning

confidence: 99%

“…Note that our impossibility results only rule out implementations that ask classical queries to the PRSG. There exist applications that need to query a PRSG/PRFSG in superposition, e.g., quantum bit commitments [MY21], quantum PKEs [BGH+23], etc. However, all of them require quantum communication.…”

Section: Define the Quantity P R *mentioning

confidence: 99%

See 2 more Smart Citations

Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications

Ananth¹,

Gulati²,

Qian³

et al. 2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Common random string model is a popular model in classical cryptography. We study a quantum analogue of this model called the common Haar state (CHS) model. In this model, every party participating in the cryptographic system receives many copies of one or more i.i.d Haar random states.We study feasibility and limitations of cryptographic primitives in this model and its variants:• We present a construction of pseudorandom function-like states with security against computationally unbounded adversaries, as long as the adversaries only receive (a priori) bounded number of copies. By suitably instantiating the CHS model, we obtain a new approach to construct pseudorandom function-like states in the plain model.

show abstract