Two quantum protocols for secure Hamming distance computation
From MaRDI portal
Recommendations
- A novel quantum solution to secure two-party distance computation
- Quantum protocol for privacy preserving Hamming distance problem of DNA sequences
- Quantum secure two-party Euclidean distance computation based on mutually unbiased bases
- A novel quantum scheme for secure two-party distance computation
- Secure multi-party computation with a quantum manner
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- Quantum cryptography using any two nonorthogonal states
- Quantum cryptography: public key distribution and coin tossing
- Secure computation of functionalities based on Hamming distance and its application to computing document similarity
Cited in
(9)- A novel quantum scheme for secure two-party distance computation
- A novel quantum solution to secure two-party distance computation
- Quantum secure two-party Euclidean distance computation based on mutually unbiased bases
- Quantum protocol for privacy preserving Hamming distance problem of DNA sequences
- Secure computation of functionalities based on Hamming distance and its application to computing document similarity
- Hamming Distance Kernelisation via Topological Quantum Computation
- Enabling privacy-preserving non-interactive computation for Hamming distance
- A novel quantum protocol for secure Hamming distance computation
- Quantum secure Hamming distance computation based on single-particle states
This page was built for publication: Two quantum protocols for secure Hamming distance computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q669868)
