3 citations · 3 across the 4 of their papers we have counts for
4 papers
Memory-Efficient Designs for Word-Wise Universal Fully Homomorphic Encryption
Ardhi Wiratama Baskara Yudha, Erwin Eko Wahyudi, Rian Adam Rajagede +2
Fully Homomorphic Encryption (FHE) enables computation on encrypted data, preserving privacy throughout analysis. While its privacy is very strong, FHE is much slower to execute th…
GPU Acceleration of Sparse Fully Homomorphic Encrypted DNNs
Lara D'Agata, Carlos Agulló-Domingo, Óscar Vera-López +7
Fully homomorphic encryption (FHE) has recently attracted significant attention as both a cryptographic primitive and a systems challenge. Given the latest advances in accelerated…
BoostCom: Towards Efficient Universal Fully Homomorphic Encryption by Boosting the Word-wise Comparisons
Ardhi Wiratama Baskara Yudha, Jiaqi Xue, Qian Lou +2
Fully Homomorphic Encryption (FHE) allows for the execution of computations on encrypted data without the need to decrypt it first, offering significant potential for privacy-prese…
vFHE: Verifiable Fully Homomorphic Encryption with Blind Hash
Qian Lou, Muhammad Santriaji, Ardhi Wiratama Baskara Yudha +2
Fully homomorphic encryption (FHE) is a powerful encryption technique that allows for computation to be performed on ciphertext without the need for decryption. FHE will thus enabl…