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

20 results for “Association schemes”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

math.COcs.DMmath.CTTheoreticalRecentJul 9, 2026

Subword representations and weak hypercube dimension for acyclic categories

Isaac Carcacía-Campos

This paper introduces a new way to represent finite posets as subwords of finite words in categories, and characterizes the monic categories that admit this representation.

View →
cs.DMTheoreticalRecentJun 27, 2026

Learning Unions of Intersecting Affine Modules in One Dimension with Queries

Eva González, Montserrat Hermo, Anthony Lin

This paper shows that finite unions of intersecting affine modules in one dimension are efficiently exactly learnable using equivalence and subset queries.

View →
cs.CRRecentMay 22, 2026

A blueprint for constructing 3-pass AKE protocols under commitment-based models

Rodrigo Martín Sánchez-Ledesma

This paper constructs and proves the security of 3-pass Authenticated Key Exchange (AKE) protocols for both KA-based and KEM-based primitives within the commitment-based model, improving upon previous…

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.CRcs.AIcs.DCRecentApr 21, 2026

Sherpa.ai Privacy-Preserving Multi-Party Entity Alignment without Intersection Disclosure for Noisy Identifiers

Daniel M. Jimenez-Gutierrez, Dario Pighin, Enrique Zuazua, Georgios Kellaris +3 more

The paper introduces Sherpa.ai, a multi-party Private Set Union (PSU) protocol that enables privacy-preserving entity alignment for Vertical Federated Learning (VFL) without disclosing shared sample i…

View →
cs.DCcs.CRTheoreticalRecentJul 23, 2026

The Consensus Number of Untraceable Cryptocurrencies

Christian Cachin, David Lehnherr, Juan Villacis, François-Xavier Wicht

This paper compares two cryptocurrency sender untraceability designs, Linear Untraceable Asset Transfer Objects (LUAT) and Constant-State Untraceable Asset Transfer Objects (CUAT), and analyzes their…

View →
cs.CRcs.AIcs.CYRecentMay 25, 2026

KYA: A Framework-Agnostic Trust Layer for Autonomous Systems with Verifiable Provenance and Hierarchical Policy Composition

Kolawole Quadri

KYA introduces a framework-agnostic trust and governance layer for autonomous systems that ensures actions are authorized, policy-conforming, and verifiable through a combination of novel primitives.

View →
cs.LGcs.CRcs.DBRecentMay 12, 2026

FERMI: Exploiting Relations for Membership Inference Against Tabular Diffusion Models

Abtin Mahyar, Masoumeh Shafieinejad, Yuhan Liu, Xi He

The paper proposes FERMI, a method that significantly improves membership inference attacks against tabular diffusion models by leveraging auxiliary relational information available during training, e…

View →
cs.CRcs.ITRecentMar 17, 2026

Novel CRT-based Asymptotically Ideal Disjunctive Hierarchical Secret Sharing Scheme

Hongju Li, Jian Ding, Fuyou Miao, Cheng Wang +1 more

The paper proposes a novel CRT-based asymptotically perfect Disjunctive Hierarchical Secret Sharing (DHSS) scheme that overcomes security and information rate limitations of existing methods.

View →
cs.CRRecentMar 23, 2026

Bridges connecting Encryption Schemes

Mugurel Barcau, Cristian Lupascu, Vicentiu Pasol, George C. Turcas

The paper introduces 'bridges,' a type of morphism between encryption schemes, and provides a general recipe for constructing them, showing that their security relies on the security of the initial sc…

View →
cs.DScs.CRmath.NTRecentMay 17, 2026

Module Lattice Security (Part III): Structured CVP Distance on the Log-Unit Lattice

Ming-Xing Luo

The paper analyzes the structured CVP distance on the log-unit lattice of cyclotomic fields, significantly reducing the conjectured CDPR factor for the ML-KEM cryptosystem from exponential to sub-poly…

View →
cs.CRTheoreticalRecentJul 1, 2026

Know Thy Neighbor: Cross-TEE Mutual Attestation

Daniel Andrade, João N. Silva, Miguel P. Correia

This paper introduces Hema, a formally-verified protocol for mutual attestation of Trusted Application (TA) instances running on the same or different Trusted Execution Environments (TEEs).

View →
cs.CRcs.ITRecentMar 27, 2026

Cryptanalysis of a PIR Scheme based on Linear Codes over Rings

Luana Kurmann, Svenja Lage, Violetta Weger

This paper presents a cryptanalytic attack demonstrating that a specific code-based Private Information Retrieval (PIR) scheme can be broken, allowing the server to efficiently determine the requested…

View →
cs.CRcs.LGcs.SERecentMay 5, 2026

Identifier-Free Code Embedding Models for Scalable Search

Eric Wolos, Michael Doyle

The paper proposes and evaluates a novel embedding model for bidirectional function association between source code and decompiled/stripped code, significantly outperforming existing models.

View →
cs.CRcs.DCRecentMay 7, 2026

SuperPaymaster: Eliminating Centralized Signer Authority via Asset-Oriented Abstraction to Reconcile Usability and Decentralization in Account Abstraction

Huifeng Jiao, Nathapon Udomlertsakul

The paper introduces SuperPaymaster, an Asset-Oriented Abstraction (AOA) paymaster that eliminates the need for a centralized off-chain signer, thereby improving the decentralization and efficiency of…

View →
cs.DMcs.DSTheoreticalRecentJul 8, 2026

Ranking and Rank Aggregation with Matroid Prefix Constraints

Seiei Ando, Yu Yokoi

This paper studies ranking and aggregation under Kendall tau distance with matroid or flag matroid constraints on prefixes.

View →
cs.GTcs.CCTheoreticalRecentJun 11, 2026

On Cutting Cakes and Crossing Curves

Alexandros Hollender, Gilbert Maystre, Kilian Risse

The paper shows that the envy-free cake-cutting problem with three agents is intractable and establishes the first lower bounds for the Jordan curve problem.

View →