Skip to main content
Search

# CKKS

2 related articles

Subscribe to updates
  1. arXiv

    Encrypted BERT-base inference drops the format conversions: MOAI amortizes 2.36 minutes per input, 52.8% faster than THOR

    Fully homomorphic encryption lets a cloud evaluate a Transformer directly on ciphertext, but rotations and format conversions have kept it slow. MOAI chains column packing and diagonal packing into one fixed flow across all layers and evaluates Softmax and LayerNorm without rotations, needing only 9,648 homomorphic rotations across all matrix multiplications of BERT-base. On a single A100 GPU its end-to-end evaluation time is 52.8% lower than THOR, amortized to 2.36 minutes per input.

  2. arXiv

    Perseus folds the homomorphic inference stack into one public Python library, and its Llama-3-8B decode beats the fastest known implementation, Sylph

    Homomorphic encryption can run a model directly on ciphertext, but the latency introduced by bootstrapping, the costly operation that refreshes a ciphertext's available multiplication depth, keeps encrypted large models impractical, and existing optimizations sit in different, sometimes closed-source frameworks that are difficult and time-consuming to integrate. Perseus is a public Python library spanning the cryptographic backend, data packing and bootstrap placement, with in-kernel key regeneration, complex-Cachemir packing and bootstrap planning driven by coefficient magnitude and packing periodicity on GPUs. On Llama-3-8B decoding its latency is lower than the fastest known implementation, Sylph, which runs on roughly the same hardware but on the closed-source HEaaN.

You’re all caught up