Cheetah: Lean and fast secure {Two-Party} deep neural network inference

Z Huang, W Lu, C Hong, J Ding - 31st USENIX Security Symposium …, 2022 - usenix.org
Secure two-party neural network inference (2PC-NN) can offer privacy protection for both the
client and the server and is a promising technique in the machine-learning-as-a-service …

Towards practical secure neural network inference: the journey so far and the road ahead

ZÁ Mann, C Weinert, D Chabal, JW Bos - ACM Computing Surveys, 2023 - dl.acm.org
Neural networks (NNs) have become one of the most important tools for artificial
intelligence. Well-designed and trained NNs can perform inference (eg, make decisions or …

Indistinguishability obfuscation from well-founded assumptions

A Jain, H Lin, A Sahai - Proceedings of the 53rd Annual ACM SIGACT …, 2021 - dl.acm.org
Indistinguishability obfuscation, introduced by [Barak et. al. Crypto 2001], aims to compile
programs into unintelligible ones while preserving functionality. It is a fascinating and …

{ABY2. 0}: Improved {Mixed-Protocol} secure {Two-Party} computation

A Patra, T Schneider, A Suresh, H Yalame - 30th USENIX Security …, 2021 - usenix.org
Secure Multi-party Computation (MPC) allows a set of mutually distrusting parties to jointly
evaluate a function on their private inputs while maintaining input privacy. In this work, we …

Privacy-Preserving Data-Driven Learning Models for Emerging Communication Networks: A Comprehensive Survey

MM Fouda, ZM Fadlullah, MI Ibrahem… - … Surveys & Tutorials, 2024 - ieeexplore.ieee.org
With the proliferation of Beyond 5G (B5G) communication systems and heterogeneous
networks, mobile broadband users are generating massive volumes of data that undergo …

Elsa: Secure aggregation for federated learning with malicious actors

M Rathee, C Shen, S Wagh… - 2023 IEEE Symposium on …, 2023 - ieeexplore.ieee.org
Federated learning (FL) is an increasingly popular approach for machine learning (ML) in
cases where the training dataset is highly distributed. Clients perform local training on their …

Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for boolean and arithmetic circuits

C Weng, K Yang, J Katz, X Wang - 2021 IEEE Symposium on …, 2021 - ieeexplore.ieee.org
Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …

Ferret: Fast extension for correlated OT with small communication

K Yang, C Weng, X Lan, J Zhang, X Wang - Proceedings of the 2020 …, 2020 - dl.acm.org
Correlated oblivious transfer (COT) is a crucial building block for secure multi-party
computation (MPC) and can be generated efficiently via OT extension. Recent works based …

Mystique: Efficient conversions for {Zero-Knowledge} proofs with applications to machine learning

C Weng, K Yang, X **e, J Katz, X Wang - 30th USENIX Security …, 2021 - usenix.org
Recent progress in interactive zero-knowledge (ZK) proofs has improved the efficiency of
proving large-scale computations significantly. Nevertheless, real-life applications (eg, in the …

Quicksilver: Efficient and affordable zero-knowledge proofs for circuits and polynomials over any field

K Yang, P Sarkar, C Weng, X Wang - Proceedings of the 2021 ACM …, 2021 - dl.acm.org
Zero-knowledge (ZK) proofs with an optimal memory footprint have attracted a lot of
attention, because such protocols can easily prove very large computation with a small …