7 citations · 7 across the 8 of their papers we have counts for
7 papers · 1 filter
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…
Efficient Arithmetic-and-Comparison Homomorphic Encryption with Space Switching
Erwin Eko Wahyudi, Yan Solihin, Qian Lou
Fully homomorphic encryption (FHE) enables computation on encrypted data without decryption, making it central to privacy-preserving applications. However, no existing scheme effic…
Reliability Analysis of Fully Homomorphic Encryption Systems Under Memory Faults
Rian Adam Rajagede, Yan Solihin
Fully Homomorphic Encryption (FHE) represents a paradigm shift in cryptography, enabling computation directly on encrypted data and unlocking privacy-critical computation. Despite…
Securing Transformer-based AI Execution via Unified TEEs and Crypto-protected Accelerators
Jiaqi Xue, Yifei Zhao, Mengxin Zheng +3
Recent advances in Transformer models, e.g., large language models (LLMs), have brought tremendous breakthroughs in various artificial intelligence (AI) tasks, leading to their wid…
zkVC: Fast Zero-Knowledge Proof for Private and Verifiable Computing
Yancheng Zhang, Mengxin Zheng, Xun Chen +5
In the context of cloud computing, services are held on cloud servers, where the clients send their data to the server and obtain the results returned by server. However, the compu…
DataSeal: Ensuring the Verifiability of Private Computation on Encrypted Data
Muhammad Husni Santriaji, Jiaqi Xue, Qian Lou +1
Fully Homomorphic Encryption (FHE) allows computations to be performed directly on encrypted data without needing to decrypt it first. This "encryption-in-use" feature is crucial f…