Efficient Skip Connections Realization for Secure Inference on Encrypted Data

June 11, 2023 Β· Declared Dead Β· πŸ› International Conference on Cyber Security Cryptography and Machine Learning

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Nir Drucker, Itamar Zimerman arXiv ID 2306.06736 Category cs.CR: Cryptography & Security Cross-listed cs.LG Citations 1 Venue International Conference on Cyber Security Cryptography and Machine Learning Last Checked 4 months ago
Abstract
Homomorphic Encryption (HE) is a cryptographic tool that allows performing computation under encryption, which is used by many privacy-preserving machine learning solutions, for example, to perform secure classification. Modern deep learning applications yield good performance for example in image processing tasks benchmarks by including many skip connections. The latter appears to be very costly when attempting to execute model inference under HE. In this paper, we show that by replacing (mid-term) skip connections with (short-term) Dirac parameterization and (long-term) shared-source skip connection we were able to reduce the skip connections burden for HE-based solutions, achieving x1.3 computing power improvement for the same accuracy.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Cryptography & Security

Died the same way β€” πŸ‘» Ghosted