Papers
Topics
Authors
Recent
Search
2000 character limit reached

ppAURORA: Privacy Preserving Area Under Receiver Operating Characteristic and Precision-Recall Curves

Published 17 Feb 2021 in cs.LG and cs.CR | (2102.08788v3)

Abstract: Computing an AUC as a performance measure to compare the quality of different machine learning models is one of the final steps of many research projects. Many of these methods are trained on privacy-sensitive data and there are several different approaches like $\epsilon$-differential privacy, federated machine learning and cryptography if the datasets cannot be shared or used jointly at one place for training and/or testing. In this setting, it can also be a problem to compute the global AUC, since the labels might also contain privacy-sensitive information. There have been approaches based on $\epsilon$-differential privacy to address this problem, but to the best of our knowledge, no exact privacy preserving solution has been introduced. In this paper, we propose an MPC-based solution, called ppAURORA, with private merging of individually sorted lists from multiple sources to compute the exact AUC as one could obtain on the pooled original test samples. With ppAURORA, the computation of the exact area under precision-recall and receiver operating characteristic curves is possible even when ties between prediction confidence values exist. We use ppAURORA to evaluate two different models predicting acute myeloid leukemia therapy response and heart disease, respectively. We also assess its scalability via synthetic data experiments. All these experiments show that we efficiently and privately compute the exact same AUC with both evaluation metrics as one can obtain on the pooled test samples in plaintext according to the semi-honest adversary setting.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (21)
  1. High-throughput semi-honest secure three-party computation with an honest majority. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pages 805–817, 2016.
  2. Differential privacy for classifier evaluation. In Proceedings of the 8th ACM Workshop on Artificial Intelligence and Security, pages 15–23, 2015.
  3. Flash: fast and robust framework for privacy-preserving machine learning. Proceedings on Privacy Enhancing Technologies, 2020(2):459–480, 2020.
  4. Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. In 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, 14-17 October 2001, Las Vegas, Nevada, USA, pages 136–145. IEEE Computer Society, 2001. doi: 10.1109/SFCS.2001.959888. URL https://doi.org/10.1109/SFCS.2001.959888.
  5. A stability-based validation procedure for differentially private machine learning. In Advances in Neural Information Processing Systems, pages 2652–2660, 2013.
  6. Differentially private regression diagnostics. In ICDM, pages 81–90, 2016.
  7. New primitives for actively-secure mpc over rings with applications to private machine learning. In 2019 IEEE Symposium on Security and Privacy (SP), pages 1102–1120. IEEE, 2019.
  8. How to play any mental game. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC ’87, pages 218–229, New York, NY, USA, 1987. ACM. ISBN 0-89791-221-7. doi: 10.1145/28395.28420. URL http://doi.acm.org/10.1145/28395.28420.
  9. {{\{{GAZELLE}}\}}: A low latency framework for secure neural network inference. In 27th {normal-{\{{USENIX}normal-}\}} Security Symposium ({normal-{\{{USENIX}normal-}\}} Security 18), pages 1651–1669, 2018.
  10. Deepfed: Federated deep learning for intrusion detection in industrial cyber–physical systems. IEEE Transactions on Industrial Informatics, 17(8):5615–5624, 2020.
  11. Yehuda Lindell. How to simulate it - A tutorial on the simulation proof technique. In Yehuda Lindell, editor, Tutorials on the Foundations of Cryptography, pages 277–346. Springer International Publishing, 2017. doi: 10.1007/978-3-319-57048-8_6. URL https://doi.org/10.1007/978-3-319-57048-8_6.
  12. An examination of data confidentiality and disclosure issues related to publication of empirical roc curves. Academic radiology, 20(7):889–896, 2013.
  13. Aby3: A mixed protocol framework for machine learning. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pages 35–52, 2018.
  14. Secureml: A system for scalable privacy-preserving machine learning. In 2017 IEEE Symposium on Security and Privacy (SP), pages 19–38. IEEE, 2017.
  15. A crowdsourcing approach to developing and assessing prediction algorithms for aml prognosis. PLoS computational biology, 12(6):e1004890, 2016.
  16. BLAZE: blazing fast privacy-preserving machine learning. In 27th Annual Network and Distributed System Security Symposium, NDSS 2020, San Diego, California, USA, February 23-26, 2020. The Internet Society, 2020.
  17. Differentially private auc computation in vertical federated learning. arXiv preprint arXiv:2205.12412, 2022.
  18. CECILIA: comprehensive secure machine learning framework. CoRR, abs/2202.03023, 2022. URL https://arxiv.org/abs/2202.03023.
  19. Securenn: Efficient and private neural network training. IACR Cryptol. ePrint Arch., 2018:442, 2018.
  20. Jacob Whitehill. How does knowledge of the auc constrain the set of possible ground-truth labelings? In Proceedings of the AAAI Conference on Artificial Intelligence, volume 33, pages 5425–5432, 2019.
  21. Andrew Chi-Chih Yao. How to generate and exchange secrets. In Proceedings of the 27th Annual Symposium on Foundations of Computer Science, SFCS ’86, pages 162–167, Washington, DC, USA, 1986. IEEE Computer Society. ISBN 0-8186-0740-8. doi: 10.1109/SFCS.1986.25. URL https://doi.org/10.1109/SFCS.1986.25.
Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.