Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Shashank Balla

dblp:361/1777 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2023
0000-0001-9482-7030ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Privacy and data protection · 61% Cryptographic protocols and secure computation · 39%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection › privacy-preserving computation › encrypted data processing
homomorphic encryption inference
0.712023
HELiKs: HE Linear Algebra Kernels for Secure Inference · CCS 2023
Privacy and data protection
privacy-preserving machine learning
0.712023
HELiKs: HE Linear Algebra Kernels for Secure Inference · CCS 2023
Cryptographic protocols and secure computation › secure arithmetic › secure matrix computation
secure matrix multiplication
0.712023
HELiKs: HE Linear Algebra Kernels for Secure Inference · CCS 2023
Cryptographic protocols and secure computation
secret sharing
0.212023
HELiKs: HE Linear Algebra Kernels for Secure Inference · CCS 2023

Methods — techniques the papers use, named apart from their topics

matrix encoding · 0.7homomorphic encryption · 0.7additive secret sharing · 0.7
YearPublicationVenuePosition
2023 HELiKs: HE Linear Algebra Kernels for Secure Inference
abstract
We introduce HELiKs, a groundbreaking framework for fast and secure matrix multiplication and 3D convolutions, tailored for privacy-preserving machine learning. Leveraging Homomorphic Encryption (HE) and Additive Secret Sharing, HELiKs enables secure matrix and vector computations while ensuring end-to-end data privacy for all parties. Key innovations of the proposed framework include an efficient multiply-accumulate (MAC) design that significantly reduces HE error growth, a partial sum accumulation strategy that cuts the number of HE rotations by a logarithmic factor, and a novel matrix encoding that facilitates faster online HE multiplications with one-time pre-computation. Furthermore, HELiKs substantially reduces the number of keys used for HE computation, leading to lower bandwidth usage during the setup phase. In our evaluation, HELiKs shows considerable performance improvements in terms of runtime and communication overheads when compared to existing secure computation methods. With our proof-of-work implementation (available on GitHub: https://github.com/shashankballa/HELiKs), we demonstrate state-of-the-art performance with up to 32x speedup for matrix multiplication and 27x speedup for 3D convolution when compared to prior art. HELiKs also reduces communication overheads by 1.5x for matrix multiplication and 29x for 3D convolution over prior works, thereby improving the efficiency of data transfer.
Shashank Balla, Farinaz Koushanfar
CCS1