ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2310.05213
39
0
v1v2 (latest)

A Quantum Approach for Reducing Communications in Classical Cryptographic Primitives

8 October 2023
Jiayu Zhang
ArXiv (abs)PDFHTML
Abstract

How could quantum cryptography help us achieve what are not achievable in classical cryptography? In this work we consider the following problem, which we call succinct RSPV for classical functions (sRCF). Suppose fff is a function described by a polynomial time classical Turing machine, which is public; the client would like to sample a random xxx as the function input and use a protocol to send f(x)f(x)f(x) to the server. What's more, (1) when the server is malicious, what it knows in the passing space should be no more than f(x)f(x)f(x); (2) the communication should be succinct (that is, independent to the running time of evaluating fff). Solving this problem in classical cryptography seems to require strong cryptographic primitives. We show that, perhaps surprisingly, it's possible to solve this problem with quantum techniques under much weaker assumptions. By allowing for quantum communication and computations, we give a protocol for this problem assuming only collapsing hash functions [Unr16]. Our work conveys an interesting message that quantum cryptography could outperform classical cryptography in a new type of problems, that is, to reduce communications in meaningful primitives without using heavy classical cryptographic primitives.

View on arXiv
Comments on this paper