[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article

Multi-Party Private Edge Computing for Collaborative Quantitative Exposure Detection of Endemic Diseases

Published: 01 December 2024 Publication History

Abstract

Facing the global threat of endemic diseases, utilizing edge computing for exposure detection enables efficient monitoring of the dynamic distribution of infected patient groups across regions, enhancing the management and control of these diseases. Employing the quantitative exposure detection of endemic diseases, regions seek to reconcile patient information collected through mobile devices, aiming to obtain statistical and analytical results based on the intersection of patient lists. In this paper, we propose a privacy-preserving scheme for the collaborative quantitative exposure detection of endemic diseases, which ensures each region to only learn the statistical results, without any information about other regions’ datasets. Our scheme is fundamentally achieved through Circuit-based Private Set Intersection (Circuit-PSI) that can compute functions over the set intersection without disclosing the intersection itself. However, the state-of-the-art solution involves a laborious process in which one party iteratively compares its elements with those of others, which leads to a significantly high communication complexity. Therefore, we introduce a novel multi-party protocol that can diminish the communication overhead of circuit-PSI through a skillful decoupling of the comparison complexity from the number of parties. Furthermore, to address scenarios involving patient information with additional attributes, we extend our protocol to include payloads by developing a lightweight multiparty data mapping algorithm. Our extensive experiments show that compared to prior works, our protocol achieves a substantial reduction in communication overhead by 6.4×, and runs 1.2× faster in the LAN setting and 3.1× in the WAN setting.

References

[1]
G. Grekousis and Y. Liu, “Digital contact tracing, community uptake, and proximity awareness technology to fight COVID-19: A systematic review,” Sustain. Cities Soc., vol. 71, 2021, Art. no.
[2]
I. Cooper, A. Mondal, and C. G. Antonopoulos, “A sir model assumption for the spread of COVID-19 in different communities,” Chaos Solitons Fractals, vol. 139, 2020, Art. no. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0960077920304549
[3]
N. Chandran, N. Dasgupta, D. Gupta, S. L. B. Obbattu, S. Sekar, and A. Shah, “Efficient linear multiparty PSI and extensions to circuit/quorum PSI,” in Proc. ACM SIGSAC Conf. Comput. Commun. Secur., 2021, pp. 1182–1204.
[4]
Y. Lindell and A. Nof, “A framework for constructing fast MPC over arithmetic circuits with malicious adversaries and an honest-majority,” in Proc. ACM SIGSAC Conf. Comput. Commun. Secur., 2017, pp. 259–276.
[5]
C. Meadows, “A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party,” in Proc. IEEE Symp. Secur. Privacy, 1986, Art. no.
[6]
E. De Cristofaro and G. Tsudik, “Practical private set intersection protocols with linear complexity,” in Proc. 14th Int. Conf. Financial Cryptogr. Data Secur., Tenerife, Canary Islands, Springer, 2010, pp. 143–159.
[7]
Y. Ishai, J. Kilian, K. Nissim, and E. Petrank, “Extending oblivious transfers efficiently,” in Proc. Annu. Int. Cryptol. Conf., Springer, 2003, pp. 145–161.
[8]
V. Kolesnikov and R. Kumaresan, “Improved OT extension for transferring short secrets,” in Proc. 33rd Annu. Cryptol. Conf., Santa Barbara, CA, USA, Springer, 2013, pp. 54–70.
[9]
V. Kolesnikov, R. Kumaresan, M. Rosulek, and N. Trieu, “Efficient batched oblivious PRF with applications to private set intersection,” in Proc. ACM SIGSAC Conf. Comput. Commun. Secur., 2016, pp. 818–829.
[10]
B. Pinkas, T. Schneider, and M. Zohner, “Scalable private set intersection based on OT extension,” ACM Trans. Privacy Secur., vol. 21, no. 2, pp. 1–35, 2018.
[11]
B. Pinkas, M. Rosulek, N. Trieu, and A. Yanai, “SpOT-Light: Lightweight private set intersection from sparse OT extension,” in Proc. Adv. Cryptology–CRYPTO: 39th Annu. Int. Cryptology Conf., Santa Barbara, CA, USA, Aug. 18–22, 2019, pp. 401–431.
[12]
M. Chase and P. Miao, “Private set intersection in the Internet setting from lightweight oblivious PRF,” in Proc. 40th Annu. Int. Cryptol. Conf., Santa Barbara, CA, USA, Springer, 2020, pp. 34–63.
[13]
E. Boyle et al., “Efficient two-round OT extension and silent non-interactive secure computation,” in Proc. ACM SIGSAC Conf. Comput. Commun. Secur., 2019, pp. 291–308.
[14]
P. Rindal and P. Schoppmann, “VOLE-PSI: Fast OPRF and circuit-PSI from vector-OLE,” in Proc. 40th Annu. Int. Conf. Theory Appl. Cryptographic Techn., Zagreb, Croatia, Springer, 2021, pp. 901–930.
[15]
G. Couteau, P. Rindal, and S. Raghuraman, “Silver: Silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes,” in Proc. 41st Annu. Int. Cryptol. Conf., Springer, 2021, pp. 502–534.
[16]
B. Applebaum and N. Konstantini, “Actively secure arithmetic computation and VOLE with constant computational overhead,” in Proc. 42nd Annu. Int. Conf. Theory Appl. Cryptographic Techn., Lyon, France, Springer, 2023, pp. 190–219.
[17]
W. Chongchitmate, Y. Ishai, S. Lu, and R. Ostrovsky, “PSI from ring-OLE,” in Proc. ACM SIGSAC Conf. Comput. Commun. Secur., 2022, pp. 531–545.
[18]
L. Roy, “SoftSpokenOT: Quieter OT extension from small-field silent VOLE in the minicrypt model,” in Proc. 42nd Annu. Int. Cryptol. Conf., Santa Barbara, CA, USA, Springer, 2022, pp. 657–687.
[19]
F. Kerschbaum, E.-O. Blass, and R. A. Mahdavi, “Faster secure comparisons with offline phase for efficient private set intersection,” 2022,.
[20]
V. Kolesnikov, N. Matania, B. Pinkas, M. Rosulek, and N. Trieu, “Practical multi-party private set intersection from symmetric-key techniques,” in Proc. ACM SIGSAC Conf. Comput. Commun. Secur., 2017, pp. 1257–1272.
[21]
O. Nevo, N. Trieu, and A. Yanai, “Simple, fast malicious multiparty private set intersection,” in Proc. ACM SIGSAC Conf. Comput. Commun. Secur., 2021, pp. 1151–1165.
[22]
A. Bay, Z. Erkin, J.-H. Hoepman, S. Samardjiska, and J. Vos, “Practical multi-party private set intersection protocols,” IEEE Trans. Inf. Forensics Secur., vol. 17, pp. 1–15, 2021.
[23]
N. Trieu, A. Yanai, and J. Gao, “Multiparty private set intersection cardinality and its applications,” J.: Proc. Privacy Enhancing Technol., pp. 73–90, 2022.
[24]
P. Miao, S. Patel, M. Raykova, K. Seth, and M. Yung, “Two-sided malicious security for private intersection-sum with cardinality,” in Proc. 40th Annu. Int. Cryptol. Conf., Santa Barbara, CA, USA, Springer, 2020, pp. 3–33.
[25]
A. Kulshrestha and J. Mayer, “Estimating incidental collection in foreign intelligence surveillance: Large-scale multiparty private set intersection with union and sum,” in Proc. 31st USENIX Secur. Symp., 2022, pp. 1705–1722.
[26]
S. Badrinarayanan, P. Miao, S. Raghuraman, and P. Rindal, “Multi-party threshold private set intersection with sublinear communication,” in Proc. 24th IACR Int. Conf. Pract. Theory Public Key Cryptography, Springer, 2021, pp. 349–379.
[27]
Y. Huang, D. Evans, and J. Katz, “Private set intersection: Are garbled circuits better than custom protocols?,” in Proc. Netw. Distrib. Syst. Secur. Symp., 2012.
[28]
N. Chandran, D. Gupta, and A. Shah, “Circuit-PSI with linear complexity via relaxed batch OPPRF,” J.: Proc. Privacy Enhancing Technol., pp. 353–372, 2022.
[29]
B. Pinkas, T. Schneider, O. Tkachenko, and A. Yanai, “Efficient circuit-based PSI with linear communication,” in Proc. 38th Annu. Int. Conf. Theory Appl. Cryptographic Techn., Darmstadt, Germany, Springer, 2019, pp. 122–153.
[30]
B. Pinkas, T. Schneider, C. Weinert, and U. Wieder, “Efficient circuit-based PSI via cuckoo hashing,” in Proc. 37th Annu. Int. Conf. Theory Appl. Cryptographic Techn., Tel Aviv, Israel, Springer, 2018, pp. 125–157.
[31]
Z. Cai, X. Zheng, J. Wang, and Z. He, “Private data trading towards range counting queries in Internet of Things,” IEEE Trans. Mobile Comput., vol. 22, no. 8, pp. 4881–4897, Aug. 2023.
[32]
Y. Ren et al., “DistPreserv: Maintaining user distribution for privacy-preserving location-based services,” IEEE Trans. Mobile Comput., vol. 22, no. 6, pp. 3287–3302, Jun. 2023.
[33]
N. A. Kudryashov, M. A. Chmykhov, and M. Vigdorowitsch, “Analytical features of the SIR model and their applications to COVID-19,” Appl. Math. Modelling, vol. 90, pp. 466–473, 2021. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0307904X20304984
[34]
R. Pagh and F. F. Rodler, “Cuckoo hashing,” in Proc. 9th Annu. Eur. Symp. Algorithms, Århus, Denmark, Springer, 2001, pp. 121–133.
[35]
A. Kirsch, M. Mitzenmacher, and U. Wieder, “More robust hashing: Cuckoo hashing with a stash,” SIAM J. Comput., vol. 39, no. 4, pp. 1543–1561, 2010.
[36]
S. Raghuraman and P. Rindal, “Blazing fast PSI from improved OKVS and subfield VOLE,” in Proc. ACM SIGSAC Conf. Comput. Commun. Secur., 2022, pp. 2505–2517.
[37]
G. Garimella, B. Pinkas, M. Rosulek, N. Trieu, and A. Yanai, “Oblivious key-value stores and amplification for private set intersection,” in Proc. 41st Annu. Int. Cryptol. Conf., Springer, 2021, pp. 395–425.
[38]
D. Rathee et al., “CrypTFlow2: Practical 2-party secure inference,” in Proc. ACM SIGSAC Conf. Comput. Commun. Secur., 2020, pp. 325–342.
[39]
Z. Huang, W.-J. Lu, C. Hong, and J. Ding, “Cheetah: Lean and fast secure Two-Party deep neural network inference,” in Proc. 31st USENIX Secur. Symp., 2022, pp. 809–826.
[40]
B. Pinkas, M. Rosulek, N. Trieu, and A. Yanai, “PSI from paxos: Fast, malicious private set intersection,” in Proc. 39th Annu. Int. Conf. Theory Appl. Cryptographic Techn., Zagreb, Croatia, Springer, 2020, pp. 739–767.
[41]
Israeli ministry of health official COVID-19 dataset. 2020. [Online]. Available: https://data.gov.il/dataset/covid-19
[42]
Y. Zoabi, S. Deri-Rozov, and N. Shomron, “Machine learning-based prediction of COVID-19 diagnosis based on symptoms,” npj Digit. Med., vol. 4, no. 1, pp. 1–5, 2021.
[43]
X. Guo, Y. Han, Z. Liu, D. Wang, Y. Jia, and J. Li, “Birds of a feather flock together: How set bias helps to deanonymize you via revealed intersection sizes,” in Proc. 31st USENIX Secur. Symp., Boston, MA: USENIX Association, 2022, pp. 1487–1504.

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing  Volume 23, Issue 12
Dec. 2024
4601 pages

Publisher

IEEE Educational Activities Department

United States

Publication History

Published: 01 December 2024

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 0
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 14 Feb 2025

Other Metrics

Citations

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media