arXiv:2607. 29221v1 Announce Type: cross Abstract: We address the challenge of securely and efficiently outsourcing AI computations from a trusted but computationally weak client to an untrusted but powerful server, in the setting where the client holds both the input and the model, and the server must learn neither.
By James Hsin-yu Chiang, Sheila Zingg, Kari Kostiainen, Srdjan Capkun
arXiv:2606. 00279v1 Announce Type: cross Abstract: Verifying claims about AI workloads is a pre- requisite for credible AI governance of covert adversaries (who comply with monitoring only when detection likelihood is high), yet the ap- parent non-determinism of GPU floating-point arithmetic forces auditors to accept approximate output matches.
By Naci Cankaya
arXiv:2607. 04819v1 Announce Type: new Abstract: Fully homomorphic encryption (FHE) enables computation on encrypted data, but practical encrypted Transformer inference is bottlenecked by the sequential composition of many nonlinear blocks.
By Ligong Han, Kai Xu, Hao Wang, Ruijiang Gao, Akash Srivastava
arXiv:2603. 18046v2 Announce Type: replace-cross Abstract: We present NanoZK, a zero-knowledge proof system for verifiable LLM inference: clients and third-party auditors check that a provider executed the advertised model on a committed input without learning weights or activations.
By Zhaohui Wang
arXiv:2505. 17623v2 Announce Type: replace-cross Abstract: Verifiable computing (VC) has gained prominence in decentralized machine learning systems, where resource-intensive tasks like deep neural network (DNN) inference are offloaded to external participants due to blockchain limitations.
By Ali Rahimi, Babak H. Khalaj, Mohammad Ali Maddah-Ali
arXiv:2607. 23478v1 Announce Type: cross Abstract: Fully homomorphic encryption (FHE) provides strong cryptographic guarantees for private inference, but deploying transformer models under FHE remains prohibitively expensive.
By Jianhang Xie, Sicheng Tan, Vishnu Naresh Boddeti, Zhichao Lu
arXiv:2605. 24033v2 Announce Type: replace Abstract: Mechanistic interpretability typically discovers circuits and then argues what they do from examples and ablations.
By Neel Somani
arXiv:2606. 16461v1 Announce Type: new Abstract: Running large language models locally is often impractical, pushing inference on sensitive text to third-party providers.
By Alexander Yukhimchuk, Andrey Shulga, Mladen Kolar, Martin Tak\'a\v{c}
arXiv:2606. 29389v1 Announce Type: cross Abstract: In recent work it has been shown that colluding AI agents can use steganographic methods to exchange malicious information.
By Stefan Domunco, Andis Draguns, Philip Torr, Isaac Robinson, Christian Schroeder de Witt
arXiv:2608. 02774v1 Announce Type: cross Abstract: AI verification crosses a trust boundary: a verifier must learn enough to establish an authorized claim, yet the same evidence can reveal sensitive details about the model, workload, or hardware.
By Sleem Abdelghafar, Gabriel Kulp
arXiv:2606. 23768v1 Announce Type: cross Abstract: We propose cryptographic certificates of validity for agentic AI systems.
By Murdoch J. Gabbay
arXiv:2510. 16028v4 Announce Type: replace-cross Abstract: Neural networks increasingly run on hardware outside the user's control (cloud GPUs, inference marketplaces).
By Jianzhu Yao, Hongxu Su, Taobo Liao, Zerui Cheng, Huan Zhang, Xuechao Wang, Pramod Viswanath