Quantum security computation on shared secrets

DOI10.1007/S10773-018-3905-1MaRDI QIDQ1740928zbMATH OpenOpenAlexFDO

Authors Hai-Yan Bai, Zhihui Li, Na Hao

Publication date 3 May 2019

Published in International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1804.03792

zbMATH Keywords

quantum circuitquantum computationunitary matrixsecret sharing scheme

Mathematics Subject Classification ID

Cryptography (94A60) Quantum computation (81P68) Quantum coding (general) (81P70) Quantum cryptography (quantum-theoretic aspects) (81P94)

Abstract: Ouyang et al. proposed an $(n,n)$ threshold quantum secret sharing scheme, where the number of participants is limited to $n=4k+1,kin{Z}^{+}$, and the security evaluation of the scheme was carried out accordingly. In this paper, we propose an $(n,n)$ threshold quantum secret sharing scheme for the number of participants $n$ in any case ( $nin{Z}^{+}$ ). The scheme is based on a quantum circuit, which consists of Clifford group gates and Toffoli gate. We study the properties of the quantum circuit in this paper and use the quantum circuit to analyze the security of the scheme for dishonest participants.

Recommendations

• Computing on quantum shared secrets for general quantum access structures
• Quantum secret sharing
• Computational Security of Quantum Encryption
• Secure multi-party computation with a quantum manner
• Secure assisted quantum computation
• Quantum computational cryptography
• Efficient quantum secret sharing
• Secure quantum computation with classical communication
• scientific article
• Secrecy, computational loads and rates in practical quantum cryptography

Cites work

• A generalized information theoretical model for quantum secret sharing
• A new improving quantum secret sharing scheme
• An efficient quantum secret sharing scheme with Einstein-Podolsky-Rosen pairs
• Demonstration of Blind Quantum Computing
• Graph states for quantum secret sharing
• Quantum cryptography based on Bell’s theorem
• Quantum secret sharing
• Quantum secret sharing using orthogonal multiqudit entangled states
• Quantum secret sharing using the d-dimensional GHZ state
• Secure multi-party quantum computation
• Universal Blind Quantum Computation
• Universality in quantum computation

Cited in

(15)

• A verifiable \((k, n)\)-threshold dynamic quantum secret sharing scheme
• Computational Security of Quantum Encryption
• Sharing a quantum secret without a trusted party
• On the round complexity of secure quantum computation
• A quantum evolving secret sharing scheme
• Security of a kind of quantum secret sharing with single photons
• Quantum strongly secure ramp secret sharing
• Threshold secret sharing scheme based on quantum circuit
• Secure two-party computation in a quantum world
• Quantum Secret Sharing with Error Correction
• Security limitations of classical-client delegated quantum computing
• Computing on quantum shared secrets for general quantum access structures
• General secret sharing based on quantum Fourier transform
• Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts
• scientific article; zbMATH DE number 5666681 (Why is no real title available?)

This page was built for publication: Quantum security computation on shared secrets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1740928)