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

~ similar to 2605.19312v1· 20 results

cs.CRRecentMar 23, 2026

Publicly Understandable Electronic Voting: A Non-Cryptographic, End-to-End Verifiable Scheme

Alon Gat

The paper proposes a non-cryptographic, End-to-End Verifiable (E2E-V) voting scheme that achieves Software-Free Verification (SFV) by allowing voters to audit election integrity using only basic arith…

View →
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.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 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.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.DCcs.CRcs.GTRecentApr 21, 2026

Intercloud: Eventual Consistency for Decentralised Economies via Chilling-Effect Consensus

Gregory Magarshak

Intercloud proposes a decentralized economic network that achieves eventual consistency and security using a novel 'chilling-effect consensus' mechanism, eliminating the need for global coordination.

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

A Complexity Hierarchy of Shuffles in Card-Based Protocols

Tomoki Ono, Suthee Ruangwises

This paper establishes a complexity hierarchy for shuffle operations used in card-based cryptography, classifying them by implementation difficulty and proving separations between these levels.

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

Context-Binding Gaps in Stateful Zero-Knowledge Proximity Proofs: Taxonomy, Separation, and Mitigation

Yoshiyuki Ootani

The paper addresses the vulnerability of zero-knowledge proximity proofs in stateful systems by proposing Zairn-ZKP, a method that embeds operational context (like drop identity and policy version) di…

View →
cs.CRcs.MARecentApr 6, 2026

HDP: A Lightweight Cryptographic Protocol for Human Delegation Provenance in Agentic AI Systems

Asiri Dalugoda

The paper introduces the Human Delegation Provenance (HDP) protocol, a lightweight, token-based cryptographic scheme designed to verify the full, multi-hop chain of human authorization for actions exe…

View →
cs.CRRecentMay 29, 2026

A Moderatorless Protocol for WEREWOLF

Naoki Kitamura, Hironori Kiya, Hirotaka Ono

The paper presents a complete, moderatorless protocol for playing Werewolf using only ordinary playing cards, eliminating the need for a trusted third party or digital devices.

View →
cs.CRcs.SERecentApr 30, 2026

zkSBOM: Privacy-Preserving SBOM Sharing with Zero-Knowledge Sets

Tom Sorger, Eric Cornelissen, Aman Sharma, Javier Ron +2 more

zkSBOM introduces a zero-knowledge mechanism for sharing Software Bills of Materials (SBOMs) that allows consumers to check for vulnerabilities without suppliers revealing the full, sensitive contents…

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.HCcs.CRcs.CYRecentMay 23, 2026

Modernizing User Privacy Preference Measurement through GPPI: A GDPR-aligned Privacy Preference Item Bank

Yahya Hmaiti, Mykola Maslych, Amirpouya Ghasemaghaei, Trung Cuong Dang +3 more

The paper develops a comprehensive, GDPR-aligned item bank of 527 statements to accurately measure user preferences regarding specific regulatory protections, addressing a gap left by older privacy me…

View →
cs.CRcs.DBcs.LGRecentApr 14, 2026

VeriX-Anon: A Multi-Layered Framework for Mathematically Verifiable Outsourced Target-Driven Data Anonymization

Miit Daga, Swarna Priya Ramu

VeriX-Anon is a multi-layered framework that provides mathematically verifiable assurance that outsourced data anonymization (k-anonymization) was executed correctly, achieving high detection rates ag…

View →
cs.CYcs.CRcs.ETRecentMay 27, 2026

Local Privacy Laws in a Globalized World

Shantanu Sharma, Ethan Myers, Lorenzo De Carli, Ritwik Banerjee +1 more

The paper addresses the over-reliance on GDPR in digital privacy research by systematically normalizing heterogeneous global data protection laws into a unified, data-lifecycle-aligned abstraction.

View →
cs.CRRecentApr 11, 2026

Automatic Teller Machines for Offline E-cash

Anrin Chakraborti, Qingzhao Zhang, Jingjia Peng, Morley Mao +1 more

The paper proposes a new cryptographic bearer token design enabling fully offline e-cash withdrawals from ATMs, thereby removing the central bank as a critical dependency.

View →
cs.CRRecentMay 12, 2026

Deanonymizable Scoped Linkable Ring Signatures

Montassar Naghmouchi, Maryline Laurent

The paper introduces Deanonymizable Scoped Linkable Ring Signatures (DSLRS), a novel scheme that integrates scoped linkability and decentralized accountability into a single signature structure for pr…

View →