Computational geometry based on quantum secure multi-party summation and multiplication
From MaRDI portal
Cites work
- A \((k, n)\)-threshold dynamic quantum secure multiparty multiplication protocol
- A cost-effective quantum protocol for secure multi-party multiplication
- A method for obtaining digital signatures and public-key cryptosystems
- A novel quantum scheme for secure two-party distance computation
- A novel quantum solution to secure two-party distance computation
- A public key cryptosystem and a signature scheme based on discrete logarithms
- An novel protocol for the quantum secure multi-party summation based on two-particle Bell states
- Cryptanalysis and improvement of the novel quantum scheme for secure two-party distance computation
- Dynamic quantum secret sharing by using d-dimensional GHZ state
- High-capacity quantum summation with single photons in both polarization and spatial-mode degrees of freedom
- Multi-party quantum summation within a \(d\)-level quantum system
- Multi-party quantum summation without a third party based on \(d\)-dimensional Bell states
- Multiparty quantum computation for summation and multiplication with mutually unbiased bases
- New directions in cryptography
- Quantum cryptography: public key distribution and coin tossing
- Quantum private comparison against decoherence noise
- Quantum protocols for secure multi-party summation
- Quantum summation with an application to integration.
- Secure multi-party quantum summation based on quantum Fourier transform
This page was built for publication: Computational geometry based on quantum secure multi-party summation and multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6915555)