Secure two-party computation via measurement-based quantum computing
From MaRDI portal
Recommendations
- Secure multi-party computation with a quantum manner
- Robust quantum secure multiparty computation protocols for minimum value calculation in collective noises and their simulation
- Quantum secure multi-party summation protocol based on blind matrix and quantum Fourier transform
- Secret sharing based multiparty quantum computation for multiplication
- A novel quantum protocol for secure Hamming distance computation
Cites work
- Cryptanalysis of secure multiparty quantum summation
- Finding new multipartite entangled resources for measurement-based quantum computation
- Implausible consequences of superstrong nonlocality
- Improved secure multiparty computation with a dishonest majority via quantum means
- Multiparty Computation from Somewhat Homomorphic Encryption
- Optimizing the decoy-state BB84 QKD protocol parameters
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Quantum computation by measurement and quantum memory
- Quantum cryptography: public key distribution and coin tossing
- Quantum protocols for secure multi-party summation
- Secure multi-party computation with a quantum manner
- Secure multi-party quantum summation based on quantum Fourier transform
- Semi-homomorphic encryption and multiparty computation
- Universal Blind Quantum Computation
Cited in
(3)
This page was built for publication: Secure two-party computation via measurement-based quantum computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566183)
