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

~ similar to 2603.21833v1· 20 results

cs.CRRecentApr 20, 2026

Audit-or-Cast: Enforcing Honest Elections with Privacy-Preserving Public Verification

Aman Rojjha, Gaurang Tandon, Varul Srivastava, Kannan Srinathan

The paper introduces ACE, a novel voting protocol that achieves end-to-end verifiability and strong voter privacy by combining tally-hiding aggregation with an Audit-or-Cast challenge, eliminating the…

View →
cs.CRRecentMar 31, 2026

On the Necessity of Pre-agreed Secrets for Thwarting Last-minute Coercion: Vulnerabilities and Lessons From the Loki E-voting Protocol

Jingxin Qiao, Myrto Arapinis, Thomas Zacharias

This paper analyzes the Loki e-voting protocol, demonstrating that while it attempts to solve coercion-resistance without pre-agreed secrets, it remains vulnerable to specific attacks, suggesting that…

View →
cs.CRcs.CYeess.SPRecentMay 24, 2026

Pre-Characterization of Electromagnetic Side-Channel Leakage Using Publicly Available Information: A Case Study on E-Voting Interfaces

Leonardo Teodoro, Kemuel L. Vieira, Saulo Queiroz

The paper demonstrates that the Brazilian e-Voting Machine interface generates a simple and highly distinctive electromagnetic spectral signature, raising significant concerns about its susceptibility…

View →
cs.AIcs.CRRecentMar 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.CRRecentMay 4, 2026

SILMARILS: Information-Theoretic and Quantum-Secure Designated-Verifier Signatures

Hassan Khodaiemehr, Khadijeh Bagheri, Chen Feng, Dariia Porechna

SILMARILS presents a quantum-secure, information-theoretic designated-verifier (DV) signature scheme built on a minimal algebraic core, suitable for lightweight blockchain authentication.

View →
cs.CRcs.LORecentMar 24, 2026

BlindMarket: Enabling Verifiable, Confidential, and Traceable IP Core Distribution in Zero-Trust Settings

Zhaoxiang Liu, Samuel Judson, Raj Dutta, Mark Santolucito +2 more

BlindMarket is a zero-trust framework that enables the verifiable, confidential, and traceable distribution of hardware IP cores between vendors and users.

View →
cs.GTcs.CRRecentMay 18, 2026

Concave is the New Linear: The Impossibility of Anti-Plutocratic DAO Governance

Austin Bennett, Preston Vander Vos, Duc V. Le, Mira Belenkiy

The paper proves that any voting rule based solely on wallet balance, including anti-plutocratic mechanisms like Quadratic Voting, is fundamentally vulnerable to Sybil attacks on permissionless blockc…

View →
cs.CRcs.LGRecentMay 29, 2026

Bit-Exact AI Inference Verification Without Performance Tradeoffs

Naci Cankaya

The paper proposes a method for bit-exact verification of AI inference outputs without sacrificing performance, demonstrating that deterministic, precise re-computation is possible even across differe…

View →
cs.CRcs.LGRecentMar 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.CRRecentMay 19, 2026

MultiBallot: Verifiable and privacy-preserving E-Collecting in the Swiss setting

Florian Moser, Léo Louistisserand

The paper proposes a secure, verifiable, and privacy-preserving e-collecting protocol tailored for the Swiss political system, guaranteeing participation privacy even without assuming an anonymous com…

View →
cs.CRcs.NIRecentApr 5, 2026

Search-Bound Proximity Proofs: Binding Encrypted Geographic Search to Zero-Knowledge Verification

Yoshiyuki Ootani

The paper introduces Search-Bound Proximity Proofs (SBPP) to close an authorization provenance gap in encrypted geographic search by binding zero-knowledge proofs to specific search sessions for audit…

View →
cs.CRRecentMay 18, 2026

Sublinear Risk-Limiting Audits from Direct Ballot Selection and Statistical Ballot Manifests

Benjamin Fuller, Abigail Harrison, Alexander Russell

The paper introduces two novel risk-limiting audit techniques—statistical manifest generation and direct ballot selection—that significantly reduce the computational complexity and time required for p…

View →
cs.ETcs.CRcs.CVRecentMay 16, 2026

BIDO: A Biometric Identity Online Authentication Framework

Aditya Mithra, Sibi Chakkaravarthy S, Srinivas Kankanala

BIDO introduces a device-free, NIST AAL2-compliant biometric authentication standard that deterministically generates ephemeral ECDSA keys from live biometric measurements, eliminating the need for st…

View →
cs.CRRecentMay 5, 2026

ZK-Value: A Practical Zero-Knowledge System for Verifiable Data Valuation

Zhaoyu Wang, Pingchuan Ma, Zhantong Xue, Yuguang Zhou +3 more

ZK-Value introduces a practical, scalable zero-knowledge system for calculating data valuations (Shapley values) in data marketplaces, significantly reducing proving time while maintaining high accura…

View →
cs.CRRecentApr 26, 2026

Time-Delayed Publicly Verifiable Quantum Computation for Classical Verifiers

Ameer Mohammed, Aydin Abadi, Jaffer Mahdi

The paper proposes a practical, non-interactive scheme for publicly verifying quantum computations delegated from a classical user to a quantum prover, by relaxing the requirement to time-delayed veri…

View →
cs.CRRecentMay 28, 2026

bpK#: Delegatable Pseudonyms And Their Applications to National eID Systems

Stephan Krenn, Doryan Lesaignoux, Sebastian Ramacher

The paper proposes bPk#, a distributed architecture for pseudonyms that enhances privacy and availability in national eID systems by delegating pseudonym computation rights to users and service provid…

View →
cs.CRcs.AIcs.DCRecentJun 2, 2026

Notarized Agents: Receiver-Attested Confidential Receipts for AI Agent Actions

Juan Figuera

The paper proposes Sello, a novel protocol that allows an owner to reconstruct a tamper-evident and verifiable record of AI agent actions by having a trusted receiver sign and publish receipts of the…

View →
cs.CRcs.CYRecentApr 8, 2026

Aegon: Auditable AI Content Access with Ledger-Bound Tokens and Hardware-Attested Mobile Receipts

Amrish Baskaran, Nirbhay Pherwani, Raghul Krishnan

Aegon is a new protocol that provides an auditable, tamper-evident infrastructure for tracking AI content licensing transactions and compliance receipts.

View →
cs.CRcs.AIRecentMay 7, 2026

From Specification to Deployment: Empirical Evidence from a W3C VC + DID Trust Infrastructure for Autonomous Agents

Lars Kersten Kroehl

The paper introduces MolTrust, a production-deployed trust infrastructure built on W3C standards (VCs and DIDs) that provides a verifiable, multi-layered authorization framework for autonomous AI agen…

View →
cs.CRRecentApr 23, 2026

Physically Unclonable Functions for Secure IoT Authentication and Hardware-Anchored AI Model Integrity

Maryam Taghi Zadeh, Mohsen Ahmadi

This survey reviews hardware-rooted trust mechanisms, such as PUFs and TPMs, demonstrating that hardware-based solutions are superior to software-only methods for ensuring secure authentication and AI…

View →