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

~ similar to 2605.11715v1· 20 results

cs.CRRecentMay 3, 2026

Obscura: Privacy-Preserving Protocol for the Algorand Blockchain Using LSAG Ring Signatures

Navid Azimi

Obscura is a novel, decentralized privacy protocol for the Algorand blockchain that achieves transaction anonymity using LSAG ring signatures, overcoming the limitations of existing zk-SNARK-based met…

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.CRRecentMay 2, 2026

Write-Domain Separation and Non-Custodial Enforcement: A Structural Impossibility in Account-Based Ledgers, with a Commitment-Based Construction

Matthias Hauser

The paper proves that standard account-based ledgers cannot non-custodially enforce asset disposition, and introduces a novel commitment-based ledger structure, the 'envelope,' that achieves this capa…

View →
cs.CRcs.ETRecentApr 6, 2026

DAO to (Anonymous) DAO Transactions

Minfeng Qi, Lin Zhong, Qin Wang

The paper introduces extsc{Dao$^2$}, a framework enabling secure, threshold-controlled payments from one Decentralized Autonomous Organization (DAO) to another, supporting both traceable and anonymou…

View →
cs.CRcs.CYcs.DCRecentMar 26, 2026

zk-X509: Privacy-Preserving On-Chain Identity from Legacy PKI via Zero-Knowledge Proofs

Yeongju Bak

zk-X509 is a privacy-preserving identity system that uses zero-knowledge proofs to prove ownership of standard X.509 certificates on a public blockchain without revealing private keys or personal data…

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.DCcs.CRRecentApr 26, 2026

Towards System-Oriented Formal Verification of Local-First Access Control

Florian Jacob, Johanna Stuber, Hannes Hartenstein

The paper proposes a bottom-up, system-oriented approach to formally verify authorization algorithms for large-scale, Byzantine fault-tolerant local-first systems, using Rust and the Verus framework.

View →
cs.CRRecentMay 18, 2026

DARTIC: Decentralized Anonymous Reputation at Scale for Trustworthy Crowdsourcing

Mouhamed Amine Bouchiha, Mourad Rabah, Ronan Champagnat, Abdelaziz Amara Korba +1 more

The paper introduces DARTIC, a decentralized, anonymous, and scalable reputation framework that allows on-chain crowdsourcing to maintain accountability and trust while preserving user privacy.

View →
cs.CRcs.AIRecentMay 31, 2026

SS-ZKR: Spatial-Semantic Zero-Knowledge Routing for Privacy-Preserving Multi-Agent Collaboration

Hassan Touheed

SS-ZKR is a novel, three-mechanism protocol that enables privacy-preserving, content-based semantic routing of agent payloads across organizational trust boundaries without requiring the intermediary…

View →
cs.CRcs.AIRecentMay 31, 2026

SS-ZKR: Spatial-Semantic Zero-Knowledge Routing for Privacy-Preserving Multi-Agent Collaboration

Hassan Touheed

SS-ZKR is a novel, three-mechanism protocol that enables privacy-preserving, content-based semantic routing of agent payloads across organizational trust boundaries without requiring the intermediary…

View →
cs.GTcs.CRRecentApr 3, 2026

Trustless Provenance Trees: A Game-Theoretic Framework for Operator-Gated Blockchain Registries

Ian C. Moore

The paper proposes a trustless framework using dual-layer cryptographic commitments to solve the operator-gating problem in blockchain provenance trees, ensuring verifiable user attribution even when…

View →
cs.CRRecentMay 26, 2026

Privacy-Preserving Screening for Record Linkage

Chenyu Huang, Fan Zhang, Huangxun Chen, Yongjun Zhao +3 more

The paper introduces Appraisal, a novel Screening-then-Linkage framework (PPRS) that significantly improves the scalability and efficiency of Privacy-Preserving Record Linkage by incorporating a light…

View →
cs.CRRecentMar 23, 2026

TALUS: Threshold ML-DSA with One-Round Online Signing via Boundary Clearance and Carry Elimination

Leo Kao

TALUS is the first threshold ML-DSA construction that achieves one-round online signing with high success rates by introducing Boundary Clearance and Carry Elimination techniques.

View →
cs.CRRecentMar 26, 2026

Efficient ML-DSA Public Key Management Method with Identity for PKI and Its Application

Penghui Liu, Yi Niu, Xiaoxiong Zhong, Jiahui Wu +3 more

The paper proposes a novel identity-based public key management framework, IPK-pq, utilizing NIST ML-DSA and random matrix theory to enhance the scalability and efficiency of Public Key Infrastructure…

View →
cs.CRcs.CYRecentApr 22, 2026

Layer 2 Blockchains Simplified: A Survey of Vector Commitment Schemes, ZKP Frameworks, Layer-2 Data Structures and Verkle Trees

Ekleen Kaur, Marko Suvajdzic

This paper provides the first unified, security-focused survey that rigorously maps Layer-2 (L2) blockchain architecture to its underlying cryptographic security assumptions.

View →
cs.CRRecentApr 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 →
cs.CRcs.ITRecentMar 24, 2026

Canonical Byte-String Encoding for Finite-Ring Cryptosystems

Kyrylo Riabov, Serhii Kryvyi

The paper introduces the base-m length codec, a canonical and robust encoding scheme that maps byte strings to lists of residues modulo m, essential for finite-ring cryptosystems.

View →
cs.CRRecentJun 1, 2026

The Unicity Execution Layer

Ahto Buldas, Dirk Draheim, Mike Gault, Risto Laanoja +2 more

The paper introduces the Unicity Execution Layer, a secure, modular component that enables trustless off-chain transactions while guaranteeing double-spending prevention and enhancing user privacy.

View →
cs.CRcs.ITRecentMar 23, 2026

Asymptotically Ideal Hierarchical Secret Sharing Based on CRT for Integer Ring

Jian Ding, Cheng Wang, Hongju Li, Cheng Shu +1 more

The paper proposes two new asymptotically ideal and secure Hierarchical Secret Sharing (HSS) schemes, disjunctive and conjunctive, utilizing the Chinese Remainder Theorem (CRT) over an integer ring an…

View →
cs.CRcs.AIRecentMar 25, 2026

AIP: Agent Identity Protocol for Verifiable Delegation Across MCP and A2A

Sunil Prakash

The paper introduces AIP, a novel protocol using Invocation-Bound Capability Tokens (IBCTs) to provide verifiable identity and secure delegation across Model Context Protocol (MCP) and Agent-to-Agent…

View →