Follow blockchain research across journals, conferences, and preprint repositories.
8,484 results · page 58 of 354
Wenhao Wang, Lulu Zhou, Aviv Yaish, Fan Zhang · 6 authors
No abstract is available for this record.
Ryann Cartor, Nathan Daly, Giulia Gaggero, Jason T. LeGrow · 6 authors
No abstract is available for this record.
Yassine Lkhalidi, Hatim Kharraz Aroussi, Achraf Tifernine, Hamza Majid
No abstract is available for this record.
Emir Osmanspahić
No abstract is available for this record.
Assane Ilboudo, Didier Bassolé, Désiré GUEL
No abstract is available for this record.
Rajpreet Kaur, Kiranjit Kaur
No abstract is available for this record.
C. R. Reshma, B. R. Arun Kumar
No abstract is available for this record.
Shashank Kumar
We present CHRONOS, the first autonomous AI agent that simultaneously achieves plaintextblindness (all data is processed under fully homomorphic encryption without ever beingexposed), cryptographically enforced time bound existence (the agent’s own decryption key islocked behind a publicly verifiable proof of sequential work, rendering it inaccessible until aprecise future moment), and remote verifiability of self destruction (a zero knowledge proofcertifies that the key material has been irreversibly destroyed after mission completion). Theagent’s operational lifespan is governed by a “cryptographic fuse” constructed from a proof ofsequential work (PoSW) whose computation time accurately matches the intended missionduration. A drand decentralized randomness beacon serves as a trusted time oracle to trigger thefinal key shredding. Crucially, the erasure proof is a non interactive zero knowledge argument(SNARK) that proves the correct execution of the entire self destruction sequence—including thePoSW solution, decryption of the private key, and subsequent memory zeroization—enablingany third party to cryptographically verify the agent’s annihilation without trusting the agent orits hardware. We provide a complete system architecture, a formal security model with gamebased definitions and reductions to standard assumptions, and a proof of concept implementationusing Zama’s TFHE rs for encrypted inference, a Cohen Pietrzak PoSW implementation, and aGroth16 SNARK. Our benchmarks indicate that FHE inference on a small neural network (50 Kparameters) completes in seconds, the PoSW background thread consumes negligible resources,and the erasure proof can be generated and verified in under three seconds. CHRONOSrepresents a fundamental advance in secure, disposable AI agents, with immediate applications indefense, intelligence, and high privacy environments.
Daiki Miyahara, Pascal Lafourcade, Maxime Puys
Card-based zero-knowledge proof (ZKP) protocols allow a prover to convince a verifier that it knows a witness of a given statement, without revealing any information, using a physical deck of playing cards. Previous studies have focused on puzzles with a specific connected component, such as a simple cycle and a polyomino. In this study, we propose a unified approach to handle a family of connected components, including a tree, path, cycle, and polyomino. This approach achieves this verification in O(mn) steps relative to a given grid size m × n. Using this approach, we construct a card-based ZKP protocol for Nurimeizu, where the goal is to find the shortest path on a given grid.
Roman Burtsev
A unified, computationally reproducible framework built on a single ontological method: KTR (Knowledge Triangle Route). It operates on a three-state topological cell (1-0-1), where '0' acts as an active transit, and two corners merge to generate the third (A+B→C, the Chomsky merge) at the root. This closure allows geometric spectra to be translated into algebraic forms. Core Dimensions: Fundamental Physics & Math: Koide through star geometry (Q=2/3 as half-weight, cos²θ=1/2; the electron reproduced to a number within 0.07%, a live falsifiable tau prediction). Structural models for the mass gap, confinement, hadron/penguin, junction, neutrino, star formation, Born rule; and structural accounts of the Millennium Problems (Yang-Mills, Riemann, Hodge, Navier-Stokes, P vs NP, Birch). Information Theory: Applies the Kolmogorov view (randomness as compressibility) via ternary 1-0-1 encoding. Data treated as structured blocks navigated by hash addressing. Quantum Logic: The Qutrit Map Solution (QMS), ternary logic gates, the qutrit cell, zero-mode mass gap analytics. Reproducible computation, executable proof. Computed results (stones) are labelled apart from models; no Millennium problem is claimed solved. Given for those who find use in it.
Samir Lotfi Ali
No abstract is available for this record.
Rohitkumar R. Upadhyay, Sahadeo Padhye, Naeim Rahmani
No abstract is available for this record.
С. Ю. Волинець, O.V. Saliieva, О. Saliieva
This paper analyzes the shortcomings of traditional authentication mechanisms in web applications operating over the secure TLS 1.3 protocol. It is established that even with an encrypted channel, the transmission of secret data (passwords, tokens) remains a primary attack vector. An improved protocol is proposed that integrates an authentication mechanism based on zero-knowledge proofs (zk-SNARK) immediately after session establishment via Elliptic Curve Diffie-Hellman (ECDHE) key exchange. This approach completely eliminates the transmission of client credentials, significantly increasing resistance to phishing and server database compromises.
Subhasis Thakur
No abstract is available for this record.
Thành Trung Phan
No abstract is available for this record.
Arthur Lazzaretti, Charalampos Papamanthou, Ismael Hishon-Rezaizadeh
No abstract is available for this record.
Jeyalakshmi Jeyabalan, Palavajjhala Neha Madhu Manasa, K. Vijay
No abstract is available for this record.
Jingyu Li, Ziguang Lu
In the domain of agricultural product traceability, while traditional blockchain technologies ensure data immutability, they struggle to verify the authenticity of digital twins generated by generative artificial intelligence (GAI), resulting in a se mantic gap between the physical world and its virtual representation. To address these challenges, this paper proposes Verifiable Twin model driven by Cross-Modal Alignment (VTA-CMAD), which targets three core issues: cross-modal consistency verification between blockchain-stored data and AIGC-generated twins, lightweight zero-knowledge proof framework construction, and incentive-compatible suppression of malicious behaviors. The innovation of this article is reflected in three aspects. Firstly, this article proposes a 3D multimodal alignment algorithm that integrates dynamic time warping. B y integrating physical sensing temporal data, production process images, and cultural semantic descriptions, the optimal transmission mapping of feature space is established. Secondly, design a verifiable circuit zk Vector to transform the inference process of the fine-tuning diffusion model into zero knowledge proof constraints, generating proof files with a size less than 1.2KB. Finally, a dynamic consensus mechanism Proof of Trustworthiness based on Feature Alignment (PoTV) based on feature alignment is constructed to achieve adaptive adjustment of data weights. Experimental results demonstrate that the proposed approach achieves a tamper detection rate of 86.2%, a Gini coefficient of 0.19 for incentive fairness, and reduces multimodal alignment error to 0.11 ± 0.03.
Eric Hoppe
This article argues that the extraction of value through informational asymmetry, what the article formalizes as the Blaeu rent, is categorically distinct from Ricardian scarcity rents and Schumpeterian innovation rents: it scales with the counterparty’s blindness, is invariant to productive merit, and is dissolved entirely by symmetric closure. The argument proceeds in three interlocking registers. The first is philosophical: drawing on Maurice Merleau-Ponty’s account of motor intentionality, Martin Heidegger’s analysis of the ready-to-hand, and Antonio Damasio’s somatic-marker hypothesis, the article defends the existential claim that some intentional states carry content before they are verbalized, and that pre-articulate knowledge, alongside acquired, derived, received, and inherited knowledge, constitutes a legitimate and analytically distinct mode of knowledge entry. The second is formal: the article introduces a fiber bundle topology to represent semantically overloaded concepts without metric distortion; formalizes the Blaeu rent as a function of the information set differential between counterparties, subject to strict conditions of merit-invariance; presents a mechanism-design proof, grounded in adverse selection dynamics, demonstrating that institutional adoption of symmetric instruments is the dominant rational strategy for capital; and formalizes the irreversible loss of cognitive potential under asymmetric conditions as a cognitive entropy law, drawing on Nicholas Georgescu-Roegen’s thermodynamic framework, showing that the waste is path-dependent and permanent. The third is architectural: the article specifies the federated, homomorphically encrypted governance structure required to make the sovereignty claim real rather than nominal, and addresses the warrant-adjudication problem through cryptographically verifiable zero-knowledge credential systems. The central finding is that symmetric closure of the information gap dissolves the Blaeu rent entirely while leaving earned competitive advantage, including first-mover position, execution capacity, and risk tolerance, wholly intact.
Sandro Stattmann
Digitale Identitätssysteme bilden eine zentrale Grundlage moderner Verwaltungs- und E-Government-Prozesse. Sie ermöglichen die sichere Interaktion zwischen Bürger:innen, staatlichen Stellen und privaten Diensten. Ein besonders kritischer Schritt ist dabei die Identitätsprüfung im Rahmen des Onboardings, da hier die Verbindung zwischen einer realen Person und einer digitalen Identität hergestellt wird. Bestehende Onboarding-Verfahren, etwa persönliche Identifikation, VideoIdent, biometrische Verfahren oder dokumentenbasierte Prüfungen, stellen dafür etablierte Mechanismen bereit, erfordern jedoch häufig die Verarbeitung sensibler personenbezogener Daten und stützen sich stark auf organisatorische Vertrauensstrukturen.Die vorliegende Arbeit untersucht, ob ein deterministischer, registerbasierter und kryptographisch unterstützter Matching-Ansatz auf den Onboarding-Prozess von ID Austria angewendet werden kann. Der Fokus liegt dabei nicht auf der Entwicklung eines neuen kryptographischen Bausteins oder eines vollständig neuen Identitätssystems, sondern auf der konzeptionellen Anwendung und prototypischen Umsetzung von Deterministic Privacy-Preserving Identity Matching als Onboarding-Modell. Dieser Ansatz wird im Rahmen der Arbeit als DPPIM-OM bezeichnet.Die Arbeit folgt einem konstruktiv-analytischen Vorgehen. Zunächst werden die technischen und konzeptionellen Grundlagen digitaler Identität, Identitätsprüfung, privacy-preserving Matching, OPRF/VOPRF-Mechanismen und Zero-Knowledge-Nachweisen analysiert. Darauf aufbauend wird ein Onboarding-Modell beschrieben, das deterministischen Full-Match, kanonisierte Attributrepräsentation, servergebundene kryptographische Auswertung, registerbasierten Vergleich und registergebundene Nachweisführung kombiniert. Anschließend wird ein Prototyp umgesetzt, um die technische Realisierbarkeit des Ansatzes unter kontrollierten Bedingungen zu demonstrieren.Das vorgeschlagene Onboarding-Modell wird dem aktuellen ID-Austria-Onboarding sowie VideoIdent-, biometrischen und dokumentenbasierten Verfahren gegenübergestellt. Die Evaluierung erfolgt entlang zentraler Dimensionen wie Datenexposition, Informationsleckage, Sicherheit, Missbrauchsresistenz, Vertrauensmodell, Verifizierbarkeit, Determinismus, Fehleranfälligkeit, Anforderungen an Datenqualität, Prozesskomplexität, Performance sowie Kompatibilität mit dem europäischen regulatorischen Rahmen.Die Ergebnisse zeigen, dass DPPIM-OM insbesondere in den Bereichen Datenminimierung, Informationskontrolle und Verifizierbarkeit deutliche strukturelle Vorteile aufweist. Gleichzeitig bringt der Ansatz spezifische Anforderungen und Einschränkungen mit sich, insbesondere hinsichtlich Datenkonsistenz, technischer Umsetzungskomplexität und fehlender direkter Personenbindung. Die Arbeit kommt zu dem Ergebnis, dass der Ansatz eine vielversprechende Möglichkeit zur Weiterentwicklung digitaler Onboarding-Prozesse darstellt, insbesondere in hybriden Modellen, die klassische Mechanismen zur Personenbindung mit einem deterministischen und kryptographisch überprüfbaren Attributabgleich kombinieren.
Xiaojun Luo
No abstract is available for this record.
Francisco Sierra
No abstract is available for this record.
Zhuhan Zhang, Min Jiang, Jun Kong, Jiayi Li
No abstract is available for this record.
Mona A. Mohamed, Beenish M. Chaudhry, Joyram Chakraborty, Kevin J. O’Sullivan
No abstract is available for this record.