From Paper Trails to Trust on Tracks: Adding Public Transparency to Railways via zk-SNARKs

• URL: http://arxiv.org/abs/2504.19640v1
• Date: Mon, 28 Apr 2025 09:54:38 GMT
• Title: From Paper Trails to Trust on Tracks: Adding Public Transparency to Railways via zk-SNARKs
• Authors: Tarek Galal, Valeria Tisch, Katja Assaf, Andreas Polze,
• Abstract summary: We analyse the German guideline for railway-infrastructural modifications from proposal to approval.<n>We use the guideline as a motivating example for modelling decisions in processes using digital signatures and zero-knowledge proofs.<n>Our solution is not railway-specific but also applicable to other contexts, helping leverage zero-knowledge proofs for public transparency and trust.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Railways provide a critical service and operate under strict regulatory frameworks for implementing changes or upgrades. Despite their impact on the public, these frameworks do not define means or mechanisms for transparency towards the public, leading to reduced trust and complex tracking processes. We analyse the German guideline for railway-infrastructural modifications from proposal to approval, using the guideline as a motivating example for modelling decisions in processes using digital signatures and zero-knowledge proofs. Therein, a verifier can verify that a process was executed correctly by the involved parties and according to specification without learning confidential information such as trade secrets or identities of the participants. We validate our system by applying it to the railway process, demonstrating how it realises various rules, and we evaluate its scalability with increased process complexities. Our solution is not railway-specific but also applicable to other contexts, helping leverage zero-knowledge proofs for public transparency and trust.

Related papers

• Improving Regulatory Oversight in Online Content Moderation [2.1082552608122542]
  The European Union introduced the Digital Services Act (DSA) to address the risks associated with digital platforms and promote a safer online environment.<n>Despite the potential of components such as the Transparency Database, Transparency Reports, and Article 40 of the DSA to improve platform transparency, significant challenges remain.<n>These include data inconsistencies and a lack of detailed information, which hinder transparency in content moderation practices.
  arXiv  Detail & Related papers  (2025-06-04T16:38:25Z)
• Engineering Trustworthy Machine-Learning Operations with Zero-Knowledge Proofs [1.7723990552388873]
  Zero-Knowledge Proofs (ZKPs) offer a cryptographic solution that enables provers to demonstrate, through verified computations, adherence to set requirements without revealing sensitive model details or data.<n>We identify five key properties (non-interactivity, transparent setup, standard representations, succinctness, and post-quantum security) critical for their application in AI validation and verification pipelines.
  arXiv  Detail & Related papers  (2025-05-26T15:39:11Z)
• Do We Need to Verify Step by Step? Rethinking Process Supervision from a Theoretical Perspective [59.61868506896214]
  We show that under standard data coverage assumptions, reinforcement learning is no more statistically difficult than through process supervision.<n>We prove that any policy's advantage function can serve as an optimal process reward model.
  arXiv  Detail & Related papers  (2025-02-14T22:21:56Z)
• Federated Conformance Checking [0.1433758865948252]
  Conformance checking is a crucial aspect of process mining, where the main objective is to compare the execution of a process.<n>We propose a privacy-aware federated conformance-checking approach that allows for evaluating the correctness of overall cross-organizational process models.
  arXiv  Detail & Related papers  (2025-01-23T11:30:13Z)
• Balancing Confidentiality and Transparency for Blockchain-based Process-Aware Information Systems [46.404531555921906]
  We propose an architecture for blockchain-based PAISs aimed at preserving both confidentiality and transparency.<n>Smart contracts enact, enforce and store public interactions, while attribute-based encryption techniques are adopted to specify access grants to confidential information.
  arXiv  Detail & Related papers  (2024-12-07T20:18:36Z)
• A Confidential Computing Transparency Framework for a Comprehensive Trust Chain [7.9699781371465965]
  Confidential Computing enhances privacy of data in-use through hardware-based Trusted Execution Environments.<n>TEEs require user trust, as they cannot guarantee the absence of vulnerabilities or backdoors.<n>We propose a three-level conceptual framework providing organisations with a practical pathway to incrementally improve Confidential Computing transparency.
  arXiv  Detail & Related papers  (2024-09-05T17:24:05Z)
• AGORA: Open More and Trust Less in Binary Verification Service [16.429846973928512]
  We introduce a novel binary verification service, AGORA, scrupulously designed to overcome the challenge. Certain tasks can be delegated to untrusted entities, while the corresponding validators are securely housed within the trusted computing base. Through a novel blockchain-based bounty task manager, it also utilizes crowdsourcing to remove trust in theorem provers.
  arXiv  Detail & Related papers  (2024-07-21T05:29:22Z)
• TRACE: TRansformer-based Attribution using Contrastive Embeddings in LLMs [50.259001311894295]
  We propose a novel TRansformer-based Attribution framework using Contrastive Embeddings called TRACE. We show that TRACE significantly improves the ability to attribute sources accurately, making it a valuable tool for enhancing the reliability and trustworthiness of large language models.
  arXiv  Detail & Related papers  (2024-07-06T07:19:30Z)
• Inverse Online Learning: Understanding Non-Stationary and Reactionary Policies [79.60322329952453]
  We show how to develop interpretable representations of how agents make decisions. By understanding the decision-making processes underlying a set of observed trajectories, we cast the policy inference problem as the inverse to this online learning problem. We introduce a practical algorithm for retrospectively estimating such perceived effects, alongside the process through which agents update them. Through application to the analysis of UNOS organ donation acceptance decisions, we demonstrate that our approach can bring valuable insights into the factors that govern decision processes and how they change over time.
  arXiv  Detail & Related papers  (2022-03-14T17:40:42Z)
• Synthetic Disinformation Attacks on Automated Fact Verification Systems [53.011635547834025]
  We explore the sensitivity of automated fact-checkers to synthetic adversarial evidence in two simulated settings. We show that these systems suffer significant performance drops against these attacks. We discuss the growing threat of modern NLG systems as generators of disinformation.
  arXiv  Detail & Related papers  (2022-02-18T19:01:01Z)
• Trustworthy Artificial Intelligence and Process Mining: Challenges and Opportunities [0.8602553195689513]
  We show that process mining can provide a useful framework for gaining fact-based visibility to AI compliance process execution. We provide for an automated approach to analyze, remediate and monitor uncertainty in AI regulatory compliance processes.
  arXiv  Detail & Related papers  (2021-10-06T12:50:47Z)
• Uncertainty as a Form of Transparency: Measuring, Communicating, and Using Uncertainty [66.17147341354577]
  We argue for considering a complementary form of transparency by estimating and communicating the uncertainty associated with model predictions. We describe how uncertainty can be used to mitigate model unfairness, augment decision-making, and build trustworthy systems. This work constitutes an interdisciplinary review drawn from literature spanning machine learning, visualization/HCI, design, decision-making, and fairness.
  arXiv  Detail & Related papers  (2020-11-15T17:26:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.