Secure multi-party quantum computation
From MaRDI portal
Cited in
(45)- Secure two-party integer comparison protocol without any third party
- Comment on ``Efficient and feasible quantum private comparison of equality against the collective amplitude damping noise
- A short review on quantum identity authentication protocols: how would Bob know that he is talking with Alice?
- One-way functions imply secure computation in a quantum world
- Oblivious transfer from zero-knowledge proofs. Or how to achieve round-optimal quantum oblivious transfer and zero-knowledge proofs on quantum states
- Post-quantum multi-party computation
- Secure multi-party quantum computation with a dishonest majority
- Secure three-party semi-quantum summation using single photons
- A \((k, n)\)-threshold dynamic quantum secure multiparty multiplication protocol
- Sharing a quantum secret without a trusted party
- Multi-dimensional quantum state sharing based on quantum Fourier transform
- Quantum security computation on shared secrets
- On the round complexity of secure quantum computation
- Round efficient secure multiparty quantum computation with identifiable abort
- A (t, n) threshold quantum secret sharing with authentication based on single photons
- Quantum summation using \(d\)-level entanglement swapping
- A new multi-party quantum private comparison protocol based on circle model
- Improvements on: ``Secure multi-party quantum summation based on quantum Fourier transform
- Quantum secure multi-party summation protocol based on blind matrix and quantum Fourier transform
- Quantum privacy and Schur product channels
- Two-party quantum private comparison protocol with maximally entangled seven-qubit state
- An efficient protocol for the secure multi-party quantum summation
- Improvements on: ``Multi-party quantum key agreement protocol with Bell states and single particles
- Secure quantum computation with classical communication
- Secure multi-party computation with a quantum manner
- Self-testing of a single quantum device under computational assumptions
- A feasible semi-quantum private comparison based on entanglement swapping of Bell states
- Private algebras in quantum information and infinite-dimensional complementarity
- Quantum private comparison with a malicious third party
- Quantum multiparty cryptosystems based on a homomorphic random basis encryption
- Quantum teleportation in the commuting operator framework
- A verifiable \((k,n)\)-threshold quantum secure multiparty summation protocol
- Constant-round blind classical verification of quantum sampling
- Oblivious transfer is in MiniQCrypt
- Comment on quantum private comparison protocols with a semi-honest third party
- Multi-party quantum summation with a single \(d\)-level quantum system
- Best-of-both-worlds multiparty quantum computation with publicly verifiable identifiable abort
- Secret sharing based on quantum Fourier transform
- Multiparty quantum computation for summation and multiplication with mutually unbiased bases
- Obfuscation of pseudo-deterministic quantum circuits
- Multi-party quantum private information comparison based on nonlocal orthogonal product states
- Quantum solution to a class of two-party private summation problems
- Multi-party quantum summation without a trusted third party based on single particles
- Classical leakage resilience from fault-tolerant quantum computation
- A protocol for the secure two-party quantum scalar product
This page was built for publication: Secure multi-party quantum computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579191)
