Abstract We propose federated quantum randomness with client-side sanity (FQR-CSS), a federated architecture that supplies continuously verifiable quantum entropy to cloud hardware security modules (HSMs) and key management services (KMS). In FQR-CSS, each quantum random number generator (QRNG) node emits a randomness contribution along with a post-quantum zero-knowledge proof (ZKP) attesting to device-level operational predicates. An aggregation layer verifies these proofs, runs Byzantine fault tolerance (BFT) consensus (instantiated via HotStuff) over accepted contributions, and publishes a mixed output with an integrity token. We introduce the security notion of verifiable quantum randomness (VQR), comprising unpredictability, quantum-origin guarantee, and federated integrity. We prove VQR under concrete post-quantum cryptographic assumptions. Our proofs utilize Track-A constructions (ZKPs over classical measurement logs), which are fully implementable today. We further outline a theoretical roadmap for Track-B (direct quantum state verification) to guide future research directions. Our empirical evaluation of a post-quantum zk-STARK (Track-A) demonstrates prover latencies of approximately 26 ms for synthetic statistical predicates (K=1024), with sub-millisecond verification times, proof approximately 2.6 KB, and an estimated end-to-end WAN+HotStuff latency approximately 396 ms in our conservative model.
Open access
Cryptography and Data Security
Physical Unclonable Functions (PUFs) and Hardware Security
The "Identity Trilemma" posits that a decentralized network can enforce only two of the following three properties: Privacy (Anonymity), Accountability (Sybil Resistance), and Permissionlessness (No Central Gatekeeper). Traditional Web2 platforms resolve this by sacrificing Privacy (enforcing Real-Name Policies), while early Web3 platforms sacrificed Accountability, resulting in "Sybil Swarms" where single actors control thousands of wallets. This paper introduces the Klyrox solution to the trilemma: Pseudonymous Accountability. By utilizing Zero-Knowledge Proofs (ZKPs) and non-linear Time-Energy Cost Functions, the Klyrox Protocol enables users to mathematically prove they are unique, high-integrity actors without ever revealing their physical identity, biometric data, or government credentials. We define a new standard for "Proof of Personhood" based not on biology, but on consistent historical behavior recorded in a Soulbound Token (ERC-721M). Author's Note: This paper is a foundational pillar of the Klyrox Protocol architecture, expanding upon the core framework published in The Klyrox Protocol: A Decentralized Framework for Optimistic Content Verification and Epistemic Reputation (available at: https://doi.org/10.5281/zenodo.18729968). It outlines the specific mechanics underpinning the concept of "Epistemic Capital," as explored in the complete five-volume series, The Algorithmic Monographs (The Algorithmic Invisible Hand, The Republic of Code, The Market for Truth, The Heavy Metal Intelligence, and The Synthetic C-Suite).
Exponentially growing data generated by networked devices in Industry 4.0 environments requires industrial analytics that are secure, scalable, and decentralized. This article proposes TADDA-4i, a new multi-layered architecture based on IOTA's Tangle-Directed Acyclic Graph (DAG)-based Distributed Ledger Technology (DLT)-combined with federated learning and edge computing to provide real-time, secure, reliable, and self-sovereign industrial analytics. The architecture minimizes centralized bottlenecks via feeless, asynchronous data validation and tamper-evident model update verification using the Tangle ledger. Adaptive Tip-Aware Data Prioritization (ATDP) and Tangle-Validated Federated Aggregation (TVFA) are two new algorithms proposed for improving responsiveness and securing federated learning integrity. Experimental evaluation in emulated industrial edge environments showed that transactions take 30 percent less time, almost all of the misbehaving updates are detected, the model is about 10 percent more accurate, and output is not reduced even if the number of devices reaches 50. These findings make TADDA-4i an executable solution for the future generations of decentralized industrial intelligence.
The rapid evolution of digital currency systems has consistently faced the fundamental challenge of achieving an optimal balance between transaction privacy, computational efficiency, and cryptographic security. This comprehensive research paper introduces the Elliptic Homomorphic Token (EHT), a groundbreaking cryptographic protocol that revolutionizes privacy-preserving peer-to-peer transactions through the innovative integration of elliptic curve-based partially homomorphic encryption mechanisms and advanced digital signature schemes. Unlike conventional zero-knowledge proof systems that have dominated the privacy-focused cryptocurrency landscape, EHT takes a fundamentally different approach by directly leveraging the underlying cryptographic primitives that form the mathematical foundation of these complex systems. The protocol implements a sophisticated pre-transaction mechanism followed by distributed block recording, achieving remarkable performance metrics of 1000 transactions per second (TPS) with consistently low latency ranging from 50 to 100 milliseconds. Our comprehensive approach systematically addresses the significant computational overhead challenges that were extensively documented during Central Bank Digital Currency (CBDC) implementation projects, while simultaneously providing a robust and practical framework for privacy-preserving digital transactions that maintains the highest standards of cryptographic security. The EHT protocol represents a paradigm shift in how we conceptualize and implement privacy-preserving digital currency systems, offering a more direct, efficient, and mathematically elegant solution compared to existing approaches. Through extensive theoretical analysis, rigorous security proofs, and comprehensive performance evaluations, this paper demonstrates that EHT not only meets but exceeds the requirements for next-generation digital currency systems in terms of privacy, efficiency, scalability, and security.
Contemporary digital currency systems face fundamental challenges in achieving optimal balance between transaction privacy, computational efficiency, and cryptographic security. While zero-knowledge proof systems have dominated privacy-preserving cryptocurrency research, their practical implementations often involve prohibitive computational overhead that limits real-world deployment. This paper presents a comprehensive analysis of the Elliptic Homomorphic Token (EHT) protocol, which leverages elliptic curve-based partially homomorphic encryption to enable privacy-preserving peer-to-peer transactions without the computational complexity of zero-knowledge constructions. Our theoretical analysis demonstrates strong privacy guarantees under standard cryptographic assumptions, while experimental evaluation shows that EHT achieves 1000 transactions per second with 50-100ms latency. The protocol eliminates the need for complex zero-knowledge proofs by directly utilizing elliptic curve cryptographic primitives, resulting in performance improvements exceeding 100× over existing privacy-focused systems while maintaining equivalent security properties.
Complete technical specification and reference implementation for privacy-preserving payment infrastructure achieving European payment sovereignty while maintaining cryptographic privacy guarantees. This comprehensive study analyzes the Y.I.N. Architecture’s DP→ZK→HE (Differential Privacy → Zero-Knowledge → Homomorphic Encryption) ordering for secure payment settlement. Technical Coverage: The article provides detailed analysis of 43 implementation variants including six cryptographic orderings (with mathematical proofs of security properties), seven zero-knowledge protocols (Sigma, Bulletproofs, STARKs, zk-SNARKs, PLONK, Halo 2, Recursive SNARKs), six homomorphic encryption schemes (CKKS, BFV, TFHE, Multi-key HE, FSS, Garbled Circuits), five differential privacy mechanisms, four deployment architectures, three hardware acceleration approaches, three cross-border payment protocols, three quantum-resistant key management methods, three presentation attack detection techniques, and three accessibility compliance pathways. Implementation & Performance: Includes 2,346 lines of production-ready code with comprehensive error handling, constant-time cryptographic operations, and replay attack protection. Performance benchmarks demonstrate 234ms settlement latency, 640× timing attack resistance, and 135× adversarial detection capability, suitable for real-time payment processing at scale. Production Deployment: Features complete deployment guides including centralized server architecture, network security configurations, production monitoring with Prometheus metrics, extensive test suite covering honest/tampered/replay scenarios, and enterprise integration strategies for financial institutions and consulting firms. Regulatory Compliance: Comprehensive mapping to 13 global regulations (GDPR, DORA, PSD2, 5AMLD, BSA/AML, CCPA, BIPA, PDPA, PIPL, POPIA, LGPD) and 7 industry standards (PCI DSS, ISO 20022, FIPS 140-3, EMVCo), demonstrating privacy-by-design compliance for digital payment infrastructure. Applications: Reference implementation for European Payments Initiative (EPI), digital euro deployment, sovereign payment networks, cross-border settlement systems, and CBDC infrastructure requiring cryptographic privacy guarantees with regulatory compliance.
Abstract Can a dealer share a secret without knowing the shareholders? We provide a positive answer to this question by introducing the concept of an attribute-based secret sharing (AB-SS) scheme.With AB-SS, a dealer can distribute a secret based on attributes rather than specific individuals or shareholders. Only authorized users whose attributes satisfy a given access structure can recover the secret. Furthermore, we introduce the concept of attribute-based publicly verifiable secret sharing (AB-PVSS). An AB-PVSS scheme allows external users to verify the correctness of all broadcast messages from the dealer and shareholders, similar to a traditional PVSS scheme. Additionally, AB-SS (or AB-PVSS) distinguishes itself from traditional SS (or PVSS) by enabling a dealer to generate shares according to an arbitrary monotone access structure.To build an AB-PVSS scheme, we first implement a decentralized ciphertext-policy attribute-based encryption (CP-ABE) scheme, though not a fully-fledged one.We then incorporate non-interactive zero-knowledge (NIZK) proofs to enable public verification of the CP-ABE ciphertext. Based on the CP-ABE and NIZK proofs, we construct an AB-PVSS primitive.Finally, we conduct security analysis and comprehensive experiments on the proposed CP-ABE and AB-PVSS schemes. The results demonstrate that both schemes exhibit plausible performance compared to related works.
Joshua Edward Mamza, Idris Ismaila, Joseph A. Ojeniyi, Shafi’i Abdulhamid · 6 authors
The Common Vulnerability Scoring System (CVSS) depends on reliable vulnerability data from expert, but the current process of vulnerability score generation and transmission remain exposed to data manipulation and interception. Existing research work used supervised machine learning to automate CVSS scoring with up to 90% accuracy, but their plaintext-based approach lacked cryptographic protections, leaving it vulnerable to Man-in-the-Middle (MitM) attacks. Another research work introduced a homomorphic encryption-based framework that preserves data confidentiality during computation and offers moderate performance gains. However, their dependance on a single trusted aggregator, static key management, and absence of dynamic integrity threshold mechanisms left the system exposed if the aggregator’s key or channel were compromised. An architectural framework for an Enhanced Multi-Party Fully Homomorphic Encryption Scheme (EMHES) was designed to combat Man-in-the-Middle (MitM) attacks targeting Vulnerability Score manipulation. By employing Homomorphic Encryption, the framework enables computations on encrypted vulnerability scores, ensuring confidentiality throughout their lifecycle. Key enhancements include integrating digital signatures to authenticate classified scores before encrypted transmission to cloud environments and verify the integrity of decrypted results post-processing. Digital signatures and regulatory oversight significantly strengthen security properties like non-repudiation, integrity, and confidentiality for cloud-based data computations. The EMHES architecture features a secure transmission channel with multiple security layers within the cloud service provider infrastructure. Additional security mechanisms include secure key management protocols, zero-knowledge proofs for integrity verification, and a resilient secure aggregation protocol designed to counter MitM attacks. From a computational analysis, baseline algorithms exhibit constant time complexity O(1), while the EMHES architecture operates with linear time complexity O(n). The result shows that EMHES provides superior security, integrity and performance on large datasets.
To prevent the reprocessing of the same trade message in different distributed financial infrastructures, electronic trading systems must have powerful duplicate trade detection protocols. Redundant messages are a result of network timeouts, TCP retransmission protocols, upstream retry queues, and manual resubmission workflows that are part of heterogeneous trading structures. Idempotency models define message uniqueness by using composite business keys, cryptographic fingerprints using the SHA-256 hashing functions, and deduplication logic on time windows that trades off between accuracy of detection and scalability of computation. Graphed graph frameworks are enhanced with blockchain and deliver distributed data models to specify intricate trade relations in the form of immutable ledger records, smart contract validation logic, and multi-channel designs, which assure information integrity across trading networks. Multi-channel correlation algorithms differentiate between actual trade amendments and replay events based on machine learning classification models and partial fill cases and cross-venue execution strategies. Strategies of implementation are used to optimize parameters of tolerance windows with the use of hierarchical composite key matching, progressive sampled indexing, and container-based pre-fetching strategies. Microsecond-latency duplicate-detection In-memory caching architectures in conjunction with Bloom filter probabilistic structures can achieve duplicate detection at millions of trade messages per day to protect downstream risk management and regulatory reporting systems against position inflation and compliance violations.
Wyatt Benno, Alberto Centelles, Antoine Douchet, Khalil Gibran
We present Jolt Atlas, a zero-knowledge machine learning (zkML) framework that extends the Jolt proving system to model inference. Unlike zkVMs (zero-knowledge virtual machines), which emulate CPU instruction execution, Jolt Atlas adapts Jolt's lookup-centric approach and applies it directly to ONNX tensor operations. The ONNX computational model eliminates the need for CPU registers and simplifies memory consistency verification. In addition, ONNX is an open-source, portable format, which makes it easy to share and deploy models across different frameworks, hardware platforms, and runtime environments without requiring framework-specific conversions. Our lookup arguments, which use sumcheck protocol, are well-suited for non-linear functions -- key building blocks in modern ML. We apply optimisations such as neural teleportation to reduce the size of lookup tables while preserving model accuracy, as well as several tensor-level verification optimisations detailed in this paper. We demonstrate that Jolt Atlas can prove model inference in memory-constrained environments -- a prover property commonly referred to as \textit{streaming}. Furthermore, we discuss how Jolt Atlas achieves zero-knowledge through the BlindFold technique, as introduced in Vega. In contrast to existing zkML frameworks, we show practical proving times for classification, embedding, automated reasoning, and small language models. Jolt Atlas enables cryptographic verification that can be run on-device, without specialised hardware. The resulting proofs are succinctly verifiable. This makes Jolt Atlas well-suited for privacy-centric and adversarial environments. In a companion work, we outline various use cases of Jolt Atlas, including how it serves as guardrails in agentic commerce and for trustless AI context (often referred to as \textit{AI memory}).
Suvradip Chakraborty, James Hulett, Dakshita Khurana, Kabir Tomer
A recent breakthrough [Hirahara and Nanashima, STOC'2024] established that if $\mathsf{NP} \not \subseteq \mathsf{ioP/poly}$, the existence of zero-knowledge with negligible errors for $\mathsf{NP}$ implies the existence of one-way functions (OWFs). In this work, we obtain a characterization of one-way functions from the worst-case complexity of zero-knowledge {\em in the high-error regime}. We say that a zero-knowledge argument is {\em non-trivial} if the sum of its completeness, soundness and zero-knowledge errors is bounded away from $1$. Our results are as follows, assuming $\mathsf{NP} \not \subseteq \mathsf{ioP/poly}$: 1. {\em Non-trivial} Non-Interactive ZK (NIZK) arguments for $\mathsf{NP}$ imply the existence of OWFs. Using known amplification techniques, this result also provides an unconditional transformation from weak to standard NIZK proofs for all meaningful error parameters. 2. We also generalize to the interactive setting: {\em Non-trivial} constant-round public-coin zero-knowledge arguments for $\mathsf{NP}$ imply the existence of OWFs, and therefore also (standard) four-message zero-knowledge arguments for $\mathsf{NP}$. Prior to this work, one-way functions could be obtained from NIZKs that had constant zero-knowledge error $ε_{zk}$ and soundness error $ε_{s}$ satisfying $ε_{zk} + \sqrt{ε_{s}} < 1$ [Chakraborty, Hulett and Khurana, CRYPTO'2025]. However, the regime where $ε_{zk} + \sqrt{ε_{s}} \geq 1$ remained open. This work closes the gap, and obtains new implications in the interactive setting. Our results and techniques could be useful stepping stones in the quest to construct one-way functions from worst-case hardness.
The Fischlin transform yields non-interactive zero-knowledge proofs with straight-line extractability in the classical random oracle model. This is done by forcing a prover to generate multiple accepting transcripts through a proof-of-work mechanism. Whether the Fischlin transform is straight-line extractable against quantum adversaries has remained open due to the difficulty of reasoning about the likelihood of query transcripts in the quantum-accessible random oracle model (QROM), even when using the compressed oracle methodology. In this work, we prove that the Fischlin transform remains straight-line extractable in the QROM, via an extractor based on the compressed oracle. This establishes the post-quantum security of the Fischlin transform, providing a post-quantum straight-line extractable NIZK alternative to Pass' transform with smaller proof size. Our techniques include tail bounds for sums of independent random variables and for martingales as well as symmetrization, query amplitude and quantum union bound arguments.
Arka Pal, Louai Zahran, William Gvozdjak, Akilesh Potti · 5 authors
As large language models (LLMs) continue to grow in size, fewer users are able to host and run models locally. This has led to increased use of third-party hosting services. However, in this setting, there is a lack of guarantees on the computation performed by the inference provider. For example, a dishonest provider may replace an expensive large model with a cheaper-to-run weaker model and return the results from the weaker model to the user. Existing tools to verify inference typically rely on methods from cryptography such as zero-knowledge proofs (ZKPs), but these add significant computational overhead, and remain infeasible for use for large models. In this work, we develop a new insight -- that given a method for performing private LLM inference, one can obtain forms of verified inference at marginal extra cost. Specifically, we propose two new protocols which leverage privacy-preserving LLM inference in order to provide guarantees over the inference that was carried out. Our approaches are cheap, requiring the addition of a few extra tokens of computation, and have little to no downstream impact. As the fastest privacy-preserving inference methods are typically faster than ZK methods, the proposed protocols also improve verification runtime. Our work provides novel insights into the connections between privacy and verifiability in LLM inference.
Introduction In the contemporary digital health landscape, securing personal health data against unauthorized access while ensuring its verifiability is a paramount challenge. A critical conflict exists between the transparency required for data verification and the privacy mandated by global regulations such as HIPAA and GDPR. Existing Layer-1 blockchain solutions suffer from prohibitive gas costs and high latency, rendering them unsuitable for real-time monitoring of high-volume health data streams. Methods This paper proposes TeleZK-L2, a novel framework that synergizes distributed Zero-Knowledge Succinct Non-Interactive Arguments of Knowledge (zk-SNARKs) with Layer-2 scaling solutions. The architecture introduces a Distributed Prover Network (DPN) to parallelize heavy cryptographic computations and utilizes Optimistic Proof Aggregation to minimize on-chain data footprints. The verification logic is anchored on the Polygon zkEVM to ensure high throughput and low-cost settlement. Results Extensive simulations on a 16-node high-performance cluster demonstrate that TeleZK-L2 generates proofs at a rate 40% faster than the standard Groth16 baseline. Furthermore, the framework reduces on-chain verification costs by approximately 52%. The system maintains constant-time verification complexity regardless of batch size, achieving a peak throughput of 260 TPS. Discussion TeleZK-L2 provides the technical privacy guarantees necessary to support adherence to HIPAA and GDPR data minimization mandates while maintaining cryptographic soundness. By resolving the "Scalability-Privacy Trilemma," this framework demonstrates significant potential for large-scale deployment in national telehealth infrastructures and remote patient monitoring ecosystems.
We study the implications of the existence of weak Zero-Knowledge (ZK) protocols for worst-case hard languages. These are protocols that have completeness, soundness, and zero-knowledge errors (denoted $ε_c$, $ε_s$, and $ε_z$, respectively) that might not be negligible. Under the assumption that there are worst-case hard languages in NP, we show the following: 1. If all languages in NP have NIZK proofs or arguments satisfying $ ε_c+ε_s+ ε_z < 1 $, then One-Way Functions (OWFs) exist. This covers all possible non-trivial values for these error rates. It additionally implies that if all languages in NP have such NIZK proofs and $ε_c$ is negligible, then they also have NIZK proofs where all errors are negligible. Previously, these results were known under the more restrictive condition $ ε_c+\sqrt{ε_s}+ε_z < 1 $ [Chakraborty et al., CRYPTO 2025]. 2. If all languages in NP have $k$-round public-coin ZK proofs or arguments satisfying $ ε_c+ε_s+(2k-1).ε_z < 1 $, then OWFs exist. 3. If, for some constant $k$, all languages in NP have $k$-round public-coin ZK proofs or arguments satisfying $ ε_c+ε_s+k.ε_z < 1 $, then infinitely-often OWFs exist.
Eman Alatawi, Anoud Alhawiti, Doaa Albalawi, Umar Albalawi
The rapid expansion of the Internet of Things (IoT) has led to billions of interconnected devices generating and exchanging sensitive data across diverse domains, which introduces challenges in identity management (IdM) regarding privacy, scalability, and verifiability. While blockchain technology provides decentralization and tamper resistance, its transparency and increasing on-chain storage demands make it unsuitable for large-scale IoT identity ecosystems. To overcome these challenges, IoT-SBIdM is proposed as a lightweight, privacy-preserving, and stateless blockchain-based identity management framework designed for IoT environments. This framework incorporates Elliptic Curve Cryptography (ECC)-based accumulators and Zero-Knowledge Proofs (ZKPs) to facilitate selective disclosure, enabling entities to prove credential authenticity without exposing sensitive identity information. Furthermore, the framework adopts W3C-compliant Decentralized Identifiers (DIDs) and Verifiable Credentials (VCs) to promote interoperability and user-controlled identity ownership. The experimental results indicate that IoT-SBIdM achieves efficient smart contract execution by reducing gas costs through optimized registry logic. Moreover, the system maintains a compact block size of only 45 MB at higher block heights, outperforming comparable schemes in storage efficiency by achieving a 55% reduction relative to recent models and an approximate 94% reduction relative to older systems, thereby demonstrating superior scalability and storage efficiency, making it suitable for identity management solutions for IoT environments.
Zibin Lin, Taotao Wang, Shengli Zhang, Long Shi · 6 authors
Web 3.0 platforms need an onboarding mechanism that can admit real users at scale without forcing them to reveal identity documents or pay one on-chain verification cost per user. Existing approaches typically rely on KYC-style disclosure, per-request on-chain verification, or trusted batching, making onboarding cost and latency difficult to predict under bursty demand. We present \textbf{ZK-AMS}, a credibly anonymous admission infrastructure that maps Personhood Credentials to anonymous on-chain Soul Accounts. Rather than introducing a new primitive, ZK-AMS composes zero-knowledge credential validation, permissionless batch submission, recursive proof aggregation, and anonymous post-admission account provisioning into one end-to-end workflow. Its key design feature is a confidential batching pipeline in which admission instances of a common relation are folded off-chain under multi-key homomorphic encryption, allowing an untrusted batch submitter to coordinate aggregation without direct access to individual user witnesses during batching; the confidentiality scope is characterized explicitly in the security analysis. The resulting batch is settled on-chain with constant verification cost per batch rather than per admitted user. We implement ZK-AMS on an Ethereum testbed and evaluate admission throughput, end-to-end latency, gas consumption, and parameter trade-offs. Results show stable batch-verification gas across evaluated batch sizes, substantially lower amortized on-chain cost than the non-recursive baseline, and practical cost-latency trade-offs for high-concurrency onboarding in Web 3.0 platforms.
Atefeh Nekouie, Majid Vafaei Jahan, Mohammad Hossein Moattar, Reza Sheibani
Access control and data privacy are two of the main necessities in managing electronic health records (EHRs) across distributed domain. There are privacy gaps that expose EHRs to risks like unauthorized access by unaffiliated medical personnel. Traditional attribute-based encryption (ABE) allows encryption based on user attributes but is unable to incorporate data-specific attributes, such as the type of medical information included in the record or the potential physician. This paper introduces a novel approach that integrates ABE with large language models (LLMs) and blockchain technology to enhance security and contextual access control in EHR systems. Specifically, a domain-specific LLM, such as ClinicalBERT, is leveraged to automatically extract semantic data attributes from unstructured medical records, enabling a more granular and context-aware encryption process. By embedding both user and data attributes into the ABE framework, access policies are dynamically refined, ensuring that only authorized users can view specific types of medical information. Furthermore, blockchain's immutable ledger enhances trust, streamlines attribute revocation, and fortifies the system against unauthorized modifications and security threats. The proposed framework significantly strengthens EHR privacy by integrating machine learning-driven attribute extraction with cryptographic access control, outperforming existing schemes in both security and flexibility. Evaluations validate the effectiveness of the proposed framework in preventing unauthorized access while maintaining efficient and transparent data management.
Michele Battagliola, Laura Mattiuz, Alessio Meneghetti
Abstract The Vector Oblivious Linear Evaluation in the Head (VOLEitH) paradigm has proven to be a versatile tool to design zero-knowledge proofs and signatures in post-quantum cryptography. In this paper, we propose three VOLE-friendly modellings for Proofs of Knowledge (PoK) of a solution of an instance of the Linear Code Equivalence Problem (LEP). For the first two schemes, we propose two new reductions from LEP to the Multivariate Quadratic (MQ) problem, that may be of independent interest for the cryptanalysis of LEP. Instead, the last model is obtained by generalizing a recent work by Bettaieb et al. to the context of monomial matrices instead of permutation matrices. While our proposed schemes exhibit larger signature sizes compared to LESS, they improve the computational efficiency, reducing the overall complexity from $$O(n^3)$$ to $$O(n^2\log n )$$ and $$O(n^2\log ^2 n )$$ , where n is the length of the code.
Disentangle introduces Topological Mass Consensus (TMC), a permissionless consensus mechanism that derives Sybil resistance from discrete curvature on transaction DAGs rather than proof-of-work or proof-of-stake. Edges connecting attack clusters to the honest network exhibit negative Jaccard curvature due to low ancestor overlap, enabling geometric throttling without trusted seeds or economic incentives. The protocol uses exclusively post-quantum cryptography (ML-DSA, ML-KEM, SHA3-256, Plonky3 STARKs) and derives all temporal properties from topological depth. We also present the Capability-Coherence Identity Protocol (CCIP), unifying DID-based identity, object capabilities, and petname naming under the same curvature analysis. Implementation: 9 Rust crates, 349+ tests.
Ms. Neha Beegam P E, Mr. Alen K Sangeeth, Mr. Athulraj Appukuttan, Mr. Alex Jo Tomy · 5 authors
With the rapid digital transformation of ed- ucational and professional environments, certificate ver- ification has become a critical security concern. Tra- ditional certificate authentication systems rely on cen- tralized repositories and manual verification processes, which are vulnerable to forgery, unauthorized modifica- tion, and operational inefficiencies. Blockchain technol- ogy offers a decentralized, immutable, and transparent framework that addresses these challenges. This sur- vey presents an extensive review of blockchain-based cer- tificate authentication systems proposed in recent litera- ture. Various architectures, blockchain platforms, smart contract models, cryptographic mechanisms, and opti- mization techniques are analyzed. A detailed compari- son is presented to highlight strengths, limitations, and open research challenges. The study aims to serve as a comprehensive reference for researchers and practition- ers working on secure and scalable certificate verifica- tion solutions.
Digitization of healthcare has provided opportunities for improving patient care but also has brought with it major security vulnerabilities that could compromise the confidentiality, availability, and integrity of protected health information. This article reviews the proposed distributed system constructs for providing health data security between heterogeneous systems, organizations, and multiple institutions. It categorizes and reviews three approaches to distributed healthcare security: (1) Advanced Encryption Algorithms, including symmetric, asymmetric and homomorphic algorithms for encrypting health information-at-rest and in-transit, and key management mechanisms for secure access to cryptographic material across multiple nodes that may not be trusted; (2) Distributed Storage Systems, including distributed-ledger technology (DLT), distributed file systems, and fragmentation approaches for immutable patient consent and audit trail logging, redundancy to tolerate physical node compromise, and avoiding total infrastructure data loss due to localized security attacks; and (3) Access Control Mechanisms, including multi-factor authentication, role-based access control, attribute-based access control, federated identity management for distributed healthcare organizations, and patient access control and monitoring for distributed threat detection. The distributed model is now more attractive in modern health systems. Perimeter security models do not adequately protect health data. The health data moves through networks connecting hospitals, outpatient clinics, clinical research organizations, insurance companies, and third-party organizations. The proposed framework satisfies regulations according to HIPAA, the General Data Protection Regulation (GDPR), and the Health Information Technology for Economic and Clinical Health (HITECH) Act. The system can be performance optimized to balance between cryptographic strength and system responsiveness. The combination of encryption, decentralized storage, and access control provides defense-in-depth protection against cyberattacks. Future developments, such as artificial intelligence-enabled threat detection, quantum-resistant cryptographic algorithms and models for patient data control will shape how to create secure healthcare systems in our growing digital health networks.
Blockchain technology, characterized by its immutable, distributed ledger, has evolved significantly beyond its cryptocurrency origins, finding application in healthcare and organ donation systems. Specifically, Hyperledger Fabric emerges as a secure, enterprise grade solution for healthcare data management, with a primary focus on patient medical records. Traditional centralized storage of medical records poses challenges for patients, prompting the development of a Hyperledger Fabric-based system driven by smart contracts to enhance accessibility and security. In the realm of organ donation systems, blockchain is proposed as a remedy for the shortcomings of centralized models, offering heightened transparency and security. Notably, while previous solutions often leaned on Ethereum-based blockchains, this research pioneers the use of Hyperledger Fabric. Beyond organ donation, blockchain's attributes, including decentralization, transparency, and privacy, offer transformative potential in healthcare.
The rapid expansion of the blockchain gaming sector, projected to reach a $268.8 billion valuation by 2025 1 , has been severely compromised by the proliferation of automated Sybil attacks and bot-driven economic manipulation. Traditional anti-bot measures, such as CAPTCHAs and behavioural analytics, are increasingly circumvented by advanced AI-driven scripts. This paper proposes a novel Context-Aware Reputation-Identity Hybrid (CRIH) framework that integrates biometric-backed Proof-of-Personhood (PoP) with decentralized reputation metrics. By leveraging World ID’s hardware-oracle verification and recursive Zero-Knowledge Proofs (ZKPs), the CRIH framework enables thrustless identity portability across Layer 2 (World Chain) and Layer 3 (Mythos Chain) architectures. We demonstrate that this tiered, risk-sensitive approach significantly reduces bot-driven inflation while preserving player privacy and minimizing onboarding friction.