Search arXivSearch

arXiv · 2608.30992

Trustless Accountable Data Sharing for Supply Chains: A Reference Architecture and MoreMedDiet Proof-of-Concept

Abstract

Modern supply chains are increasingly dependent on the exchange of sensitive business data between heterogeneous stakeholders who do not trust each other. %under partial trust. Conventional integration approaches typically rely on centralized intermediaries or require extensive data disclosure, which hinders collaboration, compliance, and innovation. We propose a generic reference architecture for privacy preserving, trustless data sharing in supply chains. The architecture combines permissioned distributed ledgers, IoT-based evidence ingestion, and modular privacy mechanisms to enable controlled transparency: stakeholders can extract verifiable insights and support audits while minimizing data exposure. We instantiate the architecture in the context of the MoreMedDiet project, which promotes sustainable farm-to-fork food systems and adoption of the Mediterranean diet. By mapping the MoreMedDiet use case into our architecture, we demonstrate how channel topologies, IoT-to-ledger data flows, and smart contract-based quality assurance (QA) can support secure data exchange, transparency, interoperability, and regulatory alignment. Our proof-of-concept illustrates how Self-Sovereign Identity (SSI) and W3C Verifiable Credentials (VCs) can provide portable and auditable access governance over Hyperledger Fabric channels. The resulting design offers a reusable blueprint for multi-actor supply chains, including agri-food and pharmaceutical domains. Moreover, the performance achieved -- presenting a verified credential to the next stakeholder in the supply chain in 130 ms -- is promising and demonstrates the potential applicability of the approach in real-world supply chain environments.

Explore related subjects

Keep this discovery

BibTeXRIS

Michal Kit, Montassar Naghmouchi, Maryline Laurent, Badis Hammi, Hella Kaffel Ben Ayed, Mohamed Amine Hamdi, Jihene Khoualdi, Ilhem Abdelhedi Abdelmoula, Sami Sboui. 2026-08-31. Trustless Accountable Data Sharing for Supply Chains: A Reference Architecture and MoreMedDiet Proof-of-Concept. https://arxiv.org/abs/2608.30992

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

A brief history of quantum vs classical computational advantage

In this review article we summarize all experiments claiming quantum computational advantage to date. Our review highlights challenges, loopholes, and refutations appearing in subsequent work to provide a complete picture of the current statuses of these experiments. In addition, we also discuss theoretical computational advantage in example problems such as approximate optimization and recommendation systems. Finally, we review recent experiments in quantum error correction -- the biggest frontier to reach experimental quantum advantage in Shor's algorithm.

quant-ph

Redundancy rules for MaxSAT

The concept of redundancy in SAT leads to more expressive and powerful proof search techniques, e.g., able to express various inprocessing techniques, and originates interesting hierarchies of proof systems [Heule et$.$al'20, Buss-Thapen'19]. Redundancy has also been integrated in MaxSAT [Ihalainen et$.$al'22, Berg et$.$al'23, Bonacina et$.$al'24]. In this paper, we define a structured hierarchy of redundancy proof systems for MaxSAT, with the goal of studying its proof complexity. We obtain MaxSAT variants of proof systems such as SPR, PR, SR, and others, previously defined for SAT. All our rules are polynomially checkable, unlike [Ihalainen et$.$al'22]. Moreover, they are simpler and weaker than [Berg et$.$al'23], and possibly amenable to lower bounds. This work also complements the approach of [Bonacina et$.$al'24]. Their proof systems use different rule sets for soft and hard clauses, while here we propose a system using only hard clauses and blocking variables. This is easier to integrate with current solvers and proof checkers. We discuss the strength of the systems introduced, we show some limitations of them, and we give a short cost-SR proof that any assignment for the weak pigeonhole principle $PHP^{m}_{n}$ falsifies at least $m-n$ clauses. We conclude by discussing the integration of our rules with the MaxSAT resolution proof system, which is a commonly studied proof system for MaxSAT.

cs.LO

Mutually unbiased bases as extremal probes of isotropic random Hamiltonians

Mutually unbiased bases (MUBs) are central finite structures in quantum information. We ask whether complete MUB systems have an extremal probing property beyond their projective \(2\)-design identities. For an isotropic Gaussian traceless Hamiltonian, we prove that, among labeled unions of \(d+1\) orthonormal bases, a complete MUB union has the stochastically largest sampled maximum. Each basis induces the same regular-simplex Gaussian block; mutual unbiasedness eliminates cross-block covariance, joint Gaussianity yields independence, and a centered-convex Gaussian correlation inequality makes this independent coupling extremal. We also derive a radial-mixture extension and prove exact MUB-family collapse for fully matched diagonal-cost constructions.

quant-ph