An Efficient Homomorphic Argmax Approximation for Privacy-Preserving Neural Networks

Peng Zhang, Ao Duan, Hengrui Lu

Open source

DOI
10.3390/cryptography8020018
Published
2024-05-01
Container
Cryptography
Publisher
MDPI AG
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.3390/cryptography8020018,
  title = {An Efficient Homomorphic Argmax Approximation for Privacy-Preserving Neural Networks},
  author = {Peng Zhang and Ao Duan and Hengrui Lu},
  year = {2024},
  journal = {Cryptography},
  doi = {10.3390/cryptography8020018},
  url = {https://doi.org/10.3390/cryptography8020018}
}

RIS

TY  - JOUR
TI  - An Efficient Homomorphic Argmax Approximation for Privacy-Preserving Neural Networks
AU  - Peng Zhang
AU  - Ao Duan
AU  - Hengrui Lu
PY  - 2024
JO  - Cryptography
DO  - 10.3390/cryptography8020018
UR  - https://doi.org/10.3390/cryptography8020018
ER  - 

APA

Zhang, P., Duan, A., & Lu, H. (2024). An Efficient Homomorphic Argmax Approximation for Privacy-Preserving Neural Networks. Cryptography. https://doi.org/10.3390/cryptography8020018

Source records