A \((k, n)\)-threshold dynamic quantum secure multiparty multiplication protocol
From MaRDI portal
Publication:2111023
DOI10.1007/s11128-022-03743-yOpenAlexW4309938145MaRDI QIDQ2111023
Publication date: 23 December 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-022-03743-y
dynamicsecuritymutually unbiased basesquantum secure multiparty multiplicationShamir's threshold scheme
Cites Work
- Unnamed Item
- Quantum private comparison against decoherence noise
- Joint remote control of an arbitrary single-qubit state by using a multiparticle entangled state as the quantum channel
- Secure multi-party quantum computation with a dishonest majority
- A cost-effective quantum protocol for secure multi-party multiplication
- A verifiable \((k, n)\)-threshold dynamic quantum secret sharing scheme
- Cheating identifiable \((k, n)\) threshold quantum secret sharing scheme
- Multiparty quantum computation for summation and multiplication with mutually unbiased bases
- Dynamic quantum secret sharing by using \(d\)-dimensional GHZ state
- Joint remote preparation of single-photon three-qubit state with hyperentangled state via linear-optical elements
- A novel dynamic quantum secret sharing in high-dimensional quantum system
- Quantum secure multi-party summation protocol based on blind matrix and quantum Fourier transform
- How to share a secret
- Secure multi-party quantum computation
- Quantum cryptography based on Bell’s theorem
- Quantum cryptography without Bell’s theorem
- Atomic Secure Multi-party Multiplication with Low Communication
