Related papers: Computing on quantum shared secrets
This paper introduces the Symmetric Extensible Quantum Secret Sharing protocol, which is a novel quantum protocol for secret sharing. At its heart, it is an entanglement based protocol that relies on the use of maximally entangled GHZ…
In this paper, we present a quantum secure multi-party summation protocol, which allows multiple mutually distrustful parties to securely compute the summation of their secret data. In the presented protocol, a semitrusted third party is…
Quantum computers can solve specific complex tasks for which no reasonable-time classical algorithm is known. Quantum computers do however also offer inherent security of data, as measurements destroy quantum states. Using shared entangled…
Secret sharing schemes create an effective method to safeguard a secret by dividing it among several participants. By using hash functions and the herding hashes technique, we first set up a (t+1, n) threshold scheme which is perfect and…
A critically important component of most signal processing procedures is that of computing the distance between signals. In multi-party processing applications where these signals belong to different parties, this introduces privacy…
This paper presents a recursive hiding scheme for 2 out of 3 secret sharing. In recursive hiding of secrets, the user encodes additional information about smaller secrets in the shares of a larger secret without an expansion in the size of…
In extant quantum secret sharing protocols, once the secret is shared in a quantum network (\textsc{qnet}) it can not be retrieved back, even if the dealer wishes that her secret no longer be available in the network. For instance, if the…
In a recent paper [S. Bagherinezhad and V. Karimipour, Phys. Rev. A 67, 044302 (2003)], a quantum secret sharing protocol based on reusable GHZ states was proposed. However, in this comment, it is shown that this protocol is insecure…
Quantum secret sharing plays an important role in quantum communications and secure multiparty computation. In this paper, we present a new measurement-device-independent quantum secret sharing protocol, which can double the space distance…
Secret sharing allows a user to split a secret into many shares so that the secret can be recovered if, and only if, an authorized set of shares is collected. Although secret sharing typically does not require any computational hardness…
In Chen-Cramer Crypto 2006 paper \cite{cc} algebraic geometric secret sharing schemes were proposed such that the "Fundamental Theorem in Information-Theoretically Secure Multiparty Computation" by Ben-Or, Goldwasser and Wigderson…
We present a simple new technique to secure quantum key distribution relay networks using secret sharing. Previous techniques have relied on creating distinct physical paths in order to create the shares. We show, however, how this can be…
This paper introduces a completely new approach to encryption based on group theoretic quantum framework. Quantum cryptography has essentially focused only on key distribution and proceeded with classical encryption algorithm with the…
In quantum cryptography, the level of security attainable by a protocol which implements a particular task $N$ times bears no simple relation to the level of security attainable by a protocol implementing the task once. Useful partial…
Quantum homomorphic encryption integrates quantum computing with homomorphic encryption, which allows calculations to be performed directly on encrypted data without decryption on the server side. In this paper, we explore distributed…
Quantum information scrambling has emerged as a powerful tool for studying the dynamics of chaotic quantum many-body systems, assessing benchmarking protocols, and even investigating exotic black hole models. During quantum information…
Quantum homomorphic encryption (QHE) is an encryption method that allows quantum computation to be performed on one party's private data with the program provided by another party, without revealing much information about the data nor about…
Recently, Yang et al. (Quantum Inf Process:17:129, 2018) proposed a secure multi-party quantum summation protocol allowing the involved participants to sum their secrets privately. They claimed that the proposed protocol can prevent each…
We present two schemes for multiparty quantum remote secret conference in which each legitimate conferee can read out securely the secret message announced by another one, but a vicious eavesdropper can get nothing about it. The first one…
We introduce and analyse approximate quantum secret sharing in a formal cryptographic setting, wherein a dealer encodes and distributes a quantum secret to players such that authorized structures (sets of subsets of players) can…