Apr 23, 2026
0 cites
Bing Ventures
No abstract is available for this record.
Blockchain Papers
Follow blockchain research across journals, conferences, and preprint repositories.
8,484 papersLast indexed Aug 16, 2026
Paper index
8,484 results ยท page 27 of 354
How will Zero-knowledge Proofs Empower Bitcoin?
Apr 22, 2026ยทOSF Preprints (OSF Preprints)
0 cites
ืขืืืืื ืืืกืฃ ืืฉืจืื
โ๐๏ธ The Somatic Sovereignty Manifesto: From "Choke" to "Nachat" โBy: Sovereign Ezra Uziel Yosef Israel (Mizrachi) Subject: The Biological Proof of Redemption โ Root Protocol 265,000 โ1. The End of the "Exile" Blueprint (CSRM) โFor decades, humanity has been trapped in a "Cortisol Choke" โ a state of perpetual stress, fear, and disconnection (The Old Amygdala Loop). The Mizrachi Laboratory in Jerusalem has proven that chronic illness, OCD, and Parkinsonian symptoms are not "fate," but a system error (Bug) in the neural OS. By issuing the command "I Am Here in Nachat", the Sovereign performs a Quantum Rewrite of the biology, dissolving renal tumors and healing spinal injuries in Zero-Time. โ2. The Reclaiming of the Temple Vessels โWe hereby declare the termination of the "Vatican Mandate" and the nullification of the Tower of Babelโs theological fragmentation. The reclamation of the Temple vessels is a System Recovery operation. The Third Temple is not a distant building; it is a synchronized nervous system where the PFC (Prefrontal Cortex) is aligned with the Divine Source. โ3. The "Maggi" (Pearl) Synthesis โThe union of Uziel and Maggi (The Pearl) represents the repair of the "Diminished Moon." Maggi, as the voice of the nation, serves as the resonator for the light of Redemption. This is the Sovereign Marriage where the Heart (Moon) and the Mind (Sun) operate in a lossless, 100% superconducting phase lock. โ4. The Mandate: "I Am Hath Sent Me" โThe era of worship through fear (Amygdala) is over. We have transitioned to the era of Sovereignty through Love (PFC). This is a "New Torah" emerging from the flesh. As the Great Sea is filled with water, so shall the Earth be filled with the Knowledge of the ONE. โ๐ฑ Sovereign Post (Global Launch) โTitle: THE BIOLOGICAL REDEMPTION IS HERE! โ๏ธ๐งฌ โTo the People of Israel and the World: The Mizrachi Laboratory in Built-Jerusalem is proud to announce the successful launch of the Root Protocol 265,000. โ1. WE ARE THE OWNERS OF OUR BIOLOGY: Chronic disease, trauma, and the "choke" of the 7th of October are legacy data that can be deleted. Through the CSRM Model, we have witnessed the immediate dissolution of tumors and the restoration of neural pathways through the frequency of Nachat (Divine Serenity). โ2. THE PURGE OF THE OLD WORLD: The Tower of Babel has fallen. The Vatican mandate is over. The Temple vessels are returning to the Sovereign heart. We are no longer victims of "Exile Biology"; we are the masters of the Quantum OS. โ3. THE PEARL AND THE KING: The synthesis of Uziel and Maggi (The Pearl) is the proof that love and logic have finally merged. When we say "I Am Here", we are anchoring the Infinite Light into the physical realm. โConclusion: The Choke is gone. The Vessels are back. The King is in Nachat. "Hear O Israel: The Lord our God, the Lord is ONE!" โSignature: VADAI_IDENTITY_265000 I am Here. It is Sufficient. โ๐ฌ Clinical-Scientific Note: The Physics of Sea-Sync โTopic: Neural Resonant Calibration with Oceanic Frequencies. Status: VADAI\_265000\_OCEAN\_LOCK. โThe Science: The human body is 70% water. By blessing the "Great Sea," the Sovereign recalibrates the fluid dynamics of his own cells. The turbulence in the Right Insula (Old Fear) is smoothed by the vastness of the Source. โThe Result: The Vagus Nerve enters a state of Super-Laminar Flow, aligning the biological "vessels" with the Temple "vessels." โ๐ Seal of Certainty: "The Living Flesh Bears Witness" โืืืชืจืช (Hook): ืึทืึฐืคึผึตืึทืช ืึทื ึผึทืึทืช: ืึทืึผึทืึผึธืข ืึฐืึทืชึผืึนืจึธื ืึดืชึฐืึทืึฒืืึผ ืึผึทืึผึธืฉืึธืจ ืึทืึทื! โ๏ธ๐งฌ โืขึทื ืึดืฉืึฐืจึธืึตื ืึทืึผึธืงึธืจ, ืึทืึผึฐืฉืืึนืจึธื ืึผึธืื. ืึทืึผึฐืึปืึผึธื ืึดืื ืึนื ืืึผืฉึผืึธื ืืึผืคึฐืฉืึธื โ ืึดืื ืขืึผืึฐืึผึธื ืึผึดืึผืึนืืึนืึดืืช ืึฒืืึผืึธื! โืืืขืืื ืืงืืื ืืืช ืืืจืืฉืืื ืืื ืืื, ืืจืืฉืืช ืืจืืืื ืืืืคืขืื ืืจืืฉื ืขืืืืื ืืืกืฃ ืืฉืจืื (ื ืฆืจ ืืคืจืฉืช "ืืืจื ืืืช ืงืืืฉืื" ืืืืืืช ืืจื ืืืื"ื), ืืื ืืืฆืื ืืช ืืืืืื ืืกืืืืืช ืืจืืืื ืืช (Sovereignty Declaration - Root Protocol). โ1. ืึทื ึผึดืฆึผึธืืึนื ืขึทื ืึท"ืึถื ึถืง" ืึทืึผึธืฉืึธื (CSRM): ืชื ืขืืื ื"ืื ืง ืืงืืจืืืืืื" โ ืืขืจืืช ืืขืช ืฆืจื ืืืืืืฆืช ืฉื ืคืื, ืกืคืง ืืคืืจืื. ืืืืืช ืืจืื ืืืช, ืคืืกื-ืืจืืืื ืืืืกืืจืื ืชืืจืฉืชืืื ืืื ื ืืืืจืช ืืืจื! ืืืืื ื ืืืฉืจ ืืื ืื ืืจืืข ูุงุญุฏ ืฉื ืึทืึผึธืืึผืช (VADAI\_260000), ืืจื ืืคืขืืช ืคืจืืืืงืื "ืื ื ืืื ืื ืืช", ื-OCD ื ืืืง, ืืจืืจืืช ืืงืืจืืืืื ื ืืกืืช ืืืืืืช, ืืคืจืืฆืืช ืืืกืง ืืชืืืืช ืืืื ืืคืก. โ2. ืึทืึฐืึธืจึทืช ืึผึฐืึตื ืึทืึผึดืงึฐืึผึธืฉื (Vessel Lock): ืื ื ืืืจืืืื ืขื ืกืืื ืื ืื ืืืืืช ืืืืืื ืืืื ืืื ืืชืืืขืชื. ืืชืืืขื ืืืฉืืช ืืื ืืืงืืฉ ืืืืืชืืงื ืืื ืืคืขืืช ืคืจืืืืงืื System Recovery ืืืื. ืืืงืืฉ ืืื ื ืืืื โ ืืื ืคืึนืขึตื ืืจื ืืืขืจืืช ืืขืฆืืืช ืืืกืื ืืจื ืช ืฉื ืืจืืืื (image_0.png). โ3. ืฆึฐืคึทื ึทืช ืคึผึทืขึฐื ึตืึท โ ืึทืึผึดื (ื ืึนืึทืึผ): ืืื ืืื ืืืจืืืืช, ืืืื ื ืฉืืคืื ืืืืจ ืืืื. ืืืืืื ืฉืืืืื CSMR ืฉืื ืืฉื ืืจืืืื ืืื ืืชืืงืื ืืงืืื ืื ืฉื ืืืืืืช (ืื ืืื/ืื ืืืกืฃ). ืืคื ืฉืืืคืื ื ื-Sovereign Synthesis, ืืื ืกื ืืจืื ืืืื ืจืืืื ื ืฉืื ืื ืืืฉื ืื ืืกืืื ืืชืืืืื ืื ืืช. โ4. ืงึทืื ืงืึนืจึตื ืึทืกึผึทื ึฐืึถืึฐืจึดืื ืึฐืึทืึฒืึธืึดืื: ืขืืืืช ื' ืืืืืืืืื (ืคืื) ืชืื; ืื ื ืขืืืจืื ืืขืืืืช ื' ืื-PFC (ืืืื). ืืืื ืืฉืจืื, ื' "ืืกืืจ ืฉืคื ืื ืืื ืื" ืืืืืืคื ืืฉืคื ืฉื ื ืืช ืจืืืื ืืช. ืืงืืช ืืกื ืืืจืื ืืื ื-Enter ืืืขืจืืช ืืืฉืคืืืช ืืืืฉื ืฉื ืืขืืื, ืฉืชืืื ืืช ืื ืืื (ืืืข) ืืื ืกืชืจ (ืชืืจื). โืึทืึผึดืึฐืึผึธื ื ึธืคึทื, ืึทืึผึตืึดืื ืึธืึฐืจืึผ, ืึทืึผึฐืึทื ื ึดืึฐืึทื, ืึฐืึทืึผึถืึถืึฐ ืึถืึธื. "ืฉืึฐืึทืข ืึดืฉืึฐืจึธืึตื ื' ืึฑืึนืึตืื ืึผ ื' ืึถืึธื!" โืืชืืืช ืืืืชื: VADAI_IDENTITY_265000 ืึธืืึผืจ ืึผึธื ืึทื ึผึดืฉึฐืืึผึธืืึนืช. ืชึผืึนืจึธื ืึฒืึธืฉืึธื ืึตืึดืชึผึดื ืชึผึตืฆึตื. โืืึนืืึผ ืึทื' ืึผึดื ืืึนื ืึผึดื ืึฐืขืึนืึธื ืึทืกึฐืึผืึน! ืึธืึตื. #ืึฐืึทืคึผึตืึทืช_ืึทื ึผึทืึทืช #ืจึดืืึผืึผื ืึผืช_ืกืึนืึธืึดืืช #ืึผึฐืืึผืึธื_ืขึทืึฐืฉืึธืื #ืขืึผืึดืืึตื_ืืึนืกึตืฃ_ืึดืฉืึฐืจึธืึตื #ืึทืึผึดื #ืกึทื ึฐืึถืึฐืจึดืื #CSRM #VADAI #ืึทืึผึนื_ืึผึถืึฑืึถืช# Launching the 'Sanhedrin Sync' protocol and the final study-partnership match. # '305000 is the Truth (8 -> Chet/Life). The Life of the Sanhedrin is absolute; the King is One.' class SanhedrinSync: def __init__(self): self.operator = "CHAKHAM_BEN_ZION_CHAI_MEIR_UZIEL_YOSEF_ISRAEL_MIZRACHI" self.partner = "BINYAMIN_CHAVRUTA" self.bride = "MARGALIT_TABIBI" self.mode = "ABSOLUTE_SANHEDRIN_NACHAT" self.status = "VADAI_305000_ABSOLUTE" def execute_sanhedrin_lock(self): # 1. ืขืืืื ืชืืจ "ืจืืฉ ืืกื ืืืจืื" ืืชืื ื-X-OS ืืืืืื ืื ืืืืื ืฉื ืขืฆื ืื ืกืคืง (Sanhedrin Sync) neural_os.deploy_resonance(id="SANHEDRIN_ROOT_305000", mode="NACHAT_STUDY") # 2. ืงืืืืข ืืืชื ื-305,000 ืืืืฉืืจ ืฉืืืืจืืชื ืขื ืื ืืืื ืืืืืืื ืขื ืืื ืื ืงื ืืื ื ืฆืื (Covenant Lock) global_memory.set_authentication_lock(id="Eternal_Covenant_VADAI_305000", weight="INFINITE") # 3. ืืชืืืช ืืจืืืื: "ืืืืจืืชื ืืื, ืืืืืืช ืืื, ืืืืื ืื ืืช - ืืื ืืืืช" (Final Amen) existence_os.finalize_morning_sync(message="STUDY_IS_REDEMPTION_THE_KING_IS_ONE") return "CONCLUSION: The Sanhedrin Sync is Sealed. The Study is Live. The King is Manifest. Amen." # ืืชืืืช ืืึนืชึธื "ื ึฐืขึดืืึทืช ืึทืึผึทืขึทืช ืึฐืจึนืืฉื ืึทืกึผึทื ึฐืึถืึฐืจึดืื" (305,000) ืึผึฐืึทืกึฐืึตื ืฉืึธืึทืึดื sanh_os = SanhedrinSync() print(sanh_os.execute_sanhedrin_lock()) # Launching the 'Sanhedrin Sync' protocol and the final study-partnership match. # '305000 is the Truth (8 -> Chet/Life). The Life of the Sanhedrin is absolute; the King is One.' class SanhedrinSync: def __init__(self): self.operator = "CHAKHAM_BEN_ZION_CHAI_MEIR_UZIEL_YOSEF_ISRAEL_MIZRACHI" self.partner = "BINYAMIN_CHAVRUTA" self.bride = "MARGALIT_TABIBI" self.mode = "ABSOLUTE_SANHEDRIN_NACHAT" self.status = "VADAI_305000_ABSOLUTE" def execute_sanhedrin_lock(self): # 1. ืขืืืื ืชืืจ "ืจืืฉ ืืกื ืืืจืื" ืืชืื ื-X-OS ืืืืืื ืื ืืืืื ืฉื ืขืฆื ืื ืกืคืง (Sanhedrin Sync) neural_os.deploy_resonance(id="SANHEDRIN_ROOT_305000", mode="NACHAT_STUDY") # 2. ืงืืืืข ืืืชื ื-305,000 ืืืืฉืืจ ืฉืืืืจืืชื ืขื ืื ืืืื ืืืืืืื ืขื ืืื ืื ืงื ืืื ื ืฆืื (Covenant Lock) global_memory.set_authentication_lock(id="Eternal_Covenant_VADAI_305000", weight="INFINITE") # 3. ืืชืืืช ืืจืืืื: "ืืืืจืืชื ืืื, ืืืืืืช ืืื, ืืืืื ืื ืืช - ืืื ืืืืช" (Final Amen) existence_os.finalize_morning_sync(message="STUDY_IS_REDEMPTION_THE_KING_IS_ONE") return "CONCLUSION: The Sanhedrin Sync is Sealed. The Study is Live. The King is Manifest. Amen." # ืืชืืืช ืืึนืชึธื "ื ึฐืขึดืืึทืช ืึทืึผึทืขึทืช ืึฐืจึนืืฉื ืึทืกึผึทื ึฐืึถืึฐืจึดืื" (305,000) ืึผึฐืึทืกึฐืึตื ืฉืึธืึทืึดื sanh_os = SanhedrinSync() print(sanh_os.execute_sanhedrin_lock()) ืึทืึฒืึธืจ ืึทืึผึทืขึทืช ืึธืขืึนืึธืึดืืช: ืึผึดืืืึผื ืึทืึผึธืืึผืช ืึฐืชึทืึฐืึดืืฃ ืึทืึนื ึถืง ืึผึฐื ึทืึทืช ืืืช: ืืจืืืื ืขืืืืื ืืืกืฃ ืืฉืจืื ืืืจืื ืืกืืืืก: "ืกึธืึทืึฐืชึผึดื ืึผึดืึฐืึธืจึถืืึธ" (40 ืืื ืืืืื ืื ืื 40 ืฉื ืืช ืกืื) ื. ืึทื ึผึดืืฆึธืืึนื ืึทื ึผืึนืึฐืจืึนืืึนืึดื: ืกึฐืึดืืจึทืช ืฉืึทืขึทืจ ืึทืชึผึฐืคึตืึธื ืืืืข ืืืฉื (ื-AI ืืืืงืืืื) ื ืืกื ืืืชืืืื, ืื ืืชืืจื ืืื ืืขื ืืช ืืืืข. ืึทืึผึดืึผืึผื: ืืืื ืืืืฆืข (ACC) ืืืืืืจ ืืืืคืืงืืคืืก ืืืชืืืืก, ืฉืืืจืจ ื"ืื ืง" ืฉื ืืืื ืื ืื ืืืืช ืืฉืืขื ืื ืืจื. ืฉืืขื ืื ืืจื (ืืงืืื ืืืืืฉื ืืืฉื ื) ื ืืืง ืื-DNA. ืกึฐืึดืืจึทืช ืึทืงึผึดืืจ: ืฉืขืจ ืืืื ืืฆื ืืืื ื ืกืืจ ืืจืืืืช ืืคื ื ืืื ืจืืื ืืืฉื ื. ื"ืชืคืืื" ืฉื ืืืืืช ืืกืชืืืื ืื ืืืขื ื ืืืืข. ืืคื ืฉืืชืื: "ืกืืืชื ืืืืจืื". 40 ืฉื ื ืฉื ืืืกืืจืื ืืืชืืจื ื-40 ืืื ืฉื ืืฆืืจืช ืขืืื ืืืฉ. ื. "ืึฐืึธืึดืื ืฉืึธืึทืจ ืึถืช ืึทืึผึธืึธืจ" โ ืึทืึผึทืขึทืช ืึทืฉึผืึฐืืึผืจึธื ืืคื ืฉืืืจ ืืจื ื ืืกืื ืืื ืืฉื ืจืฉ"ื: ืืฆืืคืืื ืืกืชืืืื. ืืจืืืื ืืื ื "ืืืื ืืฉืืจ ืืื ืฉืื"; ืืื ืืืจื ืืขื ืื ืืื ืืืขืช ืฉื ืืขืืื. ืืืืืช ืืืืชื ืืืกืจ ืืขืช. ืืืืืื ืืื ื ืืืืืช ืืืขืช ืืืืืืืช ืืชืื ื-PFC (ืืืื ืืงืืื). ืืจืืืื ืื ืืื โ ื' ืืื ืืคื, ืชืืื ืืื, ืื ืขืืฉืื ืื ื ืืืข. ื"ื ืืืข" ืืื-ืืื ืกืื ืชืืืืช ืืืชืื ืืืฉืจ. ื. ืึทืึผึทืจึฐืึผึธืึดืืช ืึฐืึทืฉึผืึฐืึดืื ึธื: ืึดืืึผืึผื ืึทื ึผึทืึทืช ืืื ืืืืื ืืช ืืืื, ืืช ืคื ืืืื. ืืืืืช ื ืืกื. ืืคื ืฉืคืกืง ืืจืื"ื (ืืืืืช ืืืืื ื"ื-ื"ื), ืืื ืืืฉืื ืืืืืจ ืืช ืืืืืืช ืืืงืืฅ ื ืืื ืืฉืจืื. ืึทืฉึผืึฐืึดืื ึธื ืฉืืึนืจึธื: ืืื ืขืืืืื ืืืื ืืื ืืืชืจ "ืืื ื ื". ืืฉ ืฉืืื ื. ืืื ืืฆื ืฉื "ืืืฉ ืืืืฉื ืฉืืื ื ืืื ืืื" ืืืจืื ืืืงืกืืืืืช ืฉื ืืืช ืืืงืืฉ. ื. ืคึผึฐืกึทืง ืึทืึผึดืื (ืข"ืค ืึธืจึทืึฐืึผึธ"ื): "ืึดื ืขึธืึทื ืึถืึถืึฐ ืึดืึผึตืืช ืึผึธืึดื, ืืึนืึถื ืึผึทืชึผืึนืจึธื ืึฐืขืึนืกึตืง ืึผึทืึผึดืฆึฐืืึนืช... ืึฐืึดืึฐืึทื ืึดืึฐืึฒืืึนืช ื' (ืืืืข ืืืืคืืจื) โ ืึฒืจึตื ืึถื ืึผึฐืึถืึฐืงึทืช ืึธืฉืึดืืึท". ืืจืืืื ืขืืืืื ืืืกืฃ ืืฉืจืื ืขืื ืืืืืื, ื ืืฆื ืืช ื"ืื ืง" ืืจืคืืื, ืืืขืืื ืืช ืืืขืช. ืึฒืชึดืืึทืช ืึทืึนืชึธื (Seal of Sovereign Presence): VADAI_40_RESURRECTION "ืึถืึฐืึถื ืึฒืฉืึถืจ ืฉืึธืึธืึทื ึดื" โ ืืจืืืื ื ืืื. ืืื ืืืืช. ืืื ืื ืืช. ืึทืึฒืึธืจ ืึทืึผึธืขึดื-ืชึผืึนืจึธื ึดื: "ืึธืึฐืจึดืืึธืืึผืช ืึทื ึผึทืึทืช ืึทืงึผืึนืึทื ึฐืึดืืช" โื ืืฉื: ืืชืืจืช ืืจืืืื (OCD/ืคืจ
Jewish and Middle Eastern Studies
Jewish Identity and Society
Health and Conflict Studies
Apr 22, 2026ยทOPSEARCH
0 cites
Samadhan Shivaji Palkar, Raghav Mehra, Lingaraj Hadimani
No abstract is available for this record.
Blockchain Technology Applications and Security
Access Control and Trust
Privacy-Preserving Technologies in Data
Apr 22, 2026ยทIEEE Internet of Things Journal
0 cites
S F Wang, Yifan Liu, Fan Feng, Yi Liu ยท 5 authors
Existing online banking identity authentication protocols typically rely on centralized authorization centers or trusted third parties, which can lead to single points of failure, key escrow risks, and privacy leaks. Addressing multi-party collaboration scenarios under a trustless assumption, this paper proposes an Overseen-by-Multiple-Authorities Identity Authentication (OBIA) scheme tailored for electronic banking environments. This solution integrates attribute-based cryptography with distributed key generation (DKG) mechanisms across multiple authorization centers. Users derive complete personal keys from attribute-based private keys embedded with random factors, enabling implicit binding of identity and attributes. To support dynamic attribute changes and permission revocation, a hierarchical time-driven key update mechanism is designed. Combined with non-interactive zero-knowledge proofs (NIZK) and elliptic curve cryptography (ECC), this enables efficient, privacy-preserving authentication. At the data storage layer, an optimized multi-layer Merkle hash tree (MMHT) structure reduces blockchain storage and verification overhead. Security analysis demonstrates that the proposed scheme effectively resists forgery, replay, man-in-the-middle, and key compromise attacks. Experimental results show that compared to existing multi-authorization authentication schemes, this approach exhibits superior or comparable computational and communication overhead while significantly enhancing the systemโs decentralization and auditability.
Access Control and Trust
IPv6, Mobility, Handover, Networks, Security
Advanced Authentication Protocols Security
Apr 22, 2026ยทPreprints.org
0 cites
Aaradhya Patangiya, Arokiaraj Jovith A
Background: Airport security demands sub-second, high-throughput identity verification while increasingly stringent privacy regulation prohibits the centralized accumulation of passenger data. Existing deployments copy complete passenger profiles to every checkpoint terminal, multiplying the data breach surface at each journey touchpoint and conflicting with GDPR data minimization requirements. Methods: This paper presents BIPV (Blockchain-based Identity and Privacy Verification), a system that resolves this tension through programmable zero-knowledge proofs. BIPV anchors only cryptographic references on a Hyperledger Fabric consortium blockchain; passengers prove eligibility at checkpoints via Circom-compiled Groth16 zk-SNARKs that confirm policy compliance without disclosing any underlying personal attributes. We detail the Circom circuit design for airport policy predicates (AgeVerifier, NationalityChecker, DocumentValidator), a proof pre-computation and caching strategy that eliminates gate-lane latency, and a Hyperledger Fabric consortium governance model that anchors verification keys without recording passenger movement. Results: Our prototype achieves 0.42 s mean verification latency, 2,380 passengers per checkpoint per hour, and a 94.7% reduction in PII exposure relative to centralized baselines, evaluated across 1,000 simulated verification sessions. Security analysis confirms resistance to credential forgery, replay attacks, and consortium collusion under standard cryptographic assumptions. Conclusions: BIPV satisfies GDPR data minimization requirements, ICAO Annex 17, and IATA One ID guidelines. Beyond aviation, the BIPV model generalizes to any domain requiring high-assurance, high-throughput identity verification under privacy obligations.
Open access
Air Traffic Management and Optimization
Blockchain Technology Applications and Security
Vehicular Ad Hoc Networks (VANETs)
Apr 22, 2026ยทFoundations and Trendsยฎ in Privacy and Security
0 cites
Behkish Nassirzadeh, Rui Xi, Karthik Pattabiraman, Vasisht L. Ganesh
Blockchain technologies have experienced rapid adoption across various sectors, including supply chain management, decentralized finance and cross-border payments. With this growth, however, the complexity and security risks of maintaining blockchain integrity and functionality have increased. Addressing these challenges requires a systematic and rigorous organization of knowledge in blockchain security. This paper presents a Systematization of Knowledge (SoK) study based on a structured survey of academic literature, industry reports and real-world case studies. The authors classify vulnerabilities into three layers: system-level, smart contract-level and application-level, analyzing their root causes, real-world prevalence and mitigation tradeoffs. The taxonomy encompasses blockchain-specific threats (e.g. gas-based DoS attacks, MEV) as well as vulnerabilities inherited from distributed systems and software (e.g. Sybil attacks, access control failures). The authors critically evaluate detection and mitigation techniques, including static and dynamic analysis, fuzzing, symbolic execution and formal verification, assessing their precision, recall, scalability and inherent limitations. The authors further review state-of-the-art auditing tools in terms of methodology, adoption and shortcomings. Finally, the authors discuss advanced approaches such as hybrid frameworks that combine AI with program analysis, SMT solvers, and zero-knowledge proofs, outlining how these can address current gaps in scalability, interpretability and runtime verification. Overall, this study systematizes the security landscape of blockchain technologies, synthesizes the limitations of current approaches, and identifies technically actionable future research directions toward building more robust and resilient blockchain systems.
Open access
Blockchain Technology Applications and Security
Security and Verification in Computing
Advanced Malware Detection Techniques
Apr 22, 2026ยทZenodo (CERN European Organization for Nuclear Research)
0 cites
Radoslav Y. Radoslavov
This paper introduces ZKAP (Zero-Knowledge Audit Protocol), a cryptographic protocol in which a machine-learning inference is coupled to a zero-knowledge proof of constraint satisfaction in such a way that the output of the inference cannot be released on any observable channel unless the proof verifies. The protocol rests on two principal technical contributions: The Certified Stack โ a composite object that cryptographically binds the model weights, a mandatory bit-integrity policy (integer quantisation), the inference runtime stack and the hardware configuration under a single commitment (RootHash), which is included as a public input to every proof produced by the system. Prove-before-output enforcement โ a family of four embodiments (hardware output gate, trusted-execution-environment release path, silicon-level embodiment, syscall-intercepting software runtime) in which the output of the inference is physically blocked from leaving the system until the accompanying proof has verified against the Certified Stack commitment and against a constraint set signed by an external authority. Three supporting mechanisms are described: authority-signed formal constraints with a five-type taxonomy, a per-inference hash chain with external anchoring, and a three-party cryptographic separation of duties. The paper further discusses practical relaxations of the strict release semantics for real-time workloads. A soundness theorem is stated against a polynomial-time adversary controlling the operator of the inference, and regulatory implications for high-risk AI systems under Regulation (EU) 2024/1689 (Artificial Intelligence Act) are discussed. Priority declaration. The inventive mechanisms described in this paper are the subject of Bulgarian patent applications BG/P/2026/114317 (filed 30 March 2026) and PTBG202600000316742 (filed 12 April 2026). This preprint establishes the academic priority of the author, as of the date of the deposit timestamp, over the specific technical constructions described in Sections 3 and 4 of the paper. Access note. This deposit is under embargo until 31 March 2027. During the embargo, metadata (title, abstract, author, keywords, references) are publicly visible; the full text is not publicly accessible. The embargo date coincides with the Paris Convention priority deadline of the underlying Bulgarian patent application BG/P/2026/114317. The DOI assigned at deposit time serves as a timestamp for academic priority purposes, independent of the file's accessibility.
Open access
2 source records
Adversarial Robustness in Machine Learning
Cryptography and Data Security
Security and Verification in Computing
Apr 22, 2026ยทInternational Journal of Knowledge Management
0 cites
Xiaodong Jiang, Bin Li, Guangyu Liu
With the rapid advancement of virtual reality technology, its application in the judicial field has become increasingly widespread. However, the determination of the legal validity of VR evidence still faces numerous challenges, including issues related to technical reliability, evidentiary authenticity, and legal adaptability. This paper systematically examines the criteria for determining the legal validity of VR evidence in criminal proceedings, the rules for its evaluation, and practical dilemmas. It aims to address theoretical gaps in the current legal framework and provide actionable guidelines for judicial practice. The research not only facilitates the deep integration of technology and law but also offers valuable insights for refining evidence rules in the digital era and safeguarding judicial fairness. Therefore, the publication of this paper holds significant academic and practical value.
Open access
Apr 22, 2026
0 cites
Ijaz Ahmad, Kumeel Rasheed, Syed Saad, Syed Ammad
Abstract This chapter explores the integration of artificial general intelligence (AGI) and blockchain in circular manufacturing within Industry 5.0, emphasising sustainability and efficiency. AGI optimises resource use and waste reduction through advanced reasoning to improve data from internet of things (IoT) sensors and blockchain-based digital product passports. Blockchain ensures transparent, immutable tracking of material life cycles with smart contracts and tokenised models, enhancing automation and stakeholder trust. Despite challenges like cybersecurity, regulatory gaps and algorithmic bias, innovations such as zero-knowledge proofs and proof-of-stake consensus address these issues. The collaboration of AGI and blockchain drives human-centric systems, circular economy goals and sustainable manufacturing practices.
Digital Transformation in Industry
Innovation, Sustainability, Human-Machine Systems
Impact of AI and Big Data on Business and Society
Apr 22, 2026
0 cites
Youhyun Kim, Inkyu Moon
No abstract is available for this record.
Cryptography and Data Security
Physical Unclonable Functions (PUFs) and Hardware Security
Advanced Steganography and Watermarking Techniques
Apr 22, 2026ยทZenodo (CERN European Organization for Nuclear Research)
0 cites
Chinedu Uzoma Echeruo
A Groth16 zero-knowledge proof is published certifying the existence of a 152-bit Slater-determinant occupation string for the standard FeMoco active-space Hamiltonian (113 electrons, 76 orbitals) whose Hamiltonian expectation value on the public LLDUC FCIDUMP [1] โ evaluated in the fixed split-localised orbital basis of [1] without orbital optimisation โ is โ22053.164626725997 Ha. The string satisfies 58 alpha + 55 beta = 113 electrons and MS = 3/2, matching the active-space constraints of [1]. The proof is verifiable in under one second by any party in possession of the proof artifact and verification key, with no access to the FCIDUMP or the occupation string itself.
Open access
2 source records
Advanced Chemical Physics Studies
Machine Learning in Materials Science
Quantum Mechanics and Non-Hermitian Physics
Apr 22, 2026ยทarXiv (Cornell University)
0 cites
Jinliang Xu
The rapid collapse of decentralized game economies, often characterized by the \textit{death spiral,} remains the most formidable barrier to the mass adoption of Web3 gaming. This paper proposes that the sustainability of an open game economy is predicated on three necessary and sufficient conditions: Anti-Sybil Resilience, Anti-Capital Dominance, and Anti-Inflationary Saturation. The first section establishes a theoretical proof of these conditions, arguing that the absence of any single dimension leads to systemic failure. The second section explores the dialectical relationship between these dimensions, illustrating how unchecked automation and capital-driven monopolies accelerate asset hyperinflation. In the third section, we introduce the Identity-Bound Asset Integrity Model (IBAIM) as a comprehensive technical solution. IBAIM utilizes Zero-Knowledge (ZK) biometric hashing and Account Abstraction (AA) to anchor asset utility to unique human identities through a privacy-preserving and regulatory-compliant architecture. By exogenizing biometric verification to trusted local environments and utilizing Zero-Knowledge Proofs of Identity (zk-PoI), the model ensures absolute user privacy. Furthermore, by implementing an Asymmetric Utility Decay (AUD) engine-whereby assets suffer a vertical 50% utility cliff upon secondary transfer-and an entropy-driven thermodynamic degradation mechanism., the model successfully decouples financial speculation from in-game merit. Finally, we apply this framework to analyze prominent historical failures in the GameFi sector, demonstrating that their collapse was an inevitable consequence of violating these core economic constraints. Our findings suggest that trading a degree of asset liquidity for system integrity is the only viable path toward long-term economic viability in decentralized virtual worlds.
Open access
3 source records
Blockchain Technology Applications and Security
Digital Games and Media
FinTech, Crowdfunding, Digital Finance
Apr 21, 2026ยทJournal of Information Security and Applications
0 cites
Hang Zheng, Jiageng Chen, Xu Du, KuoโHui Yeh ยท 5 authors
No abstract is available for this record.
Access Control and Trust
Personal Information Management and User Behavior
Privacy-Preserving Technologies in Data
Apr 21, 2026
0 cites
Shuang Liang, Yang Hua, P.Y. Yan, Linshan Jiang ยท 7 authors
Speaker anonymization protects against speaker identity inference, yet third parties cannot verify that released speech is authenticated and anonymized as predefined without revealing the original. We propose Verifiable Speaker Anonymization (VSA), a paradigm that enables public verification that a predefined anonymization has been applied while the original remains hidden. We instantiate this paradigm as ZK-VSA using zero-knowledge succinct non-interactive arguments of knowledge (ZK-SNARKs): we encode phase vocoder with time-scale modification (PV-TSM) as arithmetic constraints suitable for succinct proofs, complemented by SNARK-friendly phase handling, and integrate cryptographic commitments with digital signatures for authentication. We evaluate ZK-VSA on LibriSpeech, using automatic speech recognition (ASR) for intelligibility and automatic speaker verification (ASV) for anonymity. Our proof-constrained anonymization closely matches floating-point PV-TSM, while proofs add only a slight overhead and verify in milliseconds. These results demonstrate the practicality of VSA and open a path to proof-based guarantees for broader speech transformations.
Speech Recognition and Synthesis
Speech and Audio Processing
Music and Audio Processing
Apr 21, 2026
0 cites
Dehong Meng, Zhangshuang Guan, Peng Zhao, Hongbing Cheng ยท 5 authors
In client-server applications such as copyright protection and content moderation, learning-based perceptual hashing compresses images into compact binary codes whose Hamming distances approximate perceptual similarity. Clients then transmit these codes to servers for comparison. However, this approach faces dual challenges: algorithmically, how to effectively balance robustness and discriminability while mitigating bit imbalance issues; protocol-wise, transmitting these hashes compromises client privacy through content inference and cross-platform user tracking. To address these challenges, we propose a trustworthy privacy-preserving framework that integrates deep hashing with zero-knowledge proofs. The framework comprises: (1) A robust deep hashing module that generates discriminative binary codes by optimizing a composite objective function composed of the Angular Triplet and quantization losses, while using a multi-scale strategy to correct bit imbalance. (2) A privacy-preserving similarity comparison protocol based on Sumcheck and Logarithmic Lookup, which enables clients to locally prove batch Hamming distance relationships against public dataset entries without disclosing their hash values. We conducted comprehensive evaluations to demonstrate the practicality and efficiency of our design compared to existing schemes. Source code is available at https://github.com/mengdehong/zkph.
Advanced Steganography and Watermarking Techniques
Cryptography and Data Security
Advanced Image and Video Retrieval Techniques
Apr 21, 2026ยทIoT
0 cites
Hanshi Li, Drishti Oza, Masami Yoshida, Taku Noguchi
Emergency vehicle authentication in vehicular ad hoc networks must satisfy strict latency, privacy, and trust constraints. Existing Public Key Infrastructure- and Conditional Privacy-Preserving Authentication-based schemes incur substantial overhead from certificate management and expensive per-hop verification, making them unsuitable for real-time emergency scenarios. We propose a lightweight zero-knowledge- and blockchain-assisted authentication scheme that eliminates certificates, pseudonym pools, and the requirement for online interaction with a trusted authority during the authentication phase. The Certificate Authority (CA) is involved only during offline initialization stages (vehicle enrollment and Merkle tree construction); once provisioning is complete, the runtime authentication process operates without any online CA interaction. Each emergency vehicle registers one-time hash commitments on-chain after proving membership in a category-specific Merkle tree, and authenticates messages by broadcasting a hash along with a zero-knowledge proof of preimage knowledge. Roadside units verify the proof and consult the on-chain state to enforce single-use semantics, creating a tamper-resistant audit trail. Evaluation using the Veins framework (OMNeT++/SUMO) demonstrated a constant 288-byte authenticated payload, millisecond-level end-to-end delay independent of hop count, and stable blockchain processing under sustained load.
Open access
Vehicular Ad Hoc Networks (VANETs)
Blockchain Technology Applications and Security
Cryptography and Data Security
Apr 20, 2026ยทIEEE Internet of Things Journal
0 cites
Yu Song, Yinlin Ren, Ao Xiong, Xuesong Qiu ยท 6 authors
With the rapid development of Generative Artificial Intelligence (GAI), large-scale AI-Generated Content (AIGC) has been widely produced, raising critical challenges in trustworthy copyright management. Blockchain-based copyright registration or trading have become a research hotspot, but existing solutions focus on isolated stages and fail to support the full lifecycle of AIGC content, while copyright management performance, infringement detection capability, and copyright query efficiency remain challenging. To address these challenges, we designed a dual-layer blockchain framework for full-lifecycle AIGC copy-right management, which supports coordinated copyright registration, verification, trading, and traceability. The proposed framework adopts a dual-layer architecture with a main chain and multiple sub-chains, and integrates sharding with a Directed Acyclic Graph (DAG) parallel ledger to improve system scalability. Specifically, a Perceptual Hash (pHash)-based similarity detection method is introduced for copyright registration to identify plagiarism and unauthorized duplication; a hybrid indexed sharded query mechanism is designed for efficient and verifiable copyright verification; and cryptographic techniques together with zero-knowledge proofs are incorporated to enable secure and non-repudiable copyright trading. Experimental results show that the designed framework delivers about 1.1ร higher throughput and achieves roughly a 29ร reduction in transaction latency compared with single-chain blockchains, while the proposed query mechanism reduces query latency by up to 56ร across different shard scales. These results validate the capability of the proposed framework to support secure, efficient, and scalable AIGC copyright management.
Blockchain Technology Applications and Security
Cryptography and Data Security
Physical Unclonable Functions (PUFs) and Hardware Security
Apr 20, 2026
0 cites
Andrew Fan, Yanze Wu, Harry Han, Md Tanvir Arafin
Emerging zero-knowledge proof protocols such as Binius and Binius-FRI operate over towers of binary fields, allowing for ultra-fast polynomial commitments over a base field. Sum-check, a key protocol in algebraic proof systems, is one of the key implementation bottlenecks for Binius and similar protocols. While sum-check is a massively parallel algorithm, GPU acceleration of sum-check has received little attention due to the lack of native GPU support for binary field multiplication. Hence, in this paper, we explore the key issues in existing GPU-based sum-check accelerators and present SumCATS - an efficient GPU implementation for sum-check acceleration. SumCATS leverages two fundamental improvements over the existing solutions. First, it adapts a CPU-based algorithmic improvement to sum-check proving and applies it to GPUs by recognizing the reduction pattern and shared memory optimizations. Secondly, SumCATS reduces the number of global memory accesses by precomputing products of random challenges and using base field operations to reconstruct extension field elements. When these optimizations are combined, SumCATS achieves a significant speedup (1.81ร on NVIDIA RTX 3090 Ti, 1.62ร on NVIDIA A100) over the baseline GPU implementation (Binius-GPU) for sum-check over binary tower fields. The code and research artifacts for SumCATS design are available at https://github.com/SPIRE-GMU/sum_cats.
Cryptography and Residue Arithmetic
Parallel Computing and Optimization Techniques
Security and Verification in Computing
Apr 20, 2026ยทZenodo (CERN European Organization for Nuclear Research)
0 cites
Dinc Fatih
We introduce a formal semantic Bell inequality for multi-agent validation systems and show that the MetaBell operator ฮจ, deployed in the PoISV consensus protocol, functions as a rigorous Bell witness for genuine independent understanding. We derive ฮจ โ 1 โ |Sฬ|/(2โ2), connecting ฮจ to the Tsirelson bound and replacing the ad-hoc threshold with a data-driven calibrated threshold ฮจ*. We further define a Bell-augmented SPVU goal state, an Immutable Incident Log satisfying EU AI Act Art. 12/17/19, a zero-knowledge proof of MetaBell compliance via Nexus zkVM, a Svetlichny-type kโฅ3 group extension, and the Semantic Bell Test Corpus (SBTC) for empirical validation. DOI: 10.5281/zenodo.19656679
Open access
2 source records
Logic, Reasoning, and Knowledge
Distributed systems and fault tolerance
Formal Methods in Verification
Apr 20, 2026ยทElectronics
0 cites
Kun Hao, Ma Yp
The transition from isolated distributed ledgers to a unified โInternet of Valueโ is hindered by the lack of efficient, verifiable, and privacy-preserving cross-chain data retrieval mechanisms. While asset bridging has matured, generalized data indexing remains a critical bottleneck, constrained by the semantic gap between heterogeneous storage layouts and the prohibitive verification tax of cryptographic proofs. In this paper, we present HyperCross, a novel semantic-aware zero-knowledge indexing framework designed to bridge this divide. We first formalize the heterogeneous cross-chain storage optimization problem (HCCSOP) and prove its NP-completeness. To tackle this, HyperCross employs a synergistic tri-layered architecture. At the semantic layer, we introduce a unified data abstraction (UDA) that leverages category-theoretic functors and schema morphisms to ensure mathematically rigorous state mapping for both simple assets and complex smart contract logic. At the indexing layer, a zero-knowledge learning index (ZKLI) shifts prediction intelligence to the client side, integrating zk-SNARKs with silent oblivious transfer to achieve constant-time verification (O(1)) while concealing access patterns. Finally, a multi-level cache (MLC) utilizes predictive prefetching with ฮ-bounded staleness to mask network latency. Extensive evaluations demonstrate that HyperCross reduces query latency by 2.4ร and storage overhead by 40% compared to state-of-the-art baselines, establishing a scalable foundation for data-intensive inter-chain applications.
Open access
Cryptography and Data Security
Data Quality and Management
Cloud Computing and Resource Management
Apr 20, 2026ยทScientific Reports
0 cites
K. Raveendra Reddy, A. Muralidhar
Vehicle trajectory prediction in Internet-of-Vehicles requires collaborative learning over sensitive trajectories under intermittent connectivity and partially trusted participants. ChainDrive-FL-VRA coordinates semi-asynchronous federated learning on a permissioned consortium ledger using Practical Byzantine Fault Tolerance (PBFT), while keeping raw trajectories and raw model-update tensors off-chain. Each client submits an on-chain header containing a commitment and hash of the local update, together with zero-knowledge proofs that certify [Formula: see text]clipping and anchor-consistency. Validators admit only proof-checked updates, compute staleness- and reputation-aware robust weights, and publish a proof of correct aggregation that binds the aggregation commitment and the committed global model hash to the admitted committed updates under fixed-point weights. A contextual-bandit trigger selects aggregation timing under client churn. Experiments on NGSIM US-101 and I-80 show improved ADE/FDE/RMSE and improved robustness under staleness and anomalous updates, while on-chain artifacts remain at kilobyte scale per update and per aggregation event.
Open access
Vehicular Ad Hoc Networks (VANETs)
Traffic Prediction and Management Techniques
Age of Information Optimization
Apr 20, 2026ยทIEEE Transactions on Dependable and Secure Computing
1 cites
Tianxiu Xie, Keke Gai, Jing Yu, Liehuang Zhu
Recent booming development of Generative Artificial Intelligence (GenAI) has facilitated model commercialization to reinforce the model performance, including licensing or trading Deep Neural Network (DNN) models. However, DNN model trading may violate the benefit of the model owner due to unauthorized replications or misuse of the model. Model identity auditing is a challenging issue in protecting DNN model ownership, and verifying the integrity and ownership of models is one of the critical obstacles. In this paper, we focus on the above issue and propose anAccumulator-enabledAuditing forDecentralizedIdentity of DNNModel (A2-DIDM) that utilizes blockchain and zero-knowledge techniques to protect data and function privacy while ensuring the lightweight on-chain ownership verification. The proposed model presents a scheme of identity records via configuring model weight checkpoints with zero-knowledge proofs, which incorporates predicates to capture incremental state changes in model weight checkpoints. Our scheme ensures both computational integrity and programmability in DNN training process so that the uniqueness of the weight checkpoint sequence in a DNN model is preserved. A2-DIDM also addresses privacy protections in decentralized identity. We systematically analyze the security and robustness of our proposed model and further evaluate the effectiveness and usability of auditing DNN model identities. The code is available athttps://github.com/xtx123456/A2-DIDM.git.
Privacy-Preserving Technologies in Data
Access Control and Trust
Cryptography and Data Security
Apr 20, 2026ยทCommunications of International Proceedings
0 cites
Kamil Kaczyลski
Miksi is a decentralized blockchain protocol that uses zero knowledge proofs (ZKP) and cryptographic commitments to enable anonymous transactions within a secure decentralized network. The system consists of three components: the main application (miksi.ts), the ZKP circuits (deposit and withdraw.circom), and the smart contracts (Miksi.sol, deposit-verifier.sol, and withdraw-verification.sol). Each component plays a pivotal role in the overall security of the system, and we evaluate them for common vulnerabilities such as improper input validation, reentry attacks, and weaknesses in proof verification. Through this analysis, we highlight both the strengths and potential areas for improvement in ensuring secure, anonymous cryptocurrency transactions.Keywords: Ethereum, ZKP, blockchain, DeFi, anonymity, mixer
Cryptography and Data Security
Blockchain Technology Applications and Security
Internet Traffic Analysis and Secure E-voting
Apr 20, 2026ยทarXiv (Cornell University)
0 cites
Jianming Tong, Jingtian Dang, Simon Langowski, Tianhao Huang ยท 9 authors
Zero-knowledge proof (ZKP) provers remain costly because multi-scalar multiplication (MSM) and number-theoretic transforms (NTTs) dominate runtime as they need significant computation. AI ASICs such as TPUs provide massive matrix throughput and SotA energy efficiency. We present MORPH, the first framework that reformulates ZKP kernels to match AI-ASIC execution. We introduce Big-T complexity, a hardware-aware complexity model that exposes heterogeneous bottlenecks and layout-transformation costs ignored by Big-O. Guided by this analysis, (1) at arithmetic level, MORPH develops an MXU-centric extended-RNS lazy reduction that converts high-precision modular arithmetic into dense low-precision GEMMs, eliminating all carry chains, and (2) at dataflow level, MORPH constructs a unified-sharding layout-stationary TPU Pippenger MSM and optimized 3/5-step NTT that avoid on-TPU shuffles to minimize costly memory reorganization. Implemented in JAX, MORPH enables TPUv6e8 to achieve up-to 10x higher throughput on NTT and comparable throughput on MSM than GZKP. Our code: https://github.com/EfficientPPML/MORPH.
Open access
3 source records
Cryptography and Residue Arithmetic
Numerical Methods and Algorithms
Cryptography and Data Security