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

Varun Agarwal

dblp:332/3539 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2024
—ORCID · conflict

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

Systems, architecture and hardware · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 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
Cryptographic primitives and cryptanalysis · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 100%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 50% Language models and text generation · 50%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › homomorphic encryption
fully homomorphic encryption
0.612022
Exploring Bitslicing Architectures for Enabling FHE-Assisted Machine Learning · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022
Cryptographic primitives and cryptanalysis
homomorphic encryption
0.612022
Exploring Bitslicing Architectures for Enabling FHE-Assisted Machine Learning · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022
Hardware accelerators and domain-specific architectures
machine learning accelerator
0.612022
Exploring Bitslicing Architectures for Enabling FHE-Assisted Machine Learning · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022
Natural language and speech › Language models and text generation › trustworthy language model
privacy-preserving inference
0.212022
Exploring Bitslicing Architectures for Enabling FHE-Assisted Machine Learning · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022
Machine learning › Probabilistic and Bayesian machine learning
statistical inference
0.212022
Exploring Bitslicing Architectures for Enabling FHE-Assisted Machine Learning · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022

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

quantization · 1.7data packing · 1.7bit-slicing · 1.1bitslicing · 0.6
YearPublicationVenuePosition
2024 Secure chaotic image encryption method using random graph traversal and three step diffusion
Varun Agarwal, Dhirendra Kumar
Multim. Tools Appl.1
2024 Efficient image encryption using the Tinkerbell map in conjunction with linear feedback shift registers
Puneet Kumar Pal, Dhirendra Kumar, Varun Agarwal
Multim. Tools Appl.3
2023 Examinator v3.0: Cheating Detection in Online Take-Home Exams
abstract
Examinator v3.0 detects cheating in online take-home exams by comparing answers and the timestamps they were entered. A web interface enables efficient manual inspection. Use of the tool reveals that certain question types substantially enhance cheating detection, demonstrating the potential of automated algorithmic detection at scale. Examinator v3.0 has analyzed 915,831 pairs of exam submissions across three courses over two semesters at a top U.S. institution, identifying 46 instances of cheating.
Jui-Tse Hung, Christopher Cui, Varun Agarwal, Saurabh Chatterjee, Raghav Apoorv, Rocko Graziano, Thad Starner
L@S3
2022 Exploring Bitslicing Architectures for Enabling FHE-Assisted Machine Learning
abstract
Homomorphic encryption (HE) is the ultimate tool for performing secure computations even in untrusted environments. Application of HE for deep learning (DL) inference is an active area of research, given the fact that DL models are often deployed in untrusted environments (e.g., third-party servers) yet inferring on private data. However, existing HE libraries [somewhat (SWHE), leveled (LHE) or fully homomorphic (FHE)] suffer from extensive computational and memory overhead. Few performance optimized high-speed homomorphic libraries are either suffering from certain approximation issues leading to decryption errors or proven to be insecure according to recent published attacks. In this article, we propose architectural tricks to achieve performance speedup for encrypted DL inference developed with exact HE schemes without any approximation or decryption error in homomorphic computations. The main idea is to apply quantization and suitable data packing in the form of bitslicing to reduce the costly noise handling operation, Bootstrapping while achieving a functionally correct and highly parallel DL pipeline with a moderate memory footprint. Experimental evaluation on the MNIST dataset shows a significant ( $37\times$ ) speedup over the nonbitsliced versions of the same architecture. Low memory bandwidths (700 MB) of our design pipelines further highlight their promise toward scaling over larger gamut of Edge-AI analytics use cases.
Soumik Sinha, Sayandeep Saha, Manaar Alam, Varun Agarwal, Ayantika Chatterjee, Anoop Mishra, Deepak Khazanchi, Debdeep Mukhopadhyay
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.4