# Securely Computing the Manhattan Distance under the Malicious Model and Its Applications
## 5 The MPC Protocol of Computing Manhattan Distance under the Malicious Model
### Specific Protocol
(2015) [PERSON]; [PERSON]; [PERSON] _Secure Multiparty Computation_; Cambridge University Press: Cambridge, UK, 2015. * [PERSON] et al. (2020) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Telekine: Secure computing with cloud [GPUs]. In Proceedings of the 17 th USENIX Symposium on Networked Systems Design and Implementation (NSDI 2020), Santa Clara, CA, USA, 25-27 February 2020. * [PERSON] et al. (2020) [PERSON]; [PERSON]; [PERSON]; [PERSON] Secure computing resource allocation framework for open fog computing. _Comput. J._**2020**, _63_, 567-592. [CrossRef]
* [PERSON] et al. (2020) [PERSON]; [PERSON]; [PERSON]; [PERSON] An efficient aggregation scheme resisting on malicious data mining attacks for smart grid. _Inf. Sci._**2020**, _526_, 289-300. [CrossRef]
* [PERSON] et al. (2021) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Privacy-preserving data aggregation against malicious data mining attack for IoT-enabled smart grid. _ACM Trans. Sens. Netw._**2021**, \(3\), 1-25. [CrossRef]
* [PERSON] et al. (2021) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] [PERSON] Performance analysis of scientific computing workloads on general purpose TEEs. In Proceedings of the 35 th IEEE International Parallel & Distributed Processing Symposium (IPDPS), Portland, OR, USA, 17-21 May 2021. * [PERSON] and [PERSON] (2019) [PERSON]; [PERSON] Experimental analysis and comparative study of secure data outsourcing schemes in cloud. _Int. J. Cloud Comput._**2019**, \(1\), 83-101. [CrossRef]
* [PERSON] et al. (2020) [PERSON]; [PERSON]; [PERSON]; [PERSON] Using deep learning to preserve data confidentiality. _Appl Intell_**2020**, _50_, 341-353. [CrossRef]
* [PERSON] et al. (2022) [PERSON]; [PERSON]; [PERSON] Privacy preserving string matching. _J. Cryptologic Res._**2022**, \(9\), 619-632. [CrossRef]
* [PERSON] et al. (2020) [PERSON]; [PERSON]; [PERSON]; [PERSON] Secure remote anonymous user authentication scheme for smart home environment. _IoT_**2020**, \(9\), 100158. [CrossRef]
* [PERSON] et al. (2021) [PERSON]; [PERSON]; [PERSON] Secure Maximum (Minimum) Computation in Malicious Model. _Chin. J. Comput._**2021**, _44_, 2076-2089. * [PERSON] et al. (2022) [PERSON]; [PERSON]; [PERSON] Secure Judgment of Point and Line Relationship Against Malicious Adversaries and Its Applications. _J. Internet Technol._**2022**, _23_, 1019-1027. * [PERSON] et al. (2022) [PERSON]; [PERSON]; [PERSON] Securely determine the inclusion relation of a point and a convex polygon in malicious model. _J. Cryptologic Res._**2022**, \(9\), 524-534. [CrossRef]
* [PERSON] et al. (2022) [PERSON]; [PERSON]; [PERSON] Fast privacy-preserving text classification based on secure multiparty computation. _IEEE Trans. Inf. Forensics Secur._**2022**, _17_, 428-442. [CrossRef]
* [PERSON] et al. (2020) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] AI at the edge: Blockchain-empowered secure multiparty learning with heterogeneous models. _IEEE Internet Things J._**2020**, _10_, 9600-9610. [CrossRef]
* [PERSON] et al. (2021) [PERSON]; [PERSON]; [PERSON] An efficient approach for privacy preserving decentralized deep learning models based on secure multi-party computation. _Neurocomputing_**2021**, _422_, 245-262. [CrossRef]
* [PERSON] and [PERSON] (2021) [PERSON]; [PERSON] Low-bandwidth recovery of linear functions of Reed-Solomon-encoded data. _arXiv_**2021**, arXiv:2107.11847. [CrossRef]* [PERSON] et al. (2021) [PERSON]; [PERSON]; [PERSON]; [PERSON] On the download rate of homomorphic secret sharing. _arXiv_**2021**, arXiv:2111.10126. [CrossRef]
* [PERSON] and [PERSON] (2021) [PERSON]; [PERSON] Large message homomorphic secret sharing from DCR and applications. In Proceedings of the 41 st Annual International Cryptology Conference (CRYPTO 2021), Virtual Event, 16-20 August 2021. [CrossRef]
* [PERSON] and [PERSON] (2001) [PERSON]; [PERSON] Efficient oblivious transfer protocols. In Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (SODA '01), Washington, DC, USA, 7-9 January 2001.