4 papers
Cachemir: Fully Homomorphic Encrypted Inference of Generative Large Language Model with KV Cache
Ye Yu, Yifan Zhou, Yi Chen +3
Generative large language models (LLMs) have revolutionized multiple domains. Modern LLMs predominantly rely on an autoregressive decoding strategy, which generates output tokens s…
Computing in a Faulty Congested Clique
Keren Censor-Hillel, Pedro Soto
We study a Faulty Congested Clique model, in which an adversary may fail nodes in the network throughout the computation. We show that any task of -bit input per node…
Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique
Keren Censor-Hillel, Orr Fischer, Ran Gelles +1
We design a deterministic compiler that makes any computation in the Congested Clique model robust to a constant fraction of adversarial crash faults. In particular, we show…
A Matrix Completion Approach for the Construction of MDP Convolutional Codes
Sakshi Dang, Julia Lieb, Okko Makkonen +2
Maximum Distance Profile (MDP) convolutional codes are an important class of channel codes due to their maximal delay-constrained error correction capabilities. The design of MDP c…