## 4 ROLQ-TEE Scheme
### Detailed Construction
(2019) [PERSON]; [PERSON]; [PERSON] [PERSON], [PERSON] Privacy-Preserving Aggregate Queries for Optimal Location Selection. _IEEE Trans. Dependable Secur. Comput._**2019**, _16_, 329-343. [CrossRef]
* [PERSON] et al. (2023) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] PPOLQ: Privacy-Preserving Optimal Location Query with Multiple-Condition Filter in Outsourced Environments. _IEEE Trans. Serv. Comput._**2023**, _16_, 3564-3577. [CrossRef]
* [PERSON] et al. (2022) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Privacy-Preserving Spatio-Temporal Keyword Search for Outsourced Location-Based Services. _IEEE Trans. Serv. Comput._**2022**, _15_, 3443-3456. [CrossRef]
* [PERSON] et al. (2021) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Toward Oblivious Location-Based k-Nearest Neighbor Query in Smart Cities. _IEEE Internet Things J._**2021**, \(8\), 14219-14231. [CrossRef]
* [PERSON] et al. (2021) [PERSON]; [PERSON]; [PERSON] A Privacy-Preserving Framework for Outsourcing Location-Based Services to the Cloud. _IEEE Trans. Dependable Secur. Comput._**2021**, _18_, 384-399. [CrossRef]
* [PERSON] and [PERSON] (2021) [PERSON]; [PERSON] Practical Privacy-Preserving Indoor Localization Based on Secure Two-Party Computation. _IEEE Trans. Mob. Comput._**2021**, _20_, 2877-2890. [CrossRef]
* [PERSON] et al. (2014) [PERSON]; [PERSON]; [PERSON] FINE: A fine-grained privacy-preserving location-based service framework for mobile devices. In Proceedings of the IEEE INFOCOM 2014--IEEE Conference on Computer Communications, Toronto, ON, Canada, 27 April-2 May 2014; pp. 244-252. * [PERSON] and [PERSON] (2000) [PERSON]; [PERSON] [PERSON] Influence sets based on reverse nearest neighbor queries. _ACM Sigmod Rec._**2000**, _29_, 201-212. [CrossRef]
* [PERSON] et al. (2000) [PERSON]; [PERSON]; [PERSON] Reverse nearest neighbor queries for dynamic databases. In Proceedings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, Dallas, TX, USA, 14 May 2000. * [PERSON] et al. (2006) [PERSON]; [PERSON]; [PERSON] Reverse Nearest Neighbor Search in Metric Spaces. _IEEE Trans. Knowl. Data Eng._**2006**, _18_, 1239-1252. * [PERSON] et al. (2006) [PERSON]; [PERSON]; [PERSON]; [PERSON] Progressive computation of the min-dist optimal-location query. In Proceedings of the 32 nd International Conference on Very Large Data Bases, Seoul, Republic of Korea, 12-15 September 2006; pp. 643-654. * [PERSON] et al. (2014) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Efficient algorithms for optimal location queries in road networks. In Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, Snowbird, UT, USA, 22-27 June 2014; pp. 123-134. * [PERSON] and [PERSON] (2001) [PERSON]; [PERSON] Identity-based encryption from the Weil pairing. In Proceedings of the Annual International Cryptology Conference, Berlin, Germany, 19-23 August 2001; pp. 213-229. * [PERSON] and [PERSON] (1994) [PERSON]; [PERSON] Message recovery for signature schemes based on the discrete logarithm problem. In _Workshop on the Theory and Application of Cryptographic Techniques_; Springer: Berlin/Heidelberg, Germany, 1994; pp. 182-193. * [PERSON] (1994) [PERSON] Cryptographic hash functions. _Eur. Trans. Telecommun._**1994**, \(5\), 431-448. [CrossRef]
* [PERSON] et al. (2021) [PERSON]; [PERSON]; [PERSON] DB-BiLSTM: Euclidean Distance-Based Sensor Data Prediction for IoT Applications. In Proceedings of the 2021 International Conference on Information and Communication Technology Convergence (ICTC), Jeju Island, Republic of Korea, 20-22 October 2021; pp. 814-817. * [PERSON] and [PERSON] (2004) [PERSON]; [PERSON]T. The efficient algorithms for achieving Euclidean distance transformation. _IEEE Trans. Image Process._**2004**, _13_, 1078-1091. [CrossRef] [PubMed]
* [PERSON] et al. (1995) [PERSON]; [PERSON]; [PERSON] Nearest neighbor queries. In Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, San Jose, CA, USA, 22-25 May 1995; pp. 71-79. * [PERSON] et al.