Secure multi-party quantum computation
From MaRDI portal
Publication:3579191
DOI10.1145/509907.510000zbMath1192.94115OpenAlexW2136195941MaRDI QIDQ3579191
No author found.
Publication date: 5 August 2010
Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/509907.510000
Related Items
On the round complexity of secure quantum computation ⋮ Round efficient secure multiparty quantum computation with identifiable abort ⋮ One-way functions imply secure computation in a quantum world ⋮ Secret sharing based on quantum Fourier transform ⋮ Constant-round blind classical verification of quantum sampling ⋮ An efficient protocol for the secure multi-party quantum summation ⋮ Quantum teleportation in the commuting operator framework ⋮ Improvements on: ``Multi-party quantum key agreement protocol with Bell states and single particles ⋮ Improvements on: ``Secure multi-party quantum summation based on quantum Fourier transform ⋮ Multi-party quantum private information comparison based on nonlocal orthogonal product states ⋮ Quantum multiparty cryptosystems based on a homomorphic random basis encryption ⋮ A verifiable \((k,n)\)-threshold quantum secure multiparty summation protocol ⋮ A feasible semi-quantum private comparison based on entanglement swapping of Bell states ⋮ Quantum summation using \(d\)-level entanglement swapping ⋮ Quantum secure multi-party summation protocol based on blind matrix and quantum Fourier transform ⋮ Sharing a quantum secret without a trusted party ⋮ Quantum solution to a class of two-party private summation problems ⋮ A protocol for the secure two-party quantum scalar product ⋮ Secure quantum computation with classical communication ⋮ Comment on quantum private comparison protocols with a semi-honest third party ⋮ Multi-party quantum summation without a trusted third party based on single particles ⋮ Quantum security computation on shared secrets ⋮ Secure three-party semi-quantum summation using single photons ⋮ Multi-dimensional quantum state sharing based on quantum Fourier transform ⋮ Quantum privacy and Schur product channels ⋮ Classical leakage resilience from fault-tolerant quantum computation ⋮ A new multi-party quantum private comparison protocol based on circle model ⋮ Private algebras in quantum information and infinite-dimensional complementarity ⋮ Two-party quantum private comparison protocol with maximally entangled seven-qubit state ⋮ Secure multi-party quantum computation with a dishonest majority ⋮ Post-quantum multi-party computation ⋮ Oblivious transfer is in MiniQCrypt ⋮ Multiparty quantum computation for summation and multiplication with mutually unbiased bases ⋮ Multi-party quantum summation with a single d-level quantum system ⋮ Secure two-party integer comparison protocol without any third party ⋮ A short review on quantum identity authentication protocols: how would Bob know that he is talking with Alice? ⋮ A \((k, n)\)-threshold dynamic quantum secure multiparty multiplication protocol ⋮ Comment on ``Efficient and feasible quantum private comparison of equality against the collective amplitude damping noise ⋮ Secure multi-party computation with a quantum manner ⋮ Quantum private comparison with a malicious third party
This page was built for publication: Secure multi-party quantum computation
