Secure multi-party convex hull protocol based on quantum homomorphic encryption
From MaRDI portal
Publication:2686164
DOI10.1007/s11128-022-03779-0OpenAlexW4311780075WikidataQ121912669 ScholiaQ121912669MaRDI QIDQ2686164
Publication date: 24 February 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-022-03779-0
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Triangle-free geometric intersection graphs with large chromatic number
- Quantum fully homomorphic encryption scheme based on universal quantum circuit
- Cryptanalysis and improvement of the novel quantum scheme for secure two-party distance computation
- Largest and smallest convex hulls for imprecise points
- Derivatives of generalized distance functions and existence of generalized nearest points
- A novel quantum scheme for secure two-party distance computation
- A novel quantum solution to secure two-party distance computation
- A novel fault-tolerant quantum divider and its simulation
- Computing convex hulls and counting integer points with \texttt{polymake}
- Privacy-preserving point-inclusion protocol for an arbitrary area based on phase-encoded quantum private query
- Identity-Based Encryption from the Weil Pairing
This page was built for publication: Secure multi-party convex hull protocol based on quantum homomorphic encryption