Yang et al., 2022 - Google Patents
FPGA accelerator for homomorphic encrypted sparse convolutional neural network inferenceYang et al., 2022
View PDF- Document ID
- 14005035461504776513
- Author
- Yang Y
- Kuppannagari S
- Kannan R
- Prasanna V
- Publication year
- Publication venue
- 2022 IEEE 30th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)
External Links
Snippet
Homomorphic Encryption (HE) is a promising solution to the increasing concerns of privacy in machine learning. But HE-based CNN inference remains impractically slow. Pruning can significantly reduce the compute and memory footprint of CNNs. However, homomorphic …
- 230000001537 neural 0 title abstract description 7
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
- G06F17/141—Discrete Fourier transforms
- G06F17/142—Fast Fourier transforms, e.g. using a Cooley-Tukey type algorithm
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
- G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
- G06F7/724—Finite field arithmetic
- G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/58—Random or pseudo-random number generators
- G06F7/582—Pseudo-random number generators
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/76—Architectures of general purpose stored programme computers
- G06F15/80—Architectures of general purpose stored programme computers comprising an array of processing units with common control, e.g. single instruction multiple data processors
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
- H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Reagen et al. | Cheetah: Optimizing and accelerating homomorphic encryption for private inference | |
Roy et al. | FPGA-based high-performance parallel architecture for homomorphic computing on encrypted data | |
Samardzic et al. | F1: A fast and programmable accelerator for fully homomorphic encryption | |
Kim et al. | Ark: Fully homomorphic encryption accelerator with runtime data generation and inter-operation key reuse | |
Wang et al. | Accelerating fully homomorphic encryption using GPU | |
Yang et al. | FPGA accelerator for homomorphic encrypted sparse convolutional neural network inference | |
Wang et al. | Exploring the feasibility of fully homomorphic encryption | |
Fan et al. | Tensorfhe: Achieving practical computation on encrypted data using gpgpu | |
Halevi et al. | Implementing BP-obfuscation using graph-induced encoding | |
Feldmann et al. | F1: A fast and programmable accelerator for fully homomorphic encryption (extended version) | |
Wang et al. | HE-Booster: an efficient polynomial arithmetic acceleration on GPUs for fully homomorphic encryption | |
Shivdikar et al. | Accelerating polynomial multiplication for homomorphic encryption on GPUs | |
CN115622685B (en) | Method, device and system for homomorphic encryption of private data | |
Ahmadzadeh et al. | A high-performance and energy-efficient exhaustive key search approach via GPU on DES-like cryptosystems | |
Xin et al. | A multi-layer parallel hardware architecture for homomorphic computation in machine learning | |
Dai et al. | Accelerating swhe based pirs using gpus | |
Jain et al. | Efficient cnn building blocks for encrypted data | |
Dodmane et al. | Construction of vector space and its application to facilitate bitwise XOR–Free operation to minimize the time complexity | |
Pu et al. | Fastplay-a parallelization model and implementation of smc on cuda based gpu cluster architecture | |
Azad et al. | Rise: Risc-v soc for en/decryption acceleration on the edge for homomorphic encryption | |
Ebel et al. | Orion: A Fully Homomorphic Encryption Compiler for Private Deep Neural Network Inference | |
Neda et al. | CiFlow: Dataflow analysis and optimization of key switching for homomorphic encryption | |
Hu et al. | Efficient homomorphic convolution designs on FPGA for secure inference | |
van der Hagen et al. | Practical encrypted computing for iot clients | |
Cui et al. | High-speed elliptic curve cryptography on the NVIDIA GT200 graphics processing unit |