Pith. sign in

REVIEW 1 major objections 2 minor 100 references

Efficient and Privacy-Preserving Distribution Statistics Analytics on Mobile Spatial Data

T0 review · 1 major / 2 minor · reviewed 2026-06-29 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Two non-colluding servers and improved distributed point functions enable the first efficient privacy-preserving system for distribution statistics on mobile spatial data.

desk verdict The paper builds two DPF-based schemes for private spatial stats on mobile data using octree and KD-tree partitioning, but everything rests on non-colluding servers and unstandardized DPF tweaks. read the letter →

arxiv 2605.25791 v3 pith:5WFG2XRJ submitted 2026-05-25 cs.CR

Xuhao Ren , Chuan Zhang , Mingyang Zhao , Meng Li , Liehuang Zhu , Bin Xiao This is my paper · ORCID
classification cs.CR
keywords privacy-preservinganalyticsmobilespatialdatadistributionstatisticsdistributedpointfunctionsoctreepartitioningKD-treesecurecomputationtrajectory
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper establishes a system for performing distribution statistics on continuously generated mobile spatial data without centralizing sensitive location information. It introduces eSpat-B, which splits work across two non-colluding servers using an improved version of distributed point functions combined with octree partitioning. To handle frequent data updates, it adds eSpat+, which switches to K-Dimensional tree partitioning and incremental distributed point functions together with an efficient update algorithm. Security arguments show that individual data points remain hidden throughout the process. Experiments on real trajectory datasets report up to 1.2 times lower computation cost and up to 20 times lower communication cost while producing exactly the same statistical results as the non-private baseline.

What carries the argument

Improved distributed point functions (DPF) with octree partitioning for eSpat-B and K-Dimensional tree partitioning with incremental DPF plus update algorithm for eSpat+.

What would settle it

A demonstration that the two servers can collude to recover individual user locations or that the DPF construction leaks information would falsify the privacy protection claim.

Watch

Extended reading notes

Core claim

We design, implement, and evaluate the first system that supports efficient and privacy-preserving distribution statistics analysis for mobile spatial data. First, we propose eSpat-B, which leverages two non-colluding servers and a newly designed improved distributed point functions (DPF) with octree partitioning. Furthermore, considering the frequent updates of spatial data, we propose another more efficient scheme, eSpat+. The core idea of this scheme is to utilize a K-Dimensional tree for spatial partitioning, combine it with incremental DPF for performing statistics analysis, and design an efficient update algorithm. Security analysis demonstrates that our schemes effectively protect dat

Load-bearing premise

The two servers remain non-colluding and the improved distributed point functions deliver the stated privacy guarantees under the paper's threat model.

Editorial extensions

If this is right

  • The schemes protect data privacy throughout the entire statistical process under the non-collusion assumption.
  • Computation overhead is reduced by up to 1.2 times compared with prior approaches.
  • Communication overhead is reduced by up to 20 times compared with prior approaches.
  • Statistical accuracy remains 100 percent on real-world trajectory data.
  • Frequent spatial data updates are supported efficiently without restarting the analysis.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The two-server split could be adapted to other location-based analytics tasks such as range queries or clustering if similar partitioning structures are available.
  • If the non-collusion assumption holds in deployed cloud settings, the approach might allow statistical services on user trajectories without requiring users to trust a single party.
  • The incremental update mechanism suggests that similar efficiency gains could appear in other streaming spatial workloads beyond the tested datasets.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

1 major / 2 minor

Summary. The manuscript claims to present the first system for efficient and privacy-preserving distribution statistics analysis on mobile spatial data. It introduces eSpat-B, which uses two non-colluding servers together with a custom improved distributed point function (DPF) construction that incorporates octree partitioning, and eSpat+, which replaces the partitioning with a K-Dimensional tree and adds incremental DPF plus an update algorithm to handle frequent spatial data changes. The authors state that a security analysis shows the schemes protect data privacy throughout the statistical process and that experiments on real-world trajectory datasets achieve up to 1.2× lower computation overhead and 20× lower communication overhead while preserving 100% statistical accuracy.

Significance. If the privacy reduction and performance numbers hold, the work would supply a concrete, deployable improvement for privacy-preserving spatial analytics in mobile settings, where existing techniques are either too slow or leak information; the combination of octree/KD-tree partitioning with DPF variants directly targets the dynamic, resource-constrained nature of the target environment.

major comments (1)
  1. [Security Analysis] Security Analysis section: the claim that the schemes 'effectively protect data privacy throughout the statistical process' is load-bearing for the central contribution, yet it rests on the unproven assumptions that (i) the two servers remain non-colluding and (ii) the octree-partitioned DPF extension introduces no new leakage relative to standard DPF. No formal game-based proof, leakage profile, or reduction to the DPF assumption is referenced, so any violation of these assumptions would invalidate the entire privacy guarantee.
minor comments (2)
  1. [Abstract] Abstract and Experimental Evaluation: the statements of '100% statistical accuracy' and concrete speedup factors (1.2× / 20×) are presented without cross-references to the tables or figures that contain the supporting measurements or baseline definitions.
  2. [Experimental Evaluation] Experimental Setup: the real-world trajectory datasets are mentioned but never characterized (size, source, spatial distribution, update frequency), making it impossible to judge whether the reported overhead reductions generalize.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the constructive feedback on our manuscript. We address the single major comment below.

read point-by-point responses

  1. Referee: [Security Analysis] Security Analysis section: the claim that the schemes 'effectively protect data privacy throughout the statistical process' is load-bearing for the central contribution, yet it rests on the unproven assumptions that (i) the two servers remain non-colluding and (ii) the octree-partitioned DPF extension introduces no new leakage relative to standard DPF. No formal game-based proof, leakage profile, or reduction to the DPF assumption is referenced, so any violation of these assumptions would invalidate the entire privacy guarantee.

    Authors: We agree that the security analysis presented in the manuscript is informal and relies on the standard non-collusion assumption together with the security properties of the underlying DPF primitive without an explicit game-based reduction or leakage profile for the partitioning extension. The non-collusion model is the conventional setting for two-server DPF constructions in the literature, and the deterministic spatial partitioning step (octree or KD-tree) occurs prior to share generation and does not modify the pseudorandomness or correctness guarantees of the DPF shares themselves. Nevertheless, to strengthen the presentation we will expand the Security Analysis section in the revision to include (i) an explicit leakage profile, (ii) a high-level game-based security definition, and (iii) a sketch of the reduction to the standard DPF assumption. These additions will be placed immediately after the existing informal argument. revision: yes

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: protocol constructions and experimental claims are independent of inputs

full rationale

The paper introduces new protocol designs (eSpat-B using improved DPF with octree partitioning on two non-colluding servers; eSpat+ using KD-tree and incremental DPF) together with a security analysis and experimental benchmarks on real datasets. No equations, fitted parameters, or self-citations appear in the provided text that would reduce any claimed result to the inputs by construction. The central claims rest on the novelty of the constructions and their measured performance rather than any tautological renaming or self-referential derivation.

Assumptions & free parameters 0 free parameters · 2 assumptions · 0 invented entities

Abstract-only review; ledger populated from high-level claims. The schemes rest on standard secure two-party assumptions and the security of (improved) DPF; no free parameters or new entities are named.

assumptions (2)
  • domain assumption Two servers are non-colluding
    Explicitly stated as the basis for eSpat-B privacy
  • domain assumption Improved DPF provides privacy against the stated threat model
    Core cryptographic primitive whose properties are required for all privacy claims

how reviews work

0 comments
Cite this review

Pith. "Pith review of Efficient and Privacy-Preserving Distribution Statistics Analytics on Mobile Spatial Data." pith.science (2026). https://pith.science/paper/5WFG2XRJ

@misc{pith2026260525791,
  author       = {Pith},
  title        = {Pith review of: Efficient and Privacy-Preserving Distribution Statistics Analytics on Mobile Spatial Data},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/5WFG2XRJ}},
  note         = {Machine review of arXiv:2605.25791}
}
read the original abstract

With the rapid development of mobile computing technology, massive amounts of spatial data are continuously generated from various mobile terminals and sensing devices, such as smartphones, connected vehicles, and drones. Performing efficient distributed statistical analysis on this data is crucial for real-time mobile computing applications. However, the constrained and dynamic nature of mobile environments exacerbates the privacy challenge: centralizing sensitive data for analysis risks severe privacy leaks, while existing privacy-preserving techniques often introduce excessive overhead or inaccuracies. In this paper, we design, implement, and evaluate the first system that supports efficient and privacy-preserving distribution statistics analysis for mobile spatial data. First, we propose eSpat-B, which leverages two non-colluding servers and a newly designed improved distributed point functions (DPF) with octree partitioning. Furthermore, considering the frequent updates of spatial data, we propose another more efficient scheme, eSpat+. The core idea of this scheme is to utilize a K-Dimensional tree for spatial partitioning, combine it with incremental DPF for performing statistics analysis, and design an efficient update algorithm. Security analysis demonstrates that our schemes effectively protect data privacy throughout the statistical process. Extensive experiments on real-world trajectory datasets demonstrate that the proposed schemes significantly outperform existing approaches, reducing computation overhead by up to 1.2x and communication overhead by up to 20x while maintaining 100% statistical accuracy.

Figures

Figures reproduced from arXiv: 2605.25791 by the authors.

Figure 2
Figure 2. For instance, with a depth of n = 3, a designate point α = 110, the values on the path are β1 ∈ G1, β2 ∈ G2, β3 ∈ G3 within specific finite groups G1, G2, G3, and the key generation is denoted as Gen(α, β1, β2, β3) → (k0, k1). • IDPF.Gen(1λ , α, β1, . . . , βn) → (k0, k1). Given a se￾curity parameter λ, a string α ∈ {0, 1} n and values β1 ∈ G1, . . . , βn ∈ Gn, output two incremental DPF keys. • IDPF.Eval(i, ki , x)… view at source ↗
Figure 3
Figure 3. The figure demonstrates the recursive space-partitioning mechanism [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: Workflow of eSpat-B and eSpat+. In eSpat-B shown in the upper part, step ① maps spatial data to Gray-code-based octree indices and generates DPF key shares. In eSpat+ shown in the lower part, step ① performs KD-tree-based spatial division and generates prefix-oriented …
Figure 5
Figure 5. Figure 5: Performance evaluation of eSpat-B and eSpat+ against baseline schemes. Results demonstrate that eSpat+ achieves the best efficiency in terms of computation time and communication cost for both clients and servers. For example, eSpat+ reduces key generation time by over…
Figure 6
Figure 6. Figure 6: Accuracy comparison of the proposed eSpat schemes against local differential privacy baselines (LDP1, LDP2) on real-world trajectory datasets. [PITH_FULL_IMAGE:figures/full_fig_p013_6.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

100 extracted references · 3 canonical work pages

  1. [1]

    Aerial: A meta review and discussion of challenges toward unmanned aerial vehicle operations in logistics, mobility, and monitoring,

    S. Wandelt, S. Wang, C. Zheng, and X. Sun, “Aerial: A meta review and discussion of challenges toward unmanned aerial vehicle operations in logistics, mobility, and monitoring,”IEEE Transactions on Intelligent Transportation Systems, 2023

    2023

  2. [2]

    Function secret sharing: Improve- ments and extensions,

    E. Boyle, N. Gilboa, and Y . Ishai, “Function secret sharing: Improve- ments and extensions,” inProceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016, pp. 1292–1303

    2016

  3. [3]

    Kd-box: Line-segment-based kd-tree for interactive exploration of large-scale time-series data,

    Y . Zhao, Y . Wang, J. Zhang, C. Fu, M. Xu, and D. Moritz, “Kd-box: Line-segment-based kd-tree for interactive exploration of large-scale time-series data,”IEEE Trans. Vis. Comput. Graph., vol. 28, no. 1, pp. 890–900, 2022

    2022

  4. [4]

    Efficient generation of the binary reflected gray code and its applications,

    J. R. Bitner, G. Ehrlich, and E. M. Reingold, “Efficient generation of the binary reflected gray code and its applications,”Communications of the ACM, vol. 19, no. 9, pp. 517–521, 1976

    1976

  5. [5]

    Search me in the dark: Privacy-preserving boolean range query over encrypted spatial data,

    X. Wang, J. Ma, X. Liu, R. H. Deng, Y . Miao, D. Zhu, and Z. Ma, “Search me in the dark: Privacy-preserving boolean range query over encrypted spatial data,” inIEEE INFOCOM 2020-IEEE Conference on Computer Communications. IEEE, 2020, pp. 2253–2262

    2020

  6. [6]

    Searchable encryption for healthcare clouds: A survey,

    R. Zhang, R. Xue, and L. Liu, “Searchable encryption for healthcare clouds: A survey,”IEEE Transactions on Services Computing, vol. 11, no. 6, pp. 978–996, 2017

    2017

  7. [7]

    A survey on access control in the age of internet of things,

    J. Qiu, Z. Tian, C. Du, Q. Zuo, S. Su, and B. Fang, “A survey on access control in the age of internet of things,”IEEE Internet of Things Journal, vol. 7, no. 6, pp. 4682–4696, 2020

    2020

  8. [8]

    Public key encryption with keyword search,

    D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, “Public key encryption with keyword search,” inAdvances in Cryptology- EUROCRYPT 2004: International Conference on the Theory and Ap- plications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004. Proceedings 23. Springer, 2004, pp. 506–522

    2004

Show all 100 references
  1. [9]

    Secure conjunctive keyword search over encrypted data,

    P. Golle, J. Staddon, and B. Waters, “Secure conjunctive keyword search over encrypted data,” inApplied Cryptography and Network Security: Second International Conference, ACNS 2004, Yellow Moun- tain, China, June 8-11, 2004. Proceedings 2. Springer, 2004, pp. 31–45

    2004

  2. [10]

    Searchable symmetric encryption: improved definitions and efficient construc- tions,

    R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: improved definitions and efficient construc- tions,” inProceedings of the 13th ACM conference on Computer and communications security, 2006, pp. 79–88

    2006

  3. [11]

    Privacy- preserving boolean range query with temporal access control in mobile computing,

    Q. Tong, X. Li, Y . Miao, X. Liu, J. Weng, and R. H. Deng, “Privacy- preserving boolean range query with temporal access control in mobile computing,”IEEE Transactions on Knowledge and Data Engineering, vol. 35, no. 5, pp. 5159–5172, 2022

    2022

  4. [12]

    Privacy-preserving bloom filter-based keyword search over large en- crypted cloud data,

    Y . Liang, J. Ma, Y . Miao, D. Kuang, X. Meng, and R. H. Deng, “Privacy-preserving bloom filter-based keyword search over large en- crypted cloud data,”IEEE Transactions on Computers, vol. 72, no. 11, pp. 3086–3098, 2023

    2023

  5. [13]

    Vrfms: Verifiable ranked fuzzy multi-keyword search over encrypted data,

    X. Li, Q. Tong, J. Zhao, Y . Miao, S. Ma, J. Weng, J. Ma, and K.- K. R. Choo, “Vrfms: Verifiable ranked fuzzy multi-keyword search over encrypted data,”IEEE Transactions on Services Computing, vol. 16, no. 1, pp. 698–710, 2022

    2022

  6. [14]

    Privacy-preserving ranked spatial keyword query in mobile cloud-assisted fog computing,

    Q. Tong, Y . Miao, H. Li, X. Liu, and R. H. Deng, “Privacy-preserving ranked spatial keyword query in mobile cloud-assisted fog computing,” IEEE Transactions on Mobile Computing, vol. 22, no. 6, pp. 3604– 3618, 2021

    2021

  7. [15]

    Privacy- preserving keyword similarity search over encrypted spatial data in cloud computing,

    F. Song, Z. Qin, L. Xue, J. Zhang, X. Lin, and X. Shen, “Privacy- preserving keyword similarity search over encrypted spatial data in cloud computing,”IEEE Internet of Things Journal, vol. 9, no. 8, pp. 6184–6198, 2021

    2021

  8. [16]

    Efficient privacy- preserving geographic keyword boolean range query over encrypted spatial data,

    Z. Gong, J. Li, Y . Lin, J. Wei, and C. Lancine, “Efficient privacy- preserving geographic keyword boolean range query over encrypted spatial data,”IEEE Systems Journal, vol. 17, no. 1, pp. 455–466, 2022

    2022

  9. [17]

    Delfs, H

    H. Delfs, H. Knebl, and H. Knebl,Introduction to cryptography. Springer, 2002, vol. 2

    2002

  10. [18]

    Revisiting security risks of asymmetric scalar product preserving encryption and its variants,

    W. Lin, K. Wang, Z. Zhang, and H. Chen, “Revisiting security risks of asymmetric scalar product preserving encryption and its variants,” in 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS). IEEE, 2017, pp. 1116–1125

    2017

  11. [19]

    Achiev- ing privacy-preserving discrete frechet distance range queries,

    Y . Guan, R. Lu, Y . Zheng, S. Zhang, J. Shao, and G. Wei, “Achiev- ing privacy-preserving discrete frechet distance range queries,”IEEE Transactions on Dependable and Secure Computing, vol. 20, no. 3, pp. 2097–2110, 2022

  12. [21]

    Efficient and secure spatial range query over large-scale encrypted data,

    Y . Miao, C. Xu, Y . Zheng, X. Liu, X. Meng, and R. H. Deng, “Efficient and secure spatial range query over large-scale encrypted data,” in2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS). IEEE, 2023, pp. 1–11

    2023

  13. [22]

    Enabling efficient spatial keyword queries on encrypted data with strong security guarantees,

    X. Wang, J. Ma, F. Li, X. Liu, Y . Miao, and R. H. Deng, “Enabling efficient spatial keyword queries on encrypted data with strong security guarantees,”IEEE Transactions on Information Forensics and Security, vol. 16, pp. 4909–4923, 2021

    2021

  14. [24]

    Result pattern hiding searchable encryption for conjunctive queries,

    S. Lai, S. Patranabis, A. Sakzad, J. K. Liu, D. Mukhopadhyay, R. Ste- infeld, S.-F. Sun, D. Liu, and C. Zuo, “Result pattern hiding searchable encryption for conjunctive queries,” inProceedings of the 2018 ACM SIGSAC conference on computer and communications security, 2018, pp...

    2018

  15. [25]

    Untraceable electronic mail, return addresses, and digital pseudonyms,

    D. L. Chaum, “Untraceable electronic mail, return addresses, and digital pseudonyms,”Communications of the ACM, vol. 24, no. 2, pp. 84–90, 1981

    1981

  16. [26]

    A verifiable secret shuffle and its application to e- voting,

    C. A. Neff, “A verifiable secret shuffle and its application to e- voting,” inProceedings of the 8th ACM conference on Computer and Communications Security, 2001, pp. 116–125

    2001

  17. [27]

    Building a rappor with the unknown: Privacy-preserving learning of associations and data dictio- naries,

    G. Fanti, V . Pihur, and ´U. Erlingsson, “Building a rappor with the unknown: Privacy-preserving learning of associations and data dictio- naries,”arXiv preprint arXiv:1503.01214, 2015

    2015 arXiv

  18. [28]

    Secure two-party computation in sublinear (amortized) time,

    S. D. Gordon, J. Katz, V . Kolesnikov, F. Krell, T. Malkin, M. Raykova, and Y . Vahlis, “Secure two-party computation in sublinear (amortized) time,” inProceedings of the 2012 ACM conference on Computer and communications security, 2012, pp. 513–524

    2012

  19. [29]

    Efficient maliciously secure multiparty computation for ram,

    M. Keller and A. Yanai, “Efficient maliciously secure multiparty computation for ram,” inAnnual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 2018, pp. 91–124

    2018

  20. [30]

    Distributed oblivious ram for secure two- party computation,

    S. Lu and R. Ostrovsky, “Distributed oblivious ram for secure two- party computation,” inTheory of Cryptography Conference. Springer, 2013, pp. 377–396

    2013

  21. [31]

    Efficient private statistics with succinct sketches,

    L. Melis, G. Danezis, and E. De Cristofaro, “Efficient private statistics with succinct sketches,”arXiv preprint arXiv:1508.06110, 2015

    2015 arXiv

  22. [32]

    Prio: Private, robust, and scalable computation of aggregate statistics,

    H. Corrigan-Gibbs and D. Boneh, “Prio: Private, robust, and scalable computation of aggregate statistics,” in14th USENIX symposium on networked systems design and implementation (NSDI 17), 2017, pp. 259–282

    2017

  23. [33]

    Efficient and privacy- preserving encode-based range query over encrypted cloud data,

    Y . Liang, J. Ma, Y . Miao, Y . Su, and R. H. Deng, “Efficient and privacy- preserving encode-based range query over encrypted cloud data,”IEEE Transactions on Information Forensics and Security, 2024

    2024

  24. [34]

    Lightweight techniques for private heavy hitters,

    D. Boneh, E. Boyle, H. Corrigan-Gibbs, N. Gilboa, and Y . Ishai, “Lightweight techniques for private heavy hitters,” in2021 IEEE Symposium on Security and Privacy (SP). IEEE, 2021, pp. 762–776

    2021

  25. [35]

    Federated heavy hitters discovery with differential privacy,

    W. Zhu, P. Kairouz, B. McMahan, H. Sun, and W. Li, “Federated heavy hitters discovery with differential privacy,” inInternational Conference on Artificial Intelligence and Statistics. PMLR, 2020, pp. 3837–3847

    2020

  26. [36]

    Practical locally private heavy hitters,

    R. Bassily, K. Nissim, U. Stemmer, and A. Thakurta, “Practical locally private heavy hitters,”Journal of Machine Learning Research, vol. 21, no. 16, pp. 1–42, 2020

    2020

  27. [37]

    Efficient secure three-party sorting with applications to data analysis and heavy hitters,

    G. Asharov, K. Hamada, D. Ikarashi, R. Kikuchi, A. Nof, B. Pinkas, K. Takahashi, and J. Tomida, “Efficient secure three-party sorting with applications to data analysis and heavy hitters,” inProceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security,...

    2022

  28. [38]

    V ogue: Faster computation of private heavy hitters,

    P. Jangir, N. Koti, V . B. Kukkala, A. Patra, B. R. Gopal, and S. Sangal, “V ogue: Faster computation of private heavy hitters,”IEEE Transac- tions on Dependable and Secure Computing, 2023

    2023

  29. [39]

    Plasma: Private, lightweight aggregated statistics against malicious adversaries,

    D. Mouris, P. Sarkar, and N. G. Tsoutsos, “Plasma: Private, lightweight aggregated statistics against malicious adversaries,”Proceedings on Privacy Enhancing Technologies, 2024

    2024

  30. [40]

    Adoption of unmanned aerial vehicle (uav) imagery in agricultural management: A systematic literature review,

    M. A. Istiak, M. M. Syeed, M. S. Hossain, M. F. Uddin, M. Hasan, R. H. Khan, and N. S. Azad, “Adoption of unmanned aerial vehicle (uav) imagery in agricultural management: A systematic literature review,”Ecological Informatics, p. 102305, 2023

    2023

  31. [41]

    Unmanned aerial vehicles for air pollution monitoring: A survey,

    N. H. Motlagh, P. Kortoc ¸i, X. Su, L. Lov ´en, H. K. Hoel, S. B. Haugsvær, V . Srivastava, C. F. Gulbrandsen, P. Nurmi, and S. Tarkoma, IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 15 “Unmanned aerial vehicles for air pollution monitoring: A survey,” IEEE Internet ...

    2023

  32. [42]

    Deep reinforce- ment learning-driven reconfigurable intelligent surface-assisted radio surveillance with a fixed-wing uav,

    X. Yuan, S. Hu, W. Ni, X. Wang, and A. Jamalipour, “Deep reinforce- ment learning-driven reconfigurable intelligent surface-assisted radio surveillance with a fixed-wing uav,”IEEE Transactions on Information Forensics and Security, 2023

    2023

  33. [44]

    Pias: Privacy-preserving incentive announcement system based on blockchain for internet of vehicles,

    Y . Zhan, Y . Yang, H. Cheng, X. Luo, Z. Guan, and R. H. Deng, “Pias: Privacy-preserving incentive announcement system based on blockchain for internet of vehicles,”IEEE Transactions on Services Computing, 2024

    2024

  34. [45]

    Sok: Fully homomorphic encryption accelerators,

    J. Zhang, X. Cheng, L. Yang, J. Hu, X. Liu, and K. Chen, “Sok: Fully homomorphic encryption accelerators,”ACM Computing Surveys, vol. 56, no. 12, pp. 1–32, 2024

    2024

  35. [46]

    Safeguarding data privacy: Enhancing cybersecurity measures for protecting personal data in the united states,

    S. Muhammad, F. Meerjat, A. Meerjat, and A. Dalal, “Safeguarding data privacy: Enhancing cybersecurity measures for protecting personal data in the united states,”International Journal of Machine Learning Research in Cybersecurity and Artificial Intelligence, vol. 15, no. 1, p...

    2024

  36. [47]

    Secure multi- party computation (smpc) protocols and privacy,

    M. Rahaman, V . Arya, S. M. Orozco, and P. Pappachan, “Secure multi- party computation (smpc) protocols and privacy,” inInnovations in Modern Cryptography. IGI Global, 2024, pp. 190–214

    2024

  37. [48]

    Lse: Efficient symmetric searchable encryption based on labeled psi,

    Y . Yang, Y . Hu, R. Li, X. Dong, Z. Cao, J. Shen, and S. Dou, “Lse: Efficient symmetric searchable encryption based on labeled psi,”IEEE Transactions on Services Computing, vol. 17, no. 2, pp. 563–574, 2024

    2024

  38. [49]

    Bpvse: Publicly verifiable searchable encryption for cloud-assisted electronic health records,

    B. Chen, T. Xiang, D. He, H. Li, and K.-K. R. Choo, “Bpvse: Publicly verifiable searchable encryption for cloud-assisted electronic health records,”IEEE Transactions on Information Forensics and Security, vol. 18, pp. 3171–3184, 2023

    2023

  39. [50]

    High recovery with fewer injections: Practical binary volumetric injection attacks against dynamic searchable encryption,

    X. Zhang, W. Wang, P. Xu, L. T. Yang, and K. Liang, “High recovery with fewer injections: Practical binary volumetric injection attacks against dynamic searchable encryption,” in32nd USENIX Security Symposium (USENIX Security 23). Anaheim, CA: USENIX Asso- ciation, 2023, pp. 5953–5970

    2023

  40. [51]

    Rethinking searchable symmetric encryption,

    Z. Gui, K. G. Paterson, and S. Patranabis, “Rethinking searchable symmetric encryption,” in2023 IEEE Symposium on Security and Privacy (SP), 2023, pp. 1401–1418

    2023

  41. [52]

    Forward private verifiable dynamic searchable symmetric encryption with efficient conjunctive query,

    C. Guo, W. Li, X. Tang, K.-K. R. Choo, and Y . Liu, “Forward private verifiable dynamic searchable symmetric encryption with efficient conjunctive query,”IEEE Transactions on Dependable and Secure Computing, vol. 21, no. 2, pp. 746–763, 2024

    2024

  42. [53]

    Weighted oblivious ram, with appli- cations to searchable symmetric encryption,

    L. Assouline and B. Minaud, “Weighted oblivious ram, with appli- cations to searchable symmetric encryption,” inAnnual International Conference on the Theory and Applications of Cryptographic Tech- niques. Springer, 2023, pp. 426–455

    2023

  43. [54]

    Abaeks: Attribute-based au- thenticated encryption with keyword search over outsourced encrypted data,

    F. Luo, H. Wang, C. Lin, and X. Yan, “Abaeks: Attribute-based au- thenticated encryption with keyword search over outsourced encrypted data,”IEEE Transactions on Information Forensics and Security, 2023

    2023

  44. [55]

    Time-controllable keyword search scheme with efficient revocation in mobile e-health cloud,

    Y . Miao, F. Li, X. Li, Z. Liu, J. Ning, H. Li, K.-K. R. Choo, and R. H. Deng, “Time-controllable keyword search scheme with efficient revocation in mobile e-health cloud,”IEEE Transactions on Mobile Computing, vol. 23, no. 5, pp. 3650–3665, 2023

    2023

  45. [56]

    Beyond result verification: Efficient privacy-preserving spatial keyword query with suppressed leakage,

    Q. Tong, X. Li, Y . Miao, Y . Wang, X. Liu, and R. H. Deng, “Beyond result verification: Efficient privacy-preserving spatial keyword query with suppressed leakage,”IEEE Transactions on Information Forensics and Security, vol. 19, pp. 2746–2760, 2024

    2024

  46. [57]

    Efficient and privacy-preserving arbitrary polygon range query scheme over dynamic and time-series location data,

    F. Wang, H. Zhu, G. He, R. Lu, Y . Zheng, and H. Li, “Efficient and privacy-preserving arbitrary polygon range query scheme over dynamic and time-series location data,”IEEE Transactions on Information Forensics and Security, vol. 18, pp. 3414–3429, 2023

    2023

  47. [58]

    Efficient privacy-preserving spatial range query over outsourced encrypted data,

    Y . Miao, Y . Yang, X. Li, Z. Liu, H. Li, K.-K. R. Choo, and R. H. Deng, “Efficient privacy-preserving spatial range query over outsourced encrypted data,”IEEE Transactions on Information Forensics and Security, vol. 18, pp. 3921–3933, 2023

    2023

  48. [59]

    Efficient privacy-preserving spatial data query in cloud computing,

    Y . Miao, Y . Yang, X. Li, L. Wei, Z. Liu, and R. H. Deng, “Efficient privacy-preserving spatial data query in cloud computing,”IEEE Trans- actions on Knowledge and Data Engineering, vol. 36, no. 1, pp. 122– 136, 2024

    2024

  49. [60]

    Privacy-preserving graph matching query supporting quick subgraph extraction,

    X. Ge, J. Yu, and R. Hao, “Privacy-preserving graph matching query supporting quick subgraph extraction,”IEEE Transactions on Depend- able and Secure Computing, vol. 21, no. 3, pp. 1286–1300, 2024

    2024

  50. [61]

    Fast and privacy- preserving attribute-based keyword search in cloud document services,

    Q. Huang, Q. Wei, G. Yan, L. Zou, and Y . Yang, “Fast and privacy- preserving attribute-based keyword search in cloud document services,” IEEE Transactions on Services Computing, vol. 16, no. 5, pp. 3348– 3360, 2023

    2023

  51. [62]

    Statistical models of top-k partial orders,

    A. Awadelkarim and J. Ugander, “Statistical models of top-k partial orders,” inProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024, p. 39–48

    2024

  52. [63]

    Sketchpolymer: Estimate per-item tail quantile using one sketch,

    J. Guo, Y . Hong, Y . Wu, Y . Liu, T. Yang, and B. Cui, “Sketchpolymer: Estimate per-item tail quantile using one sketch,” inProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023, pp. 590–601

    2023

  53. [64]

    Machine-checking{Multi-Round} proofs of shuffle:{Terelius-Wikstrom}and{Bayer-Groth},

    T. Haines, R. Gor ´e, and M. Tiwari, “Machine-checking{Multi-Round} proofs of shuffle:{Terelius-Wikstrom}and{Bayer-Groth},” in32nd USENIX Security Symposium (USENIX Security 23), 2023, pp. 6471– 6488

    2023

  54. [65]

    Where have you been? a study of privacy risk for point-of- interest recommendation,

    K. Cai, J. Zhang, Z. Hong, W. Shand, G. Wang, D. Zhang, J. Chi, and Y . Tian, “Where have you been? a study of privacy risk for point-of- interest recommendation,” inProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024, pp. 175– 186

    2024

  55. [66]

    Privacy matters: vertical federated linear contextual bandits for privacy protected recommendation,

    Z. Cao, Z. Liang, B. Wu, S. Zhang, H. Li, O. Wen, Y . Rong, and P. Zhao, “Privacy matters: vertical federated linear contextual bandits for privacy protected recommendation,” inProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023, pp. 154–166

    2023

  56. [67]

    Multi-user dynamic searchable symmetric encryption with corrupted participants,

    J. G. Chamani, Y . Wang, D. Papadopoulos, M. Zhang, and R. Jalili, “Multi-user dynamic searchable symmetric encryption with corrupted participants,”IEEE Transactions on Dependable and Secure Comput- ing, vol. 20, no. 1, pp. 114–130, 2021

    2021

  57. [68]

    Multi-client cloud-based symmetric searchable encryption,

    S. K. Kermanshahi, J. K. Liu, R. Steinfeld, S. Nepal, S. Lai, R. Loh, and C. Zuo, “Multi-client cloud-based symmetric searchable encryption,” IEEE Transactions on Dependable and Secure Computing, vol. 18, no. 5, pp. 2419–2437, 2021

    2021

  58. [69]

    {MUSES}: Efficient {Multi-User}searchable encrypted database,

    T. Le, R. Behnia, J. Guajardo, and T. Hoang, “{MUSES}: Efficient {Multi-User}searchable encrypted database,” in33rd USENIX Security Symposium (USENIX Security 24), 2024, pp. 2581–2598

    2024

  59. [70]

    Multi-client secure and efficient dpf-based keyword search for cloud storage,

    C. Huang, D. Liu, A. Yang, R. Lu, and X. Shen, “Multi-client secure and efficient dpf-based keyword search for cloud storage,”IEEE Transactions on Dependable and Secure Computing, vol. 21, no. 1, pp. 353–371, 2023

    2023

  60. [71]

    Collecting geospatial data under local differential privacy with improving frequency estimation,

    D. Hong, W. Jung, and K. Shim, “Collecting geospatial data under local differential privacy with improving frequency estimation,”IEEE Transactions on Knowledge and Data Engineering, vol. 35, no. 7, pp. 6739–6751, 2022

    2022

  61. [72]

    Real-world trajectory sharing with local differential privacy,

    T. Cunningham, G. Cormode, H. Ferhatosmanoglu, and D. Srivastava, “Real-world trajectory sharing with local differential privacy,”arXiv preprint arXiv:2108.02084, 2021

    2021

  62. [73]

    Privacy-preserving spatio-temporal keyword search for outsourced location-based ser- vices,

    Q. Huang, J. Du, G. Yan, Y . Yang, and Q. Wei, “Privacy-preserving spatio-temporal keyword search for outsourced location-based ser- vices,”IEEE Transactions on Services Computing, vol. 15, no. 6, pp. 3443–3456, 2022

    2022

  63. [74]

    A robust and lightweight privacy-preserving data aggregation scheme for smart grid,

    L. Wu, S. Fu, Y . Luo, H. Yan, H. Shi, and M. Xu, “A robust and lightweight privacy-preserving data aggregation scheme for smart grid,” IEEE Transactions on Dependable and Secure Computing, vol. 21, no. 1, pp. 270–283, 2023

    2023

  64. [75]

    Distributed, private, sparse histograms in the two- server model,

    J. Bell, A. Gascon, B. Ghazi, R. Kumar, P. Manurangsi, M. Raykova, and P. Schoppmann, “Distributed, private, sparse histograms in the two- server model,” inProceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022, pp. 307–321

    2022

  65. [76]

    Pgsim: Efficient and privacy-preserving graph similarity query over encrypted data in cloud,

    Y . Zheng, H. Zhu, R. Lu, Y . Guan, S. Zhang, F. Wang, J. Shao, and H. Li, “Pgsim: Efficient and privacy-preserving graph similarity query over encrypted data in cloud,”IEEE Trans. Inf. Forensics Secur., vol. 18, pp. 2030–2045, 2023

  66. [77]

    Information-theoretically secure and highly efficient search and row retrieval,

    S. Sharma, Y . Li, S. Mehrotra, N. Panwar, K. Kumari, and S. Roy- choudhury, “Information-theoretically secure and highly efficient search and row retrieval,”Proceedings of the VLDB Endowment, vol. 16, no. 10, pp. 2391–2403, 2023

    2023

  67. [78]

    Longshot: Indexing growing databases using mpc and differential privacy,

    Y . Zhang, J. Bater, K. Nayak, and A. Machanavajjhala, “Longshot: Indexing growing databases using mpc and differential privacy,”Pro- ceedings of the VLDB Endowment, vol. 16, no. 8, pp. 2005–2018, 2023

    2005

  68. [79]

    Efficient large-scale traffic forecasting with transformers: A spatial data management perspective,

    Y . Fang, Y . Liang, B. Hui, Z. Shao, L. Deng, X. Liu, X. Jiang, and K. Zheng, “Efficient large-scale traffic forecasting with transformers: A spatial data management perspective,” inProceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V . 1, 20...

    2025

  69. [80]

    A survey on resource management in joint communication and computing- embedded sagin,

    Q. Chen, Z. Guo, W. Meng, S. Han, C. Li, and T. Q. Quek, “A survey on resource management in joint communication and computing- embedded sagin,”IEEE Communications Surveys & Tutorials, vol. 27, no. 3, pp. 1911–1954, 2024. IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 16

    1911

  70. [81]

    Dynamic gnn-based multimodal anomaly detection for spatial crowd- sourcing drone services,

    J. Akram, W. Hussain, R. H. Jhaveri, R. S. Rathore, and A. Anaissi, “Dynamic gnn-based multimodal anomaly detection for spatial crowd- sourcing drone services,”Digital Communications and Networks, 2025

    2025

  71. [82]

    Pota: Privacy- preserving online multi-task assignment with path planning,

    C. Zhang, X. Luo, J. Liang, X. Liu, L. Zhu, and S. Guo, “Pota: Privacy- preserving online multi-task assignment with path planning,”IEEE Transactions on Mobile Computing, vol. 23, no. 5, pp. 5999–6011, 2023

    2023

  72. [83]

    Achieving efficient and privacy-preserving location-based task recommendation in spatial crowdsourcing,

    F. Song, J. Liang, C. Zhang, Z. Fu, Z. Qin, and S. Guo, “Achieving efficient and privacy-preserving location-based task recommendation in spatial crowdsourcing,”IEEE Transactions on Dependable and Secure Computing, vol. 21, no. 4, pp. 4006–4023, 2023

    2023

  73. [84]

    Vspatial: Enabling private and verifiable spatial keyword- based positioning in 6g-oriented iot,

    W. Zhang, M. Zhao, Z. Sun, C. Zhang, J. Liang, L. Zhu, and S. Guo, “Vspatial: Enabling private and verifiable spatial keyword- based positioning in 6g-oriented iot,”IEEE Journal on Selected Areas in Communications, vol. 42, no. 10, pp. 2954–2969, 2024

    2024

  74. [85]

    Dif- ferentially private selection from secure distributed computing,

    I. Damg ˚ard, H. Keller, B. Nelson, C. Orlandi, and R. Pagh, “Dif- ferentially private selection from secure distributed computing,” in Proceedings of the ACM Web Conference 2024, 2024, pp. 1103–1114

    2024

  75. [86]

    Secpq: Secure prediction queries on encrypted outsourced databases,

    J. Liang, S. Guo, Z. Hong, E. Zhou, C. Zhang, and B. Xiao, “Secpq: Secure prediction queries on encrypted outsourced databases,”IEEE Transactions on Dependable and Secure Computing, 2025

    2025

  76. [87]

    Enabling se- cure keyword-associated spatio-temporal range query in mobile cloud,

    X. Wang, Z. Fang, C. Gong, Y . Liang, X. Ma, and J. Ma, “Enabling se- cure keyword-associated spatio-temporal range query in mobile cloud,” IEEE Transactions on Mobile Computing, 2025

    2025

  77. [88]

    Differentially private explanations for aggregate query answers,

    Y . Tao, A. Gilad, A. Machanavajjhala, and S. Roy, “Differentially private explanations for aggregate query answers,”The VLDB Journal, vol. 34, no. 2, p. 20, 2025

    2025

  78. [89]

    Pcse: Privacy-preserving collaborative searchable encryption for group data sharing in cloud computing,

    Y . Xu, H. Cheng, X. Liu, C. Jiang, X. Zhang, and M. Wang, “Pcse: Privacy-preserving collaborative searchable encryption for group data sharing in cloud computing,”IEEE Transactions on Mobile Computing, 2025

    2025

  79. [90]

    Hex: Encrypted rich queries with forward and backward privacy using trusted hardware,

    H. Wu, Z. Peng, J. Xiao, L. Xue, C. Lin, and S.-H. Chung, “Hex: Encrypted rich queries with forward and backward privacy using trusted hardware,”IEEE Transactions on Dependable and Secure Computing, 2025

    2025

  80. [91]

    Hash-prune-invert: Improved differ- entially private heavy-hitter detection in the two-server model,

    B. Balle, J. Bell-Clark, A. Cheu, A. Gascon, J. Katz, M. Raykova, P. Schoppmann, and T. Steinke, “Hash-prune-invert: Improved differ- entially private heavy-hitter detection in the two-server model,” in2025 IEEE Symposium on Security and Privacy (SP). IEEE, 2025, pp. 2903–2918

    2025

  81. [92]

    Betrayal, distrust, and rationality: Smart counter-collusion contracts for verifiable cloud computing,

    C. Dong, Y . Wang, A. Aldweesh, P. McCorry, and A. Van Moorsel, “Betrayal, distrust, and rationality: Smart counter-collusion contracts for verifiable cloud computing,” inProceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017, pp. 211–227

    2017

  82. [93]

    High- dimensional and secure spatial keyword query with arbitrary ranges in mobile cloud,

    F. Song, Y . Gao, M. Zhao, C. Zhang, Z. Qin, and B. Xiao, “High- dimensional and secure spatial keyword query with arbitrary ranges in mobile cloud,”IEEE Transactions on Mobile Computing, 2025

    2025

  83. [94]

    Differential privacy space decomposition algorithm based on hierarchical model,

    H. Huang, C. Sun, Z. Shi, W. Zhang, J. Cang, and F. Xiao, “Differential privacy space decomposition algorithm based on hierarchical model,” IEEE Transactions on Mobile Computing, 2025

    2025

  84. [95]

    Collaborate for real-time gain: Semantic-based robotic communication in 3d object tracking,

    J. Shao, X. Qin, J. Gao, Y . Li, L. Xin, and P. Zhang, “Collaborate for real-time gain: Semantic-based robotic communication in 3d object tracking,”IEEE Transactions on Mobile Computing, 2025

    2025

  85. [96]

    Energy- efficient over-the-air computation in uav-assisted iiot networks,

    Y . Chen, S. Sun, M. Liu, B. Ai, Y . Wang, and Y . Liu, “Energy- efficient over-the-air computation in uav-assisted iiot networks,”IEEE Transactions on Mobile Computing, 2025

    2025

  86. [97]

    Personal- ized local differential privacy for multi-dimensional range queries over mobile user data,

    Y . He, M. Wang, X. Deng, P. Yang, Q. Xue, and L. T. Yang, “Personal- ized local differential privacy for multi-dimensional range queries over mobile user data,”IEEE Transactions on Mobile Computing, 2025

    2025

  87. [98]

    Fd-ran empowered multiple base stations cooperative isac for low- altitude networks,

    J. Xue, H. Zhou, H. Huang, G. Wen, Y . Xu, X. Huang, and X. Shen, “Fd-ran empowered multiple base stations cooperative isac for low- altitude networks,”IEEE Transactions on Network Science and Engi- neering, vol. 13, pp. 6927–6943, 2026

    2026

  88. [99]

    Co- operative deep reinforcement learning enabled power allocation for packet duplication urllc in multi-connectivity vehicular networks,

    J. Xue, K. Yu, T. Zhang, H. Zhou, L. Zhao, and X. Shen, “Co- operative deep reinforcement learning enabled power allocation for packet duplication urllc in multi-connectivity vehicular networks,” IEEE Transactions on Mobile Computing, vol. 23, no. 8, pp. 8143– 8157, 2024

    2024

  89. [100]

    Goldreich,Foundations of Cryptography, Volume 2: Basic Applica- tions

    O. Goldreich,Foundations of Cryptography, Volume 2: Basic Applica- tions. Cambridge University Press, 2004

    2004

  90. [101]

    Distributed point functions and their ap- plications,

    N. Gilboa and Y . Ishai, “Distributed point functions and their ap- plications,” inAnnual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 2014, pp. 640– 658

    2014

  91. [102]

    Pods: Efficient and secure identity-based hierarchical data processing control in mobile cloud storage,

    M. Zhao, Z. Sun, C. Zhang, L. Zhu, S. Guo, and B. Xiao, “Pods: Efficient and secure identity-based hierarchical data processing control in mobile cloud storage,”IEEE Transactions on Mobile Computing, 2026

    2026

  92. [103]

    Flexible and privacy- preserving access control framework for decentralized identity sys- tems,

    B. Xie, R. Song, Z. Li, X. Deng, and B. Xiao, “Flexible and privacy- preserving access control framework for decentralized identity sys- tems,”IEEE Transactions on Information Forensics and Security, 2026. IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 17 Xuhao Renrec...

    2026

Pith tools

Reviewed June 29, 2026 · model on record in the stance chip above.