Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2304.10480 · Lecture notes in computer science

Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge)

James Bartusek, Dakshita Khurana, Akshayaram Srinivasan

Published Jan 1, 2023• 6 citations
arXivHTMLPDF
DOI
10.1007/978-3-031-38554-4_8

Related papers

A scheme for secure direct communication using EPR pairs and teleportation

Fengli Yan, X. Q. Zhang

arXiv:quant-ph/0311132•The European Physical Journal B•Sep 1, 2004•303 citations

Multi-hop quantum teleportation via general distinct EPR pairs and its application in quantum network

Zongyi Li, Min Jiang

Quantum teleportation (QT) provides a useful way to securely transfer unknown quantum state between distant nodes without physically sending the states themselves. In this paper, we present a teleportation scheme of the most general hybrid multi-qudit state via EPR pairs with different dimensions in the chain network. In this structure, the EPR channels shared between neighbor nodes could be distinct, which means that the shared EPR pairs could be different in dimension and the parameters with each other, demonstrating a universality scenario in realistic transmission. In addition, we discuss the condition that can ensure the integrity of the transmitted information with available channel resource, and our scheme could provide a method to solve the resemble problem in the construction of future quantum network.

International Conference on Electronics and Communication, Network and Computer Technology (ECNCT)•Aug 18, 2023•1 citation

How to securely perform computations on secret-shared data

Dan Bogdanov

•May 22, 2007•5 citations

Non-Interactive Quantum Statistical and Perfect Zero-Knowledge

Hirotada Kobayashi

This paper introduces quantum analogues of non-interactive perfect and statistical zero-knowledge proof systems. Similar to the classical cases, it is shown that sharing randomness or entanglement is necessary for non-trivial protocols of non-interactive quantum perfect and statistical zero-knowledge. It is also shown that, with sharing EPR pairs a priori, the class of languages having one-sided bounded error non-interactive quantum perfect zero-knowledge proof systems has a natural complete problem. Non-triviality of such a proof system is based on the fact proved in this paper that the Graph Non-Automorphism problem, which is not known in BQP, can be reduced to our complete problem. Our results may be the first non-trivial quantum zero-knowledge proofs secure even against dishonest quantum verifiers, since our protocols are non-interactive, and thus the zero-knowledge property does not depend on whether the verifier in the protocol is honest or not. A restricted version of our complete problem derives a natural complete problem for BQP.

arXiv:quant-ph/0207158•Jul 29, 2002•3 citations

An Introduction to Silent Secure Computation

Geoffroy Couteau

SpringerBriefs in information security and cryptography•Jan 1, 2026•0 citations

Secure Computation: A Primer

Geoffroy Couteau

SpringerBriefs in information security and cryptography•Jan 1, 2026•0 citations
Quantum teleportation (QT) provides a useful way to securely transfer unknown quantum state between distant nodes without physically sending the states themselves. In this paper, we present a teleportation scheme of the most general hybrid multi-qudit state via EPR pairs with different dimensions in the chain network. In this structure, the EPR channels shared between neighbor nodes could be distinct, which means that the shared EPR pairs could be different in dimension and the parameters with each other, demonstrating a universality scenario in realistic transmission. In addition, we discuss the condition that can ensure the integrity of the transmitted information with available channel resource, and our scheme could provide a method to solve the resemble problem in the construction of future quantum network.
This paper introduces quantum analogues of non-interactive perfect and statistical zero-knowledge proof systems. Similar to the classical cases, it is shown that sharing randomness or entanglement is necessary for non-trivial protocols of non-interactive quantum perfect and statistical zero-knowledge. It is also shown that, with sharing EPR pairs a priori, the class of languages having one-sided bounded error non-interactive quantum perfect zero-knowledge proof systems has a natural complete problem. Non-triviality of such a proof system is based on the fact proved in this paper that the Graph Non-Automorphism problem, which is not known in BQP, can be reduced to our complete problem. Our results may be the first non-trivial quantum zero-knowledge proofs secure even against dishonest quantum verifiers, since our protocols are non-interactive, and thus the zero-knowledge property does not depend on whether the verifier in the protocol is honest or not. A restricted version of our complete problem derives a natural complete problem for BQP.