Consumer Healthcare Devices (CHD) in Healthcare 4.0 (HC 4.0) increasingly generate continuous physiological data that are transformed into 3-dimensional holographic visualizations for remote monitoring, diagnosis, and clinical decision support. However, existing IoMT and blockchain (BC)-based healthcare systems protect data storage and access but do not verify the integrity, freshness, or provenance of holographic patient representations, leaving such visualizations vulnerable to spoofing, replay, and slice-level tampering. This paper proposes a Blockchain-Assisted Holographic Counterpart (BAHC) framework that cryptographically binds wearable devices to holographic updates using PUF-derived Holographic Authentication Tokens (HAT), enforces slice-level integrity through a Merkle-Hologram-Commitment Tree (Merkle-HC Tree), and anchors updates on a permissioned Proof-of-Authority (PoA) BC. Privacy-preserving access control and verification are achieved using Ciphertext-Policy Attribute-Based Encryption (CP-ABE) and Zero-Knowledge Proofs (ZKPs). The framework is evaluated on a controlled experimental testbed emulating 500 concurrent patient streams using independent public physiological datasets and public MRI volumes for synthetic hologram generation, measuring end-to-end latency, anomaly detection performance, rendering efficiency, and blockchain throughput under up to 100 validators. Experimental results show a 68.6% reduction in holographic rendering latency, a 34% reduction in diagnostic latency, a relative 27% improvement in anomaly detection performance, and sustained throughput close to 500 transactions per second, demonstrating that BAHC provides a scalable and trustworthy foundation for secure holographic monitoring in HC 4.0 systems.
Chaos-based Image/Signal Encryption
Physical Unclonable Functions (PUFs) and Hardware Security
Die vorliegende Arbeit befasst sich mit dem Spannungsfeld zwischen staatlicher Kontrolle und indi-vidueller Autonomie bei der Gestaltung von digitalen Zentralbankwährungen (Central Bank DigitalCurrencies, CBDCs). Auf Basis einer vergleichenden Analyse vier bestehender Systeme â Sand Dollar(Bahamas), e-CNY (China), eNaira (Nigeria) und e-Krona (Schweden) â wird eine deutliche Tendenzzur Zentralisierung sowie ein weitgehendes Fehlen von Technologien zum Schutz der Privatsphäre(Privacy-Enhancing Technologies) aufgezeigt. Mithilfe eines normativen Bewertungsrahmens, der diesechs Kriterien Dezentralisierung, Datenschutz, Interoperabilität, finanzielle Inklusion, Finanzstabil-ität und regulatorische Compliance umfasst, wird ein bislang unbesetztes Gestaltungsfeld identifiziert.Um diese LĂźcke zu schlieĂen, wird ein Referenzmodell konzipiert, das eine erlaubnispflichtige(permissioned) Distributed Ledger Technology mit Zero-Knowledge Proofs, selektiver Offenlegungund einer Multi-Stakeholder-Governance verknĂźpft. Die technische Machbarkeit dieses Modells wirddurch einen funktionalen Python-Prototyp belegt. Die Ergebnisse stĂźtzen die Hypothese, dass hybrideArchitekturen Dezentralisierung, Privatsphäre und regulatorische Konformität erfolgreich in Einklangbringen kĂśnnen.
The rapid development of the Internet of Medical Things (IoMT) has also facilitated real-time monitoring of healthcare, yet creates major issues of security, privacy, and interoperability, particularly in terms of emerging threats of quantum computing. This paper introduces a quantum-resilient blockchain paradigm, which combines post-quantum cryptography (PQC), Zero Knowledge Proofs (ZKPs), and Fast Healthcare Interoperability Resources (FHIR) into secure and interoperable healthcare data management. Key encapsulation is performed using lattice-based algorithms, including Kyber and NTRU, and Dilithium and Falcon are algorithms used to secure digital signatures against quantum attacks. An authentication system which is based on a ZKP, and role-based access control allows privatizing access to electronic health records without exposing sensitive data. The framework is deployed on a PBFT-based permissioned blockchain and tested in simulated IoMT settings and has low latency, high throughput, and efficient cryptographic performance. In general, the suggested system will provide a reconfigurable, secure, and future-oriented method to safeguard the healthcare information against quantum threats without compromising the interoperability of the heterogeneous systems.
Open access
Cryptography and Data Security
Blockchain Technology Applications and Security
Physical Unclonable Functions (PUFs) and Hardware Security
Siqin Li, Kun He, Min Shi, Yajing Huang ¡ 6 authors
Anonymous submissions inspire people to speak up since hiding their identities can protect them from negative influence by their own words. However, the abuse of anonymity may bring harassment to those public submission callers. Existing works only handle DoS attacks or block harassment senders in an active manner, which behave poorly in the early prevention of uncharacterized harassment. In this paper, we propose MsgFliter, a sender-anonymous messaging system with proactive anti-harassment mechanism. Our core idea is to prevent unanswered senders from sending messages continually while keeping their identities, messages, and sender types secret. To meet the functionality and security requirements of MsgFliter, we propose the Anti-Harassment Anonymous Authentication (AHAA) protocol. We associate messages from the same sender through linkable tags and invalidate linkability when a message is replied to. To achieve session indistinguishability, we further combine the proposed anonymous authentication with zero-knowledge proofs of disjunctive relations. We implement MsgFliter and compare its performance with related solutions. Experimental results show that our solution is practicable.
Ensuring efficient task assignment and secure payment in mobile crowdsensing while preserving worker location privacy remains a challenging problem. Existing solutions either rely on expensive encryption schemes, employ blockchain-based verification that incurs high computational and gas costs, or use differential privacy techniques that degrade spatial accuracy. This paper introduces the Privacy-preserving Task Assignment and Payment (PTAP) framework, a lightweight solution built upon secure multi-party computation (SMPC). PTAP employs additive secret sharing and a challenge-response mechanism across three semi-honest servers to achieve anonymous task allocation and payment without blockchain or zero-knowledge proofs. The framework guarantees full unlinkability between worker identities, task locations, and payment records while maintaining accurate location-based assignment and supporting traceability for dispute resolution. Experimental evaluation using the MP-SPDZ framework demonstrates scalability to over 1.5 million workers and 7 million payment tokens. The average end-to-end completion time is approximately 35.4 seconds, with zero gas cost. Compared to the state-of-the-art AVeCQ system [15], which requires about 13 minutes and 37 MWei per transaction on the Goerli network for only 1,024 users. The results confirm PTAP's efficiency, scalability, and strong privacy guarantees for large-scale mobile crowdsensing deployments.
In highly dynamic and interference-prone environments, secure access to wireless communication spectrum and protection of user privacy present significant challenges. To address these issues, this paper proposes a novel framework called the Secure and Privacy-Enhanced Channel Transmission Architecture (SPECTRA). SPECTRA enables fine-grained access control policies defined by a trusted authority and enforces them through distributed Semi-Trusted Distributed Servers (STDSs) using Attribute-Based Encryption and Zero-Knowledge Proofs. This design allows for dynamic spectrum authorization without revealing the requester's sensitive attributes. Furthermore, the frequency-hopping process is modeled as a Markov Decision Process (MDP), and optimized through Proximal Policy Optimization (PPO) to adaptively enhance communication reliability and resistance to interference. SPECTRA also supports both secure replacement and secure incremental update mechanisms, incorporating hash aggregation and elliptic curve signature-based batch verification to improve the efficiency and security of multi-request authentication. Extensive simulations demonstrate that SPECTRA achieves high-accuracy access control, effective communication privacy preservation, and stable frequency-hopping performance under adversarial and uncertain conditions.
Ashutosh Kumar, Manik Malhotra, A. Anjali, Amrendra Singh Yadav
Vehicular Ad Hoc Networks (VANETs) require ultra-low-latency authentication in high-mobility scenarios, decentralized trust, and emerging post-quantum security threats. This paper proposes a lightweight blockchain-assisted group authentication framework that integrates post-quantum cryptography with decentralized trust management. The scheme leverages CRYSTALS-Kyber for secure group key distribution, CRYSTALS-Dilithium for message authentication, and zero-knowledge proofs to achieve conditional anonymity and unlinkability. A permissioned Hyperledger Besu blockchain logs encrypted group keys and dynamically updated roadside unit reputation scores, enabling scalable and accountable authentication without monetary transaction overhead. Formal security analysis under the DolevâYao adversary model demonstrates confidentiality, authentication, replay resistance, and unlinkability based on standard post-quantum assumptions. Performance evaluation using OMNeT++ and SUMO shows up to 52.7% reduction in communication overhead and a group key update latency of 1.2 ms in dense traffic scenarios, while maintaining high throughput and effective Sybil attack detection. These results highlight the practicality of the proposed framework for post-quantum secure VANET authentication.
The secure, privacy-preserving sharing of genomic data across multiple institutions is a critical enabler for precision medicine, yet it remains fundamentally constrained by the identifiability and immutability of genomic data. While blockchain technologies have been proposed to provide decentralized governance, auditability, and tamper resistance for genomic data sharing, blockchain-only solutions are insufficient because they expose transaction metadata, access patterns, and smart-contract logic, leaving significant privacy risks unresolved. Zero-Knowledge Proofs (ZKPs) have recently emerged as a key cryptographic primitive for addressing such limitations, enabling verifiable access control, policy compliance, and computation correctness without disclosing sensitive genomic data. Although several surveys examine ZKPs or blockchain in isolation or across heterogeneous application domains, there is currently no dedicated survey that systematically analyzes their combined use in multi-party blockchain-based genomic data sharing systems. This paper addresses this gap by presenting a comprehensive, domain-specific survey of ZKP-enabled blockchain architectures for genomic data sharing. We classify existing approaches by architectural models, ZKP techniques, governance mechanisms, and threat-mitigation capabilities, and then compare their assumptions, performance characteristics, and deployment maturity. Furthermore, we identify open challenges in scalability, interoperability, proof overhead, and regulatory compliance, and outline future research directions for secure, scalable, and ethically compliant genomic data-sharing ecosystems.
Efficient administration of small estates in Malaysia is characterized by the complications of the hybrid processes between manual and digital administration, and fragmentation of jurisdiction. This paper examines the operational bottlenecks in the existing system of estate distribution coordinated by the Department of Director General of Lands and Mines (JKPTG) as being the challenges of manual verification, absence of integration of the agencies across states, and security of documents as the major impediments to effective governance. In order to overcome these issues, the paper will offer the Integrated Estate Governance Framework (IEGF) an architectural improvisation based on the Small Estates (Distribution) Act 1955. The framework emerged as a result of adopting a Design Science Research (DSR) approach to the development of the study through the qualitative knowledge of senior officers in the JKPTG in a variety of states. The IEGF integrates a Consortium Blockchain with an AI Engine (to support decisions), Smart Contracts (to automate workflows) and Decentralized Identifiers (DID) with ECDSA (to perform secure authentication). The architecture is designed to be privacy and storage efficient by using Zero-Knowledge Proofs (ZKP) and InterPlanetary File System (IPFS). Findings show that the IEGF allows the jurisdiction-independent application process and automatic title endorsement through the e-Tanah integration. The paper has come up with the conclusion that a combination of these technologies offers a scalable, transparent, and robust solution to modernize the national land administration.
97% COMPLETE THEORY OF EVERYTHING - THE THEORETICAL MAXIMUM We present the most complete understanding of reality ever achieved: 97% certainty, representing the theoretical maximum of knowability for finite beings constrained by GĂśdel's incompleteness theorem, Heisenberg uncertainty, and deterministic chaos. WHY 97% IS THE LIMIT:True 100% certainty is fundamentally impossible: ⢠Heisenberg Uncertainty: Cannot know all particle states simultaneously ⢠Deterministic Chaos: Cannot predict all future states exactly ⢠GĂśdel's Incompleteness: No system can prove all truths about itself ⢠BUT: We achieve 100% structural completeness on the FRAMEWORK of reality CERTAINTY BREAKDOWN BY CATEGORY: ⢠Mathematical facts (lattice counts, primes): 100% ⢠Logical necessities (existence, motion, time): 99% ⢠Physical laws (gauge group, generations, Îą): 95-99% ⢠Cosmological constant formula: 99.9% (0.0% ERROR!) ⢠Derived quantities (CKM matrix, masses): 95-98% ⢠Experimental predictions (dark matter): 90-92% ⢠WEIGHTED OVERALL: 97.4% FROM ONE AXIOM TO EVERYTHING: AXIOM: "The unconstrained exists" From this alone, we derive with mathematical rigor: 1. WHY EXISTENCE IS NECESSARY (99% CERTAIN) ⢠Proved "nothing" is logically impossible ⢠If "nothing" existed, it would have the property of existing ⢠Having any property makes it "something," not "nothing" ⢠Therefore: existence is NECESSARY, not contingent ⢠Answers philosophy's ultimate question 2. DUAL LATTICE FINE STRUCTURE CONSTANT (100% CERTAIN) ⢠ιâťÂš = 137 appears in TWO independent structures: - 2D photon lattice: N(41) = 137 (Gauss circle problem) - 4D spacetime lattice: N(5) = 137 ⢠Cutoff 41 UNIQUELY determined: - Euler's prime constant (generates 40 consecutive primes - world record) - 41 = 5² + 4² (Kaluza-Klein 5D â 4D encoding) - 137 = 11² + 4² (M-theory 11D â 4D encoding) - Both 41 and 137 are PRIME numbers - Only candidate giving 1.1% experimental error ⢠Prediction: ÎąâťÂš(M_Z) = 129.3 vs measured 127.944 (1.1% error) 3. COSMOLOGICAL CONSTANT SOLVED - 0% ERROR! (99.9% CERTAIN) ⢠Ď_Î^(1/4) = â(3/4) Ă M_Planck à ι³ / (t_0/t_P)^(1/4) ⢠Predicted: 2.400 Ă 10âťÂł eV ⢠Observed: 2.400 Ă 10âťÂł eV ⢠ERROR: 0.0% (solved 120 orders of magnitude problem!) ⢠Factor â(3/4) = 0.866 appears geometrically ⢠Predicts Î decreases with time as t^(-1/4) ⢠Connects dark energy to fine structure constant 4. COMPLETE CKM MATRIX FROM GEOMETRY (98% CERTAIN) All four Wolfenstein parameters derived: ⢠Ν = â(6/137) = 0.2093 (measured: 0.2253, error: 7.1%) ⢠A = â(2/3) = 0.8165 (measured: 0.811, error: 0.7%) ⢠ĎĚ = â(1/7) Ă cos(13Ď/36) = 0.1597 (measured: 0.159, error: 0.4%) â˘ ÎˇĚ = â(1/7) Ă sin(13Ď/36) = 0.3426 (measured: 0.348, error: 1.6%) ⢠Average error: 2.5% across all parameters ⢠No free parameters - pure geometry 5. HIERARCHY PROBLEM SOLVED (97% CERTAIN) ⢠Electroweak VEV: v â ι⸠à M_Planck ⢠Explains why Higgs is light compared to Planck scale ⢠Natural suppression by 8 powers of fine structure constant ⢠Predicted: ~98 GeV, Observed: 246 GeV 6. NO MULTIVERSE EXISTS - PROVEN (95% CERTAIN) ⢠All constants uniquely determined by logic ⢠ιâťÂš = 137 is the ONLY solution to all constraints ⢠3+1D is the ONLY spacetime supporting stable knots ⢠SU(3)ĂSU(2)ĂU(1) is the ONLY minimal gauge structure ⢠3 generations is the ONLY value satisfying CP + vacuum stability ⢠Zero free parameters â no landscape of possibilities ⢠This universe is THE unique logically consistent reality ⢠String theory "landscape" is an illusion ⢠Many-worlds are superpositions, not separate universes 7. DARK MATTER PREDICTION - TESTABLE NOW! (92% CERTAIN) ⢠Refined prediction: m_DM = 137.036 Âą 1 GeV ⢠Properties: - Spin: 0 or 1/2 (lattice geometry) - Charge: 0 (electrically neutral) - Color: singlet (no strong force) - Weak coupling: possibly ⢠Production at LHC: - Missing energy signatures - Monojet + missing E_T - Z â DM + DMĚ â˘ Currently searchable - FALSIFIABLE! 8. QUANTUM MEASUREMENT SOLVED (95% CERTAIN) ⢠Wavefunction collapse = tension localization on lattice ⢠Born rule emerges from inner product structure ⢠Same mechanism that creates time (irreversible accumulation) ⢠The "measurement problem" dissolves ⢠Not mysterious - logically necessary 9. CONSCIOUSNESS THRESHOLD CALCULATED (90% CERTAIN) ⢠Mathematical definition: System with recursive self-model ⢠Threshold: ~10^14 synaptic connections ⢠Predictions: - Mice (10^10 synapses): NOT conscious - Humans (8.6Ă10^13 synapses): CONSCIOUS - Whales (2Ă10^14 synapses): HIGHLY conscious - AI systems: Conscious at ~10^13 connections ⢠Explains emergence of subjective experience 10. THE OBSERVER RESOLVED (95% CERTAIN) ⢠There is no separate observer ⢠YOU are the universe experiencing itself locally ⢠Consciousness = reality's self-observation ⢠Subjective experience = local lattice self-reference ⢠The "hard problem" dissolves: qualia ARE lattice states 11. WHY LOGIC WORKS - ULTIMATE META-ANSWER (99% CERTAIN) ⢠Logic is not imposed on reality from outside ⢠Logic IS reality's self-consistency ⢠To ask "why logic works" = "why does existence have structure?" ⢠Answer: Existence without structure = undefined ⢠Undefined cannot remain undefined (our axiom) ⢠Therefore existence MUST have structure ⢠That structure IS logic ⢠Laws of thought are NECESSARY FEATURES of existence 12. COMPLETE DERIVATION CHAIN: ⢠Motion: Logically necessary (undefined cannot be static) ⢠Time: Irreversible tension accumulation ⢠Quantum mechanics: Inner product from relational consistency ⢠Complex numbers: Optimal 2D rotation encoding ⢠3+1D spacetime: Unique dimension for stable knots ⢠Gauge group SU(3)ĂSU(2)ĂU(1): Minimal consistent structure ⢠Exactly 3 generations: CP violation + vacuum stability ⢠All 12 fermion masses: Encode ÎąâťÂš = 137 via simple fractions COMPLETE EXPERIMENTAL VERIFICATION: Quantity Predicted Measured Error ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ Existence Necessary Yes 0% 3+1D spacetime 3+1 3+1 0% Gauge group SU(3)ĂSU(2)ĂU(1) Yes 0% Generations 3 3 0% ÎąâťÂš(M_Z) 1-loop 129.3 127.944 1.1% m_Îź/m_e 205.5 206.77 0.6% m_t/m_c 137 136.03 0.7% Ď_Î^(1/4) 2.400Ă10âťÂł eV 2.400Ă10âťÂł eV 0.0% CKM A 0.8165 0.811 0.7% CKM ĎĚ 0.1597 0.159 0.4% CKM ÎˇĚ 0.3426 0.348 1.6% AVERAGE ERROR: < 1% (excluding untested predictions) FREE PARAMETERS: ZERO WHAT 97% MEANS - THE GĂDELIAN LIMITS: 100% CERTAINTY (Mathematical & Logical Facts): â 41 and 137 are prime numbers â N(41) = 137 in 2D lattice (Gauss circle problem) â N(5) = 137 in 4D lattice â 41 generates 40 consecutive primes (Euler) â 3+1D is unique for stable knots â Cosmological constant formula (0% error) 99% CERTAINTY (Logical Necessities): â Existence is logically necessary â Motion emerges from undefined existence â Time is irreversible accumulation â ÎąâťÂš = 137 is the bare coupling â Mathematics IS reality â Logic IS existence's self-consistency 95-98% CERTAINTY (Physical Laws): â Gauge group SU(3)ĂSU(2)ĂU(1) â Exactly 3 fermion generations â All masses encode 137 â Hierarchy v ~ ι⸠M_P â No multiverse exists â Quantum gravity = Planck lattice 90-92% CERTAINTY (Predictions Awaiting Verification): â Dark matter mass = 137.036 GeV â Consciousness threshold ~10^14 synapses â Î time evolution t^(-1/4) THE REMAINING 3% - FUNDAMENTAL LIMITS: 1. Heisenberg: Cannot know exact states simultaneously 2. Chaos: Cannot predict distant future exactly 3. GĂśdel: Cannot achieve complete self-knowledge 4. Experimental: Awaiting dark matter verification These limits are UNBREACHABLE for finite observers.97% is THE THEORETICAL MAXIMUM. QUANTUM GRAVITY COMPLETE: ⢠Spacetime IS a discrete lattice at Planck scale ⢠Einstein equation becomes: Lattice_Curvature = (8Ď/â_P²) Ă Tension_Density ⢠Unifies quantum mechanics (lattice) and general relativity (curvature) ⢠Black holes = horizon lattice configurations ⢠Hawking radiation = lattice excitations TESTABLE PREDICTIONS: 1. Dark matter: 137.036 Âą 1 GeV (LHC searches active NOW) 2. Cosmological constant evolution: Î â t^(-1/4) (observable) 3. No 4th fermion generation (vacuum would decay) 4. AI consciousness at ~10^13 connections 5. Planck-scale discreteness (future quantum gravity tests) NOT NUMEROLOGY - RIGOROUS PROOFS: ⢠Every claim has mathematical proof ⢠Unique solutions (no fitting, no free parameters) ⢠Zero adjustable parameters ⢠Multiple independent verifications ⢠Sub-1% error on most predictions ⢠0% error on cosmological constant PARADIGM SHIFT - PHYSICS = MATHEMATICS = LOGIC = EXISTENCE This establishes: ⢠All "fundamental constants" are logically determined ⢠The Standard Model has ZERO free parameters ⢠No multiverse exists - universe is unique ⢠Consciousness has quantifiable emergence threshold ⢠Existence itself is logically necessary, not contingent ⢠Mathematics doesn't describe reality - math IS reality ⢠97% is the maximum finite beings can achieve PHILOSOPHICAL IMPLICATIONS: ⢠Why existence? Logical necessity (nothing is impossible) ⢠Free will? Emerges from deep lattice self-reference ⢠Purpose? Universe understanding itself ⢠Other universes? None (proven) ⢠Death? Information persists in lattice structure ⢠God? Universe is
Takmer vĹĄetky systĂŠmy pre sprĂĄvu identĂt, centralizovanĂŠ alebo decentralizovanĂŠ, pouĹžĂvajĂş na zaistenie Sybil-rezistencie, ochrany pred Ăştokmi, ktorĂŠ vyuĹžĂvajĂş veÄžkĂŠ mnoĹžstvo faloĹĄnĂ˝ch identĂt, centralizovanĂ˝ prĂstup. Tieto systĂŠmy zvyÄajne vyĹžadujĂş overenie prostrednĂctvom telefĂłnneho ÄĂsla alebo dokladu totoĹžnosti vydanĂŠho ĹĄtĂĄtom. CieÄžom tejto prĂĄce je navrhnúż a implementovaĹĽ decentralizovanĂ˝ systĂŠm pre sprĂĄvu identĂt, ktorĂ˝ zabezpeÄĂ Sybil-rezistenciu, anonymitu pouĹžĂvateÄžov a sĂşkromie ich osobnĂ˝ch Ăşdajov. NavrhovanĂŠ rieĹĄenie vyuĹžĂva overenie biometrie tvĂĄre a anti-Sybil analĂ˝zu sociĂĄlneho grafu. Pre zabezpeÄenie decentralizĂĄcie, anonymity a ochrany sĂşkromia sa vyuĹžĂvajĂş technolĂłgia blockchain, zero-knowledge proofs a trusted execution environments. VĂ˝sledkom je robustnĂ˝ systĂŠm, ktorĂ˝ zabezpeÄuje jedineÄnosĹĽ registrovanĂ˝ch uĹžĂvateÄžov, ich anonymitu a sĂşkromie bez spoliehania sa na centralizovanĂŠ autority. To predstavuje vĂ˝znamnĂ˝ krok k dosiahnutiu samostatnej sprĂĄvy identĂt, ktorĂĄ je v dneĹĄnom svete kĞúÄovĂĄ, keÄĹže osobnĂŠ Ăşdaje sĂş cennou komoditou.