A (k, n)-threshold dynamic quantum secure multiparty multiplication protocol

DOI10.1007/S11128-022-03743-YMaRDI QIDQ2111023zbMATH OpenOpenAlexFDO

Authors Fulin Li, Hang Hu, Shixin Zhu

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

zbMATH Keywords

dynamicmutually unbiased basessecurityquantum secure multiparty multiplicationShamir's threshold scheme

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• A cost-effective quantum protocol for secure multi-party multiplication
• Multiparty quantum computation for summation and multiplication with mutually unbiased bases
• Quantum secure multiparty summation based on the phase shifting operation of d-level quantum system and its application
• A verifiable \((k, n)\)-threshold dynamic quantum secret sharing scheme
• Cryptanalysis of secure multiparty quantum summation

Cites work

• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• A cost-effective quantum protocol for secure multi-party multiplication
• A novel dynamic quantum secret sharing in high-dimensional quantum system
• A verifiable \((k, n)\)-threshold dynamic quantum secret sharing scheme
• Atomic Secure Multi-party Multiplication with Low Communication
• Cheating identifiable \((k, n)\) threshold quantum secret sharing scheme
• Dynamic quantum secret sharing by using d-dimensional GHZ state
• How to share a secret
• Joint remote control of an arbitrary single-qubit state by using a multiparticle entangled state as the quantum channel
• Joint remote preparation of single-photon three-qubit state with hyperentangled state via linear-optical elements
• Multiparty quantum computation for summation and multiplication with mutually unbiased bases
• Quantum cryptography based on Bell’s theorem
• Quantum cryptography without Bell’s theorem
• Quantum private comparison against decoherence noise
• Quantum secure multi-party summation protocol based on blind matrix and quantum Fourier transform
• Secure multi-party quantum computation
• Secure multi-party quantum computation with a dishonest majority

Cited in

(4)

• Verifiable quantum protocol for dynamic secure multiparty summation based on homomorphic encryption
• Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing
• A verifiable \((k,n)\)-threshold quantum secure multiparty summation protocol
• A cost-effective quantum protocol for secure multi-party multiplication

This page was built for publication: A \((k, n)\)-threshold dynamic quantum secure multiparty multiplication protocol

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