Enhanced (t, n) threshold d-level quantum secret sharing
hari omScientific Reports
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
The quantum secret sharing is an essential and fundamental technique for sharing a secret with the all participants in quantum cryptography. It can be used to design many complex protocols such as secure multiparty summation, multiplication, sorting, voting, etc. Recently, Song et al. have discussed a quantum protocol for secret sharing, which has (t, n) threshold approach and modulo d, where t and n denote the threshold number of participants and total number of participants, respectively. Kao et al. point out that the secret in the Song et al.’s protocol cannot be reconstructed without other participants’ information. In this paper, we discuss a protocol that overcomes this problem.
Related papers
Multiparty weighted threshold quantum secret sharing based on the Chinese remainder theorem to share quantum information
Scientific Reports, 2021
Secret sharing is a widely-used security protocol and cryptographic primitive in which all people cooperate to restore encrypted information. The characteristics of a quantum field guarantee the security of information; therefore, many researchers are interested in quantum cryptography and quantum secret sharing (QSS) is an important research topic. However, most traditional QSS methods are complex and difficult to implement. In addition, most traditional QSS schemes share classical information, not quantum information which makes them inefficient to transfer and share information. In a weighted threshold QSS method, each participant has each own weight, but assigning weights usually costs multiple quantum states. Quantum state consumption will therefore increase with the weight. It is inefficient and difficult, and therefore not able to successfully build a suitable agreement. The proposed method is the first attempt to build multiparty weighted threshold QSS method using single qu...
Efficient quantum secret sharing without a trusted player
Quantum Information Processing, 2020
Quantum secret sharing (QSS) is a fundamental primitive in quantum cryptography. The complex and secure multiparty quantum protocols can be built using QSS. The existing QSS protocols are either (n, n) threshold 2-level or (t, n) threshold d-level with a trusted player, where n denotes the number of players and t denotes the threshold number of players. Here, we propose a secure d-level QSS protocol for sharing a secret, where t players can reconstruct the secret without a trusted player. This protocol is more secure, flexible, and practical as compared to the existing QSS protocols: (n, n) threshold 2-level and (t, n) threshold d-level with a trusted player. Further, it does not disclose any information about the secret to players. Its security analysis shows that the intercept-resend, intercept, entangle-measure, forgery, collision and collusion attacks are not possible in this protocol.
Three-party d-level quantum secret sharing protocol
Journal of Physics A-mathematical and Theoretical, 2008
We develop a three-party quantum secret sharing protocol based on arbitrary dimensional quantum states. In contrast to the previous quantum secret sharing protocols, the sender can always control the state, just using local operations, for adjusting the correlation of measurement directions of three parties and thus there is no waste of resource due to the discord between the directions. Moreover, our protocol contains the hidden value which enables the sender to leak no information of secret key to the dishonest receiver until the last steps of the procedure.
An Efficient Simulation of Quantum Secret Sharing
arXiv (Cornell University), 2021
In quantum cryptography, quantum secret sharing (QSS) is a fundamental primitive. QSS can be used to create complex and secure multiparty quantum protocols. Existing QSS protocols are either at the (n, n) threshold 2 level or at the (t, n) threshold d level with a trusted player, where n denotes the number of players and t denotes the threshold number of players. Here, we propose a secure d-level QSS protocol for sharing a secret with efficient simulation. This protocol is more secure, flexible, and practical as compared to the existing QSS protocols: (n, n) threshold 2-level and (t, n) threshold d-level with a trusted player. Further, it does not disclose any information about the secret to players. Its security analysis shows that the intercept-resend, intercept, entangle-measure, forgery, collision and collusion attacks are not possible in this protocol.
Threshold quantum cryptography
Physical Review A, 2005
We present the concept of threshold collaborative unitary transformation or threshold quantum cryptography, which is a kind of quantum version of threshold cryptography. Threshold quantum cryptography states that classical shared secrets are distributed to several parties and a subset of them, whose number is greater than a threshold, collaborates to compute a quantum cryptographic function, while keeping each share secretly inside each party. The shared secrets are reusable if no cheating is detected. As a concrete example of this concept, we show a distributed protocol ͑with threshold͒ of conjugate coding.
Secure multiparty quantum computation based on Lagrange unitary operator
Scientific Reports, 2020
As an important subtopic of classical cryptography, secure multiparty quantum computation allows multiple parties to jointly compute their private inputs without revealing them. Most existing secure multiparty computation protocols have the shortcomings of low computational efficiency and high resource consumption. To remedy these shortcomings, we propose a secure multiparty quantum computation protocol by using the Lagrange unitary operator and the Shamir (t, n) threshold secret sharing, in which the server generates all secret shares and distributes each secret share to the corresponding participant, in addition, he prepares a particle and sends it to the first participant. The first participant performs the Lagrange unitary operation on the received particle, and then sends the transformed particle to the next participant. Until the last participant’s computation task is completed, the transformed particle is sent back to the server. The server performs Lagrange unitary operation...
Secure multiparty quantum computation with (only) a strict honest majority
2006
Secret sharing and multiparty computation (also called "secure function evaluation") are fundamental primitives in modern cryptography, allowing a group of mutually distrustful players to perform correct, distributed computations under the sole assumption that some number of them will follow the protocol honestly. This paper investigates how much trust is necessary-that is, how many players must remain honest-in order for distributed quantum computations to be possible. We present a verifiable quantum secret sharing (VQSS) protocol, and a general secure multiparty quantum computation (MPQC) protocol, which can tolerate any n−1 2 cheaters among n players. Previous protocols for these tasks tolerated n−1 4 and n−1 6 cheaters, respectively. The threshold we achieve is tight-even in the classical case, "fair" multiparty computation is not possible if any set of n/2 players can cheat. Our protocols rely on approximate quantum errorcorrecting codes, which can tolerate a larger fraction of errors than traditional, exact codes. We introduce new families of authentication schemes and approximate codes tailored to the needs of our protocols, as well as new state purification techniques along the lines of those used in faulttolerant quantum circuits.
A Resilient Quantum Secret Sharing Scheme
International Journal of Theoretical Physics, 2014
A resilient secret sharing scheme is supposed to generate the secret correctly even after some shares are damaged. In this paper, we show how quantum error correcting codes can be exploited to design a resilient quantum secret sharing scheme, where a quantum state is shared among more than one parties.
Experimental quantum secret sharing
Fortschritte der Physik, 2006
We consider two simple and practical protocols for multiparty communication and show their experimental realization. These protocols deal with the task of secret sharing in which a secret message is split among several parties in a way that its reconstruction requires their mutual collaboration. In the presented schemes the parties solve the problem by two different approaches: The first uses as a resource the multiqubit entangled state | Ψ − 4. As no interferometric setups are required here, contrary to known schemes, involving Greenberger-Horne-Zeilinger states, its implementation is simpler and more stable. In the second scheme only sequential transformations on a single qubit are used. This further tremendously simplifies the method, makes it scalable with regard to the number of participating partners and above all, technologically comparable to quantum key distribution.
Proposal for quantum rational secret sharing
Physical Review A, 2015
A rational secret sharing scheme is a game in which each party responsible for reconstructing a secret tries to maximize his utility by obtaining the secret alone. Quantum secret sharing schemes, either derived from quantum teleportation or from quantum error correcting code, do not succeed when we assume rational participants. This is because all existing quantum secret sharing schemes consider that the secret is reconstructed by a party chosen by the dealer. In this paper, for the first time, we propose a quantum secret sharing scheme which is resistant to rational parties. The proposed scheme is fair (everyone gets the secret), correct and achieves strict Nash equilibrium.
Related papers
Hybrid Quantum Protocols for Secure Multiparty Summation and Multiplication
Scientific Reports
The summation and multiplication are two basic operations for secure multiparty quantum computation. The existing secure multiparty quantum summation and multiplication protocols have (n, n) threshold approach and their computation type is bit-by-bit, where n is total number of players. In this paper, we propose two hybrid (t, n) threshold quantum protocols for secure multiparty summation and multiplication based on the Shamir’s secret sharing, SUM gate, quantum fourier transform, and generalized Pauli operator, where t is a threshold number of players that can perform the summation and multiplication. Their computation type is secret-by-secret with modulo d, where d, n ≤ d ≤ 2n, is a prime. The proposed protocols can resist the intercept-resend, entangle-measure, collusion, collective, and coherent quantum attacks. They have better computation as well as communication costs and no player can get other player’s private input.
Improving quantum secret-sharing schemes
Physical Review A, 2001
We propose a protocol that enables a dealer to share a quantum secret with n players using less than n quantum shares for several access structures. For threshold schemes we derived an expression that shows how many quantum shares can be saved in this scheme. Also, several features that are available for classical secret-sharing schemes ͑and previously not known to be possible for quantum secret-sharing͒ become available with this protocol.
Quantum cryptography and secret sharing
Quantum mechanics has proved to be a practical and secure way for communication between subjects.Understanding generalised quantum measurements are required for devising cryptography and secret sharing technics hence first part of this report deals with generalised measurement.We explore some of the early protocols for quantum cryptography and developments in quantum secret sharing. Retrieving quantum information is important for development of quantum networks, this is dealt with, in the last part of the report.
Threshold quantum secret sharing between multiparty and multiparty using Greenberger–Horne–Zeilinger state
Quantum Information Processing, 2013
We propose a (t, m) -(s, n) threshold quantum secret sharing protocol between multiparty (m members in group 1) and multiparty (n members in group 2) using a sequence of Greenberger-Horne-Zeilinger (GHZ) states, which is useful and efficient when the parties of communication are not all present. In the protocol, Alice prepares a sequence of GHZ states in one of the eight different states and sends the last two particles to the first agent while other members encode their information on the sequence via unitary transformations. Finally the last member in group 2 measures the qubits. It is shown that this scheme is safe.
A novel and efficient multiparty quantum secret sharing scheme using entangled states
Science China Physics, Mechanics and Astronomy, 2012
We proposed a novel and efficient multiparty quantum secret sharing scheme using entangled state which in that the number of parties can be arbitrary large. The state which we used, has special properties that make our scheme simple and safe. The operations which are needed to recover secret message, are only exclusive-or addition and complement operation. Moreover it is shown that this scheme is secure against eavesdropping. Also this scheme provides the best quantum bit efficiency compared with some famous quantum secret sharing schemes.
An efficient simulation for quantum secure multiparty computation
Scientific Reports, 2021
The quantum secure multiparty computation is one of the important properties of secure quantum communication. In this paper, we propose a quantum secure multiparty summation (QSMS) protocol based on (t, n) threshold approach, which can be used in many complex quantum operations. To make this protocol secure and realistic, we combine both the classical and quantum phenomena. The existing protocols have some security and efficiency issues because they use (n, n) threshold approach, where all the honest players need to perform the quantum multiparty summation protocol. We however use a (t, n) threshold approach, where onlythonest players need to compute the quantum summation protocol. Compared to other protocols our proposed protocol is more cost-effective, realistic, and secure. We also simulate it using the IBM corporation’s online quantum computer, or quantum experience.
Assisted Quantum Secret Sharing
Computing Research Repository - CORR, 2004
A restriction on quantum secret sharing (QSS) that comes from the no-cloning theorem is that any pair of authorized sets in an access structure should overlap. From the viewpoint of application, this places an unnatural constraint on secret sharing. We present a generalization, called assisted QSS (AQSS), where access structures without pairwise overlap of authorized sets is permissible, provided some shares are withheld by the share dealer. We show that no more than λ − 1 withheld shares are required, where λ is the minimum number of partially linked classes among the authorized sets for the QSS. This is useful in QSS schemes where the share dealer is honest by definition and is equivalent to a secret reconstructor. Our result means that such applications of QSS need not be thwarted by the no-cloning theorem.
Quantum secret-sharing protocol based on Grover’s algorithm
Physical Review A, 2003
A marked state can be found with certainty in the two-qubit case of Grover's algorithm. This property is included in the proposed quantum secret-sharing protocol. In the proposed scheme, the sender prepares some initial state in private and then performs a phase shift of the marked state as the sender's bit. Then, the sender sends these two qubits to each of the two receivers. Only when the sender broadcasts the initially prepared state and then the receivers perform the corresponding inversion operation about the average, is the sender's bit faithfully revealed. Moreover, the sender can detect deception using cheat-detecting states. The proposed quantum secret-sharing protocol is shown to be secure.
Secure multi-party quantum computation
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02, 2002
Secure multi-party computing, also called secure function evaluation, has been extensively studied in classical cryptography. We consider the extension of this task to computation with quantum inputs and circuits. Our protocols are information-theoretically secure, i.e. no assumptions are made on the computational power of the adversary. For the weaker task of verifiable quantum secret sharing, we give a protocol which tolerates any t < n/4 cheating parties (out of n). This is shown to be optimal. We use this new tool to show how to perform any multi-party quantum computation as long as the number of dishonest players is less than n/6.
Single Qubit Quantum Secret Sharing
2005
We present a simple and practical protocol for the solution of a secure multiparty communication task, the secret sharing, and its experimental realization. In this protocol, a secret message is split among several parties in a way that its reconstruction require the collaboration of the participating parties. In the proposed scheme the parties solve the problem by a sequential communication of a single qubit. Moreover we show that our scheme is equivalent to the use of a multiparty entangled GHZ state but easier to realize and better scalable in practical applications.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.