ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

~ similar to 2610.26442· 20 results

cs.AIcs.CRMar 26, 2026

On the Foundations of Trustworthy Artificial Intelligence

TJ Dunham

The paper proves that platform-deterministic inference is a necessary and sufficient condition for trustworthy AI, establishing that AI trust fundamentally relies on consistent arithmetic.

View →
cs.DScs.LGstat.MLTheoreticalRecentJun 9, 2026

Fixed-Parameter Tractability of Private Synthetic Data Generation

Badih Ghazi, Cristóbal Guzmán, Pritish Kamath, Alexander Knop +2 more

The paper studies the problem of generating synthetic data under differential privacy and achieves fixed-parameter tractability.

View →
cs.CCTheoreticalRecentNov 12, 2026

Computation with Backward Feedback: Power, Observation, and Cost

Saman Farhat, Farzad Didehvar

This paper studies the benefits and limitations of feedback in computation, specifically in the context of deterministic programs with random clock movements.

View →
cs.CRMar 31, 2026

Beyond Latency: A System-Level Characterization of MPC and FHE for PPML

Pengzhi Huang, Kiwan Maeng, G. Edward Suh

This paper provides a comprehensive, system-level comparison of MPC and FHE for Privacy-Preserving Machine Learning (PPML) across various models and environments, moving beyond single-metric latency a…

View →
cs.CRcs.LGMar 24, 2026

Combinatorial Privacy: Private Multi-Party Bitstream Grand Sum by Hiding in Birkhoff Polytopes

Praneeth Vepakomma

The paper introduces PolyVeil, a protocol for private Boolean summation that uses permutation matrices in the Birkhoff polytope, achieving strong security guarantees while highlighting a fundamental t…

View →
cs.CCTheoreticalRecentJul 9, 2026

QMA Lower Bounds for Batch Verification via Approximate Degree

Mark Bun, Mandar Juvekar, Samuel King

The paper studies the resources required to batch verify Boolean functions and provides lower bounds on the witness-query tradeoff based on approximate degree.

View →
cs.CRApr 20, 2026

From Finite Enumeration to Universal Proof: Ring-Theoretic Foundations for PQC Hardware Masking Verification

Ray Iskander, Khaled Kirah

The paper provides the first machine-checked universal proof, using ring theory, that value-independence implies identical marginal distributions for arithmetic masking, thereby extending the verifica…

View →
eess.SYcs.CRMar 24, 2026

Secure Two-Party Matrix Multiplication from Lattices and Its Application to Encrypted Control

Kaoru Teranishi

The paper proposes a provably secure, single-round two-party computation protocol for approximate matrix multiplication using lattice-based cryptography, demonstrated for secure control law implementa…

View →
cs.CRcs.PFEmpiricalRecentOct 10, 2026

StateSync-GKR: Design and Evaluation of a Reusable Sparse GKR Engine

Jinwook Kim

StateSync-GKR is presented, a reusable proof engine that conserves memory and reduces repeated setup for authenticated state transitions.

View →
quant-phcs.ETcs.SEEmpiricalRecentJun 15, 2026

How Many Shots Are Enough for a Quantum Circuit?

Giuseppe Bisicchia, Alessandro Bocci, Ernesto Pimentel, Antonio Brogi

This paper introduces IncrementalExecution, a novel online framework for optimising the number of shots needed to meet a target accuracy in quantum algorithms.

View →
cs.LGcs.CLcs.CRApr 8, 2026

On the Price of Privacy for Language Identification and Generation

Xiaoyu Li, Andi Han, Jiaojiao Jiang, Junbin Gao

The paper quantifies the cost of privacy in language identification and generation using differentially private (DP) methods, finding that the cost is surprisingly mild, particularly absent under appr…

View →
cs.CRcs.LGMar 20, 2026

TAPAS: Efficient Two-Server Asymmetric Private Aggregation Beyond Prio(+)

Harish Karthikeyan, Antigoni Polychroniadou

TAPAS introduces an efficient, asymmetric two-server private aggregation scheme that significantly reduces computational and communication costs for large-scale federated learning compared to existing…

View →
cs.CRRecentMay 28, 2026

Scarcity Is Not Enough: An Impossibility Result for Linear Sybil Cost Under Parallelizable Resources

Homayoun Maleki, Nekane Sainz, Jon Legarda, Igor Santos-Grueiro

The paper proves that for resources with structural parallelizability (like divisibility and transferability), it is impossible to enforce a linear cost for concentrating influence, demonstrating that…

View →
cs.CRcs.ITMay 20, 2026

Information Leakage Envelopes

Sara Saeidian, Carlos Pinzón, Catuscia Palamidessi

The paper introduces the PML envelope, a novel definition that provides a robust and operationally meaningful measure of information leakage about a secret, satisfying both post-processing robustness…

View →
cs.ARcs.CREmpiricalRecentOct 20, 2026

Interflow: Breaking the Offline-Online Barrier for Private AI at the Edge

Hanieh Totonchi Asl, Ebrahim Nouri, Zhuoran Li, Danella Zhao

This paper proposes Interflow, an algorithm-hardware co-design that improves the efficiency of privacy-preserving machine learning by pipelining correlated randomness generation with online execution.

View →
cs.CRcs.LGMar 19, 2026

Towards Verifiable AI with Lightweight Cryptographic Proofs of Inference

Pranay Anchuri, Matteo Campanelli, Paul Cesaretti, Rosario Gennaro +3 more

The paper introduces a lightweight, sampling-based cryptographic protocol for verifiable AI inference that drastically reduces proving overhead from minutes to milliseconds by leveraging statistical p…

View →
cs.CCquant-phTheoreticalRecentJun 8, 2026

Probabilistically Checking Quantum Proofs, with Interaction

Baocheng Sun, Thomas Vidick

The paper develops a quantum analogue of interactive oracle proofs (qIOP) for any language in QMA, with polynomial communication and polylogarithmic qubit queries.

View →
cs.DScs.CRcs.DBTheoreticalRecentJun 10, 2026

A Fast Gaussian Mechanism under Continual Observation, with Applications

Rasmus Pagh, Sia Sejer

The paper presents a new method for privately releasing a k-dimensional vector under updates, improving the time complexity of sampling a noise vector from the binary tree mechanism with Gaussian nois…

View →