arXiv Machine Learning
Tempora-Fusion: Time-Lock Puzzle with Efficient Verifiable Homomorphic Linear Combination
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
Hugging Face Trending Papers
Sep 9
Maverick: Private and Verifiable LLM Inference Made Practical via Matrix-Vector Multiplication Delegation
Open-source large language models (LLMs) are increasingly competitive with closed-source models while offering transparency and the ability to run inference without exposing user inputs to a service p...
arXiv Machine Learning
Sep 3
Pushing Forward Multi-Secret-Key Homomorphic Encryption for Private Average Aggregation
arXiv:2609. 01945v1 Announce Type: cross Abstract: Federated Learning enables multiple clients to train a shared model while keeping their local datasets isolated.
arXiv AI
Jun 9
FuseFSS: Efficient Secure LLM Inference with Function Secret Sharing
arXiv:2606. 09551v1 Announce Type: cross Abstract: Two-server secure inference allows a client to query a hosted large language model (LLM) without revealing prompts or embeddings.
arXiv AI
Oct 31
Efficient Scalable Oversight via Rewinding
The paper introduces Rewindable Interactive Proofs (RIPs), a new model for scalable oversight where a weak verifier can rewind a powerful AI prover to an earlier state during interaction. RIPs enable verification of oracle‑aided computations that are robust to small changes in oracle answers, achieving near‑linear verifier time without relying on cryptography. The authors provide a construction, implement it on MNIST, and demonstrate that RIPs can outperform existing proof systems in practice.
arXiv AI
Aug 5
Privacy-Preserving AI Verification via Minimal Information Disclosure
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.
Hugging Face Trending Papers
Oct 29
Efficient Scalable Oversight via Rewinding
The paper introduces Rewindable Interactive Proofs (RIPs), a new model for scalable oversight where a weak verifier can rewind a powerful AI prover to an earlier state during interaction. RIPs enable efficient verification of computations whose outputs are robust to small changes in oracle answers, achieving near-linear verifier time without relying on cryptography. The authors implement the protocol, demonstrate a preliminary MNIST experiment, and show that an RIP can outperform a state‑of‑the‑art deployed proof system.