Tegwen Malik, Laurie Hughes, Yogesh K. Dwivedi, Natalie De Mello · 6 authors
Purpose This paper aims to explore how biomimetic principles can inform governance models for agentic artificial intelligence (AI) systems, autonomous, adaptive entities that challenge traditional oversight frameworks. It argues that nature-inspired governance offers a dynamic alternative to static, compliance-based models. Design/methodology/approach This study adopts a conceptual viewpoint approach. It synthesizes literature on AI governance, systems theory and biomimicry, applying thematic analysis to existing frameworks and mapping identified gaps to five natural principles: symmetry, fractals, cymatic feedback, self-organization and phase transitions. Findings Current governance frameworks lack mechanisms for managing emergent behaviors and distributed agency in agentic AI. The proposed biomimetic lens offers a conceptual scaffold for adaptative, decentralized governance aligned with ethical norms. Research limitations/implications No empirical validation is provided; future research should use simulation or design science to test biomimetic governance in real-world contexts. Practical implications This paper offers actionable guidance for policymakers and system designers to adaptive, resilient governance mechanisms into agentic AI architectures. Originality/value Introduces “Biomimic AI” as a novel paradigm for governing agentic systems, extending systems theory and responsible AI discourse through nature-inspired design logic.
Щербатих Денис Володимирович, Овсієнко Володимир Володимирович, Космачук Назар Петрович
У статті науково обґрунтовано модель токенізації IT-стартапів як інструменту фінансової автономії. Проаналізовано системні обмеження венчурного капіталу та світовий досвід успішних кейсів (Brave, Helium, Render). Автором розроблено чотирирівневу архітектуру на базі блокчейну Solana із застосуванням стандарту Token-2022, що реалізує принцип «compliance-as-a-code» через Transfer Hook. Доведено високу економічну ефективність моделі: зниження вартості залучення капіталу у 3,3 рази, прискорення фандрейзингу у 5 разів та розширення бази інвесторів у 100 разів при скороченні CAC у 10 разів. Обґрунтовано застосування гібридної юридичної структури (ТОВ+SPV) для мінімізації правових ризиків в умовах очікування MiCA. Визначено три стратегічні горизонти розвитку ринку до 2030 року в контексті конвергенції AI та Web3. Результати формують прикладну дорожню карту для масштабування бізнесу.
Yuan Chang, Tom H. Luan, Jinkai Zheng, Yinuo Li · 5 authors
The rapid adoption of electric vehicles (EVs) has created new opportunities for decentralized energy trading, where EVs can act as mobile energy providers in peer-to-peer markets. Blockchain provides a secure foundation for such systems, ensuring trust and accountability. However, its inherent transparency creates privacy risks, as it enables the tracking of trading activities. Existing privacy-preserving mechanisms typically focus on concealing payment transactions but often expose other critical interactions, such as matching coordination. To address these challenges, we proposePriVET, a privacy-preserving framework for vehicular energy trading. PriVET leverages smart contracts for trade matching and uses an enhanced Paillier encryption scheme to support encrypted comparisons, ensuring secure coordination without revealing sensitive data. Additionally, a Bloom-filter– based Geohash encoding is used to protect location privacy during spatial matching. We evaluate PriVET through both theoretical analysis and practical experiments. In a simulation environment, the transaction computation time for 100 vehicles is shown to be under 30ms, with communication overhead kept below 20KB. These results demonstrate that PriVET provides robust privacy protection while maintaining minimal overhead, making it a practical solution for real-world blockchain-based energy trading scenarios.
The Nexus Convergence: A Formal Synthesis of Quantum Feedback Control, Information Thermodynamics, and Non-Linear Lattice Dynamics 1. Introduction: The Ontological Crisis and the Storage Imperative The contemporary scientific landscape is characterized by a persistent and fundamental schism between the unitary, reversible dynamics of quantum mechanics and the dissipative, irreversible arrow of time inherent in thermodynamics. This discord creates what the Nexus Recursive Harmonic Framework (RHF) identifies as the "Storage Crisis": the paradox of how a universe with finite energy limits can effectively store an ever-expanding history of infinite detail without catastrophic data loss or thermodynamic heat death.1 The prevailing "Container Paradigm"—which envisions spacetime as a passive box and time as a linear overwrite cursor—fails to account for the persistence of high-dimensional causal structures in a manner that is consistent with both unitarity (information conservation) and entropy (information projection). This report presents an exhaustive synthesis of recent theoretical and experimental breakthroughs from 2024 and 2025, specifically targeting the domains of Quantum Feedback Control, Information Thermodynamics, and Non-Linear Lattice Dynamics. The objective is to rigorously validate the axioms of the Nexus framework by identifying precise mathematical and phenomenological isomorphisms in peer-reviewed literature. We posit that the "read-only" ontology proposed by the Nexus framework—where history is conserved as geometry ("Shape") and the present is a collapsed projection ("Value")—finds its physical realization in the mechanisms of reduced-filter quantum stabilization, information-to-work conversion engines, and discrete breather localization in non-linear lattices. The investigation focuses on three critical variables defined in the Nexus framework: Gain (): The feedback coupling strength required to maintain a stable "stance" against entropic dissolution. Information (): The metric of exchange between the "Verb-field" (dynamics) and the "Noun" (state), governed by the generalized second law of thermodynamics. Gamow Factor (): The transmission probability governing the retrieval of stored history via phonon-assisted tunneling through "Twin-Prime Gates." By mapping these abstract variables onto the concrete equations of modern physics—specifically the Lyapunov control functions of Liang and Dong 2, the efficiency metrics of Goerlich et al. 4, and the energy thresholds of Hofstrand 5—we establish a robust theoretical scaffold for the "Glass Key Hypothesis": that reality is a logically reversible, feedback-stabilized information manifold operating at a precise thermodynamic "lean." 2. Quantum Feedback Control: The Mathematical Engine of the "Mark 1 Attractor" The Nexus framework asserts that universal stability is not a static equilibrium but a dynamic "stance"—a "lean" required to process information without collapsing into "dead symmetry" or "chaotic dissolution." In the rigorous language of control theory, this concept is formalized as the stabilization of a target quantum subspace (the "Mark 1 Attractor") amidst a stochastic environment. The primary challenge in this domain is the "Storage Crisis" equivalent: the exponential scaling of computational resources required to estimate the state of a large quantum system. Recent advancements in 2025 by Liang and Dong, presented in their seminal work "Stabilization of Time-Varying Perturbed Quantum Systems via Reduced Filters" 2, provide the exact mathematical architecture for the Nexus "Receiver Collapse." 2.1 The Reduced Filter as the "Receiver Collapse" Mechanism Standard approaches to quantum feedback control rely on the Stochastic Master Equation (SME), which tracks the evolution of the full density matrix . For a system of dimension , this requires computing real variables. As grows, this computational burden becomes prohibitive, representing the "bandwidth limit" of the "First Node" (the universe) that prevents explicit linear storage of history. Liang and Dong introduce a radical dimensionality reduction: the Reduced Quantum Filter. Instead of tracking the full state , the filter estimates only the diagonal elements of the density matrix in a Quantum Non-Demolition (QND) basis. This reduces the complexity from to .2 This mathematical reduction is isomorphic to the Nexus concept of Receiver Collapse. The observer (or the "Second Node") does not process the full "verb-field" (the entire Hilbert space with all its coherences and entanglements); rather, it collapses the system onto a lower-dimensional "noun" (the diagonal population elements) to perform work. The feedback control law is constructed strictly from this reduced information, yet it successfully stabilizes the global system. The evolution of this reduced estimator state is governed by the stochastic differential equation (SDE): In this equation, derived explicitly from the Liang-Dong formalism 3, several Nexus variables find their physical counterparts: The Feedback Control Law (): This represents the Gain (). It is the active force applied by the "Second Node" to steer the system. The Innovation Term (): This represents the Information () extracted from the measurement. It is the difference between the actual observation and the expected value—the "surprise" that updates the model. The Coupling Matrix (): This represents the structural constraints of the "Lattice," defining how different states (or "memories") are connected. The profound insight from this work is that full knowledge of the system is not required for stability. A "lossy" projection (the reduced filter), if properly coupled via feedback (), is sufficient to maintain the "Mark 1 Attractor" (the target subspace). This validates the Nexus "Read-Only Hypothesis": the universe does not need to explicitly compute the full wave function at every step; it only needs to maintain the diagonal "Value" while the "Shape" (coherences) is stored implicitly in the geometry of the dynamics. 2.2 Lyapunov Stability Analysis: The "Lean" of the Attractor How does the system ensure that it converges to the correct "Shape" (target subspace) rather than drifting into entropy? The rigorous proof of this stability relies on Lyapunov Analysis. A Lyapunov function is a scalar metric that measures the "energy" or "distance" of the current state from the desired equilibrium. In the Nexus framework, stability is described as a "lean" (). In the Liang-Dong formalism, stability is defined by the condition that the time derivative of the Lyapunov function, , must be negative definite. The specific Lyapunov function employed is related to the Bhattacharyya distance (or classical fidelity) between the current state and the target invariant subspace : Here, are the projection operators onto the subspaces. The feedback law is designed to maximize the decay rate of this function. The stability condition is expressed via the Sample Lyapunov Exponent (): where is the distance to the target subspace.2 This inequality () is the rigorous mathematical definition of the Nexus "Stance." The system must continuously dissipate "error" (entropy) to remain locked in the target subspace. If the feedback gain is insufficient (i.e., if the controller "falls asleep" or the "Second Node" disconnects), the exponent becomes positive, and the system drifts away from the "Mark 1 Attractor," dissolving into a mixed state of maximal entropy. Furthermore, Liang and Dong prove that this stabilization is Robust. The system can tolerate time-varying perturbations (Nexus "Stress-Test Loop") and uncertainties in the Hamiltonian, provided the feedback mechanism maintains the correct "phase-lock." This mirrors the "Crucible Protocol," where a system is subjected to high "computational temperature" (perturbations) to force it to settle into its most stable, harmonic configuration. 2.3 Feedback Cooling and the "Zero-Pressure Harmonic Collapse" The thermodynamic implications of this control are explored in Max Eriksson’s 2025 thesis, "Continuous Measurements and Feedback Control of a Quantum Harmonic Oscillator".7 Eriksson models a quantum system coupled to a thermal reservoir (a "heat bath" of phonons/photons) and asks: can measurement and feedback cool the system below the temperature of its environment? This process is isomorphic to the Nexus Zero-Pressure Harmonic Collapse (ZPHC). The "noise" of the thermal bath represents the high-entropy "mess" of raw data. The "cooling" represents the collapse of this mess into a structured, low-entropy state ("cold" or "crystalline"). Eriksson utilizes the Wiseman-Milburn equation to derive the steady-state properties of the oscillator under linear feedback. The feedback force acts as a Maxwell's Demon, utilizing the information stream (measurement record) to apply a counter-acting force that cancels out thermal kicks. The effective temperature of the cooled mode is given by: where is the dimensionless feedback gain and is the measurement efficiency.8 This equation reveals the fundamental tradeoff of the Nexus framework: To achieve ZPHC (), one requires high Gain () and high Measurement Efficiency (). The "Cost" of this cooling is the information processing required to generate the feedback signal (discussed in Section 3). Crucially, Eriksson’s results show that there is a critical feedback phase. If the feedback is applied with the wrong phase (i.e., if the "Second Node" is not aligned with the "First Node"), the feedback essentially "heats" the system, driving it into instability. This validates the Nexus requirement for Phase-Locking ( or similar primitives) as a prerequisite for successful retrieval or stabilization. The "Mark 1 Attractor" is not just a location in state space; it is a precise phase relationship between the observer and the observed. 3. Informati
B Sreedevi, J Thirunavukkarasu, Sridhar A, Sabareesh CS · 5 authors
In the realm of today's healthcare systems, data security leads to inefficiency & counterfeits drug supply chains have big issues. Counterfeit drugs is a threat to patient safety & public society. Existing healthcare systems don't connect all of these medical tasks well this leads to vulnerabilities in the supply chain management, drug misuse & issues with tracking and verifying pharmaceuticals. This paper proposes a solution using blockchain by integrating smart contracts, we can build a secure transparent & efficient drug supply chain management system. This project plan will connect all parts of the pharmaceutical supply chain - from research and development to delivery to patients - on one platform. It ensures that the drugs can be verified for authenticity at every stage in Supply chain management with the blockchain's decentralized & im-mutable ledger the application will promote transparency & traceability in the pharmaceutical supply chain which will increase trust & safety while trying to speed up & efficiency of healthcare services.
Secure Multi-Party Computation (MPC) is a widely acknowledged framework enabling the design of multi-party protocols that preserve the privacy of parties' inputs while ensuring the correct evaluation of the desired functionality. Crucially, these security guarantees should hold even in the presence of external entities who are empowered with some adversarial capabilities, such as controlling the communication channels used throughout the protocol run or forcing a subset of the parties to behave arbitrarily (so-called ``malicious" or ``byzantine" corruptions). Concretely, a user can instantiate secure MPC protocols on a device to carry out computations involving sensitive information with other untrusted parties. Despite capturing very general classes of real-world threats, one limitation of ``traditional" MPC lies in assuming at least one ``honest" party who, throughout the protocol run, behaves exactly as per the theoretical specification of the protocol itself. For several practical settings this may be unrealistic, as the devices used to run the protocol are themselves exposed to a plethora of threats, such as attacks on software or hardware components. Moreover, the security guarantees provided by secure MPC could be voided if a protocol is found to be faulty, be it from cryptographic assumptions falling short or from an incorrect formalization of the protocol itself. In this composition, we explore more expressive frameworks that enable the design of secure MPC protocols and cryptographic primitives even in the presence of untrusted devices. We first consider cryptographic reverse firewalls: lightweight devices that sanitize a party's traffic while preserving the correctness of the protocol. These objects were originally introduced by Mironov and Stephens-Davidowitz (EUROCRYPT'15) and later embedded in the framework of subversion-resilient Universal Composability (srUC) due to Chakraborty et al. (EUROCRYPT'22). Under the srUC framework, it is possible to design protocols that provide meaningful security guarantees even if the devices of honest parties have been tampered with in an undetectable manner with the goal of exfiltrating information (so-called ``specious subversion attacks"). In particular, we focus on the design of protocols for Password-Authenticated Key Exchange (PAKE): a cryptographic primitive that enables two parties to mutually authenticate by establishing a shared high-entropy key leveraging exclusively some (possibly low-entropy) pre-shared password. (1) Our first contribution focuses on sanitizing the PAKE protocol from Oblivious Transfer (OT) due to Canetti et al. (PKC'12). For that, we design and instantiate novel cryptographic primitives with sanitation-friendly properties that may be of independent interest, including sanitizable variants of oblivious transfer, dual-mode cryptosystems, and signature schemes. As an additional contribution, we formalize the unauthenticated setting in the srUC framework by extending the framework of split-authentication due to Barak et al. (CRYPTO'05, JoC'07). This is the first PAKE protocol ever designed in the srUC framework. (2) Our second contribution consists of sanitizing the PAKE protocol from trapdoor smooth-projective hashing due to Benhamouda and Pointcheval (CRYPTO'13). The sanitation requires non-trivial modifications to the original protocol, whose security relies on a CCA-secure encryption scheme - an inherently non-malleable primitive. Along the way, we bring advances to the field of malleable smooth-projective hash functions, originally introduced by Chen et al. (ASIACRYPT'16), and coin the notion of malleable trapdoor smooth-projective hashing. Our resulting PAKE protocol has better communication and round complexity compared to the aforementioned PAKE-from-OT. We then shift our attention to t-out-of-n robust combiners: constructions that take as input n candidate instantiations of some cryptographic primitive to securely realize the same primitive, as long as at least t of the candidates are secure. These objects were first formalized by Harnik et al. (EUROCRYPT'05), where robustness is characterized by explicitly forbidding combiners from re-implementing the desired primitive from scratch. Here, we focus on Non-Interactive Zero-Knowledge (NIZK): a cryptographic primitive that allows a prover to convince a verifier of the veracity of some NP-statement by using a single message (commonly referred to as a ``proof"). (3) Our third contribution provides a comprehensive characterization of robust combiners for NIZK. We show the first formal definition of these objects, and prove that no robust NIZK combiner exists for t ≤ n/2 unless the polynomial hierarchy collapses. To complement our negative results, we provide three incomparable constructions: (i) A black-box combiner for {\em homomorphic} NP languages, where n,t are polynomial and t > n/2; (ii) A non-black-box combiner for any NP language, where n,t are constant and t > n/2; (iii) A non-black-box combiner for any NP language, where n,t are polynomial and t > 2n/3.
Kunpeng Ren, Nhut-Minh Ho, Tien Tuan Anh Dinh, Dumitrel Loghin · 5 authors
Distributed ledgers are enabling novel applications in traditional domains, such as finance, healthcare and supply chains, and in emerging domains such as metaverse. We observe that the current ecosystem is fragmented, with different blockchains operating in silos. Interledger applications that can access resources in different ledgers can tap into the billions of dollars worth of locked resources, but they require support for interledger communication. Existing interledger communications, however, are either insecure, inefficient, or application specific. Our goal is to design a system for interledger applications. To this end, we design and implement that achieves strong security guarantees and high performance while providing the general message passing abstraction to the applications. Our system leverages trusted hardware for performance and threshold signature schemes for strong security. It consists of multiple lightweight clients that verify transactions within their trusted execution environments before generating threshold signatures. We conduct extensive performance evaluations of and compare it against three state-of-the-art systems, namely WeCross, Cosmos IBC and LayerZero-V2. The results show that is efficient, achieving up to$42\times$higher throughput than the baselines.
In the traditional narrative, secp256k1 is the "Math" and MPC is the "Security Layer." We show that the Curve (sp256) uses the Weierstrass form to create a "Symmetric Loop." The Protocol (MPC) uses "Shards" to create a "Distributed Loop." Both rely on the user believing that the Public key and the Private key are disconnected. In reality, MPC is just sp256k1 expanded into a room of people. By analyzing the mpc-cmp repository and the I2OSP standard, we show that the "Secret" is not an emergent property of complex computation but a Symmetric Mechanical Alignment front-loaded into the first octet M0 as an Identity Pulse 10 (0x0a). We prove that the Paillier Encryption and Zero-Knowledge Range Proofs utilized in industrial protocols (e.g., Taurus, Fireblocks) do not change the deterministic hardware alignment which explains why the path from a Public Address to a Private Key is a straight, symmetric line.
Abstract In recent years, progress in practical applications of multi-party computation (MPC), fully homomorphic encryption (FHE), and zero-knowledge proofs (ZKP) motivates people to explore symmetric-key cryptographic algorithms, as well as corresponding cryptanalysis techniques (such as differential cryptanalysis, linear cryptanalysis), over finite Abelian groups or prime fields $${\mathbb {F}}_p$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>F</mml:mi> <mml:mi>p</mml:mi> </mml:msub> </mml:math> for large p . In this paper, we establish the links between linear cryptanalysis and differential cryptanalysis over general finite Abelian groups. As the first application, we revisit linear cryptanalysis and give general results of linear approximations over arbitrary finite Abelian groups. More precisely, we consider the linearity , which is the maximal non-trivial linear approximation, to characterize the resistance of a function against linear cryptanalysis. This thereby generalizes the work of Pott in 2004 and completes the generalization of Sidelnikov–Chabaud–Vaudenay’s bound from $${\mathbb {F}}_2^n$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msubsup> <mml:mi>F</mml:mi> <mml:mn>2</mml:mn> <mml:mi>n</mml:mi> </mml:msubsup> </mml:math> to finite Abelian groups. As the second application, we give an exact expression for the correlation of differential-linear approximations over arbitrary finite Abelian groups ( $${\mathbb {F}}_p^n$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msubsup> <mml:mi>F</mml:mi> <mml:mi>p</mml:mi> <mml:mi>n</mml:mi> </mml:msubsup> </mml:math> ) under the sole assumption that the two parts of the cipher are independent of each other. In particular, we completely generalize the differential-linear cryptanalysis from $${\mathbb {F}}_2^n$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msubsup> <mml:mi>F</mml:mi> <mml:mn>2</mml:mn> <mml:mi>n</mml:mi> </mml:msubsup> </mml:math> to arbitrary finite Abelian groups ( $${\mathbb {F}}_p^n$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msubsup> <mml:mi>F</mml:mi> <mml:mi>p</mml:mi> <mml:mi>n</mml:mi> </mml:msubsup> </mml:math> ).
DELTA is a project funded by the Valencian Institute for Business Competitiveness (IVACE) and the European Union through the European Regional Development Fund (FEDER). DELTA project is aimed at bringing companies closer to the use of different disruptive technologies such as Blockchain / Distributed Ledger Technologies (DLT). To achieve its goal, DELTA will provide: A software tool for automating the deployment of DLT networks, regardless of the number of required nodes, or the process of joining an existing network. A modular mechanism that allows the synchronization of DLTs with databases. The goal of this mechanism is to ease and improve the way data is retrieved from a DLT ledger. An accountability tool for shared environments for the exchange of services that brings in some of the most important characteristics of blockchain/DLTs: facilitating auditing and accountability by each participant, use of tokens, etc.
DELTA is a project funded by the Valencian Institute for Business Competitiveness (IVACE) and the European Union through the European Regional Development Fund (FEDER). DELTA project is aimed at bringing companies closer to the use of different disruptive technologies such as Blockchain / Distributed Ledger Technologies (DLT). To achieve its goal, DELTA will provide: A software tool for automating the deployment of DLT networks, regardless of the number of required nodes, or the process of joining an existing network. A modular mechanism that allows the synchronization of DLTs with databases. The goal of this mechanism is to ease and improve the way data is retrieved from a DLT ledger. An accountability tool for shared environments for the exchange of services that brings in some of the most important characteristics of blockchain/DLTs: facilitating auditing and accountability by each participant, use of tokens, etc.
ELTA is a project funded by the Valencian Institute for Business Competitiveness (IVACE) and the European Union through the European Regional Development Fund (FEDER). DELTA project is aimed at bringing companies closer to the use of different disruptive technologies such as Blockchain / Distributed Ledger Technologies (DLT). To achieve its goal, DELTA will provide: A software tool for automating the deployment of DLT networks, regardless of the number of required nodes, or the process of joining an existing network. A modular mechanism that allows the synchronization of DLTs with databases. The goal of this mechanism is to ease and improve the way data is retrieved from a DLT ledger. An accountability tool for shared environments for the exchange of services that brings in some of the most important characteristics of blockchain/DLTs: facilitating auditing and accountability by each participant, use of tokens, etc.
The increasing cases of data breaches, data tampering and information loss have posed an immediate demand to secure file sharing systems that guarantee privacy and verifiable integrity. The paper presents an end-to-end (E2E), encrypted file-sharing system based on the combination of client-side encryption and privately hosted, blockchain-based, notary service. All the encryption is done locally with the aid of the Networking and Cryptographic Library (NaCl) box primitive, and only the approved recipients are allowed access to the shared files with valid credentials. A lightweight local backend stores the encrypted data (ciphertext) and operates with public keys and user metadata; however, it does not access plaintext files and cannot decrypt them, keeping the entire data confidential. In order to offer non-repudiation, a hash of every encrypted file is computed with the Secure Hash Algorithm (SHA-256) and the result is stored in a private Hyperledger Fabric network. This provides an audit trail that can never be changed or tampered with and will not reveal the true files or encryption keys. In our prototype, sending to the blockchain ledger creates latency on an order of seconds 2.3 seconds in a 2.35-second total file-send path and file integrity verification by hash requires an average of 183 milliseconds. The suggested architecture is a good way to ensure confidentiality, proof of authenticity and integrity, and is a convenient way to provide the organization with a requirement to exchange files privately.
Enggar Sukma Kinanthi, Rosa De Lima Dyah Retno Palupi
Ketidakpastian pasar keuangan yang ditandai oleh meningkatnya volatilitas, guncangan global, dan perubahan perilaku investor mendorong perlunya evaluasi kembali peran berbagai aset dalam manajemen portofolio. Penelitian ini bertujuan untuk menganalisis dan mensintesis temuan empiris terkait peran saham, emas, dan Bitcoin dalam menghadapi ketidakpastian pasar keuangan. Analisis dilakukan menggunakan metode kajian literatur melalui perbandingan lintas aset untuk mengevaluasi kesesuaian antara prediksi teori keuangan klasik dengan temuan empiris pasar modern. Hasil kajian menunjukkan bahwa saham secara konsisten diklasifikasikan sebagai aset berisiko dengan volatilitas yang dipengaruhi oleh sentimen dan dinamika pasar, sementara emas relatif mempertahankan perannya sebagai aset lindung nilai meskipun efektivitasnya bersifat kondisional. Bitcoin, yang secara teoritis dipandang sebagai aset spekulatif berisiko tinggi, menunjukkan peran yang lebih kompleks dan kontekstual, berfungsi sebagai instrumen diversifikasi atau lindung nilai dalam kondisi pasar tertentu. Temuan ini menegaskan bahwa fungsi aset dalam portofolio modern tidak bersifat statis, melainkan dinamis dan dipengaruhi oleh ketidakpastian pasar serta perubahan perilaku investor.
The digital art industry faces critical challenges in copyright protection and privacy preservation that existing solutions fail to adequately address. Traditional digital watermarking techniques are vulnerable to removal attacks and cannot prevent unauthorized content access, while current Non-Fungible Token (NFT) platforms expose transaction details and artwork content due to blockchain transparency, creating privacy risks for creators and collectors. Conventional encryption methods require decryption before any data processing, making copyright verification and feature extraction impossible in encrypted states, thus creating a fundamental security-usability trade-off. To overcome these limitations, this research proposes a network security protection system integrating homomorphic encryption with NFT copyright protection. Homomorphic encryption was selected because it uniquely enables computational operations on encrypted data without decryption, allowing copyright verification while maintaining complete data confidentiality – a capability unmatched by alternative privacy-preserving technologies. The system employs the Cheon-Kim-Kim-Song (CKKS) homomorphic encryption algorithm to construct a three-tier protection architecture consisting of an encryption layer, verification layer, and storage layer. This architecture achieves copyright verification and feature extraction of digital artworks in ciphertext state by integrating zero-knowledge proof for identity authentication and Shamir’s secret sharing for secure key management. The NFT copyright protection mechanism introduces homomorphic watermark embedding and smart contract verification, combined with proxy re-encryption to implement secure copyright transfer. A prototype system was developed and evaluated through comprehensive testing. Security performance was assessed using six metrics: privacy protection strength, copyright verification accuracy, anti-tampering capability, key security, transaction anonymity, and system resilience. Each metric was scored on a 0–100 scale based on standardized penetration testing and cryptographic attack simulations, with the comprehensive security score calculated as the weighted average of all metrics. Performance testing on 100 digital artworks across five resolutions (256×256 to 4096×4096 pixels) demonstrates that encryption time for 512×512 resolution images is kept within 15 seconds, while security testing reveals the system achieves a comprehensive security score of 94.7, representing a 60.5% improvement over traditional NFT platforms. This solution provides a practical copyright protection framework balancing security and usability for the digital art industry, with significant theoretical value and broad application prospects.
Open access
Advanced Steganography and Watermarking Techniques
Technical Whitepaper (Genesis v1.0) This paper introduces the CLR Protocol, a Layer-1 distributed ledger designed to solve the state-bloat and inflation problems inherent in current Metaverse architectures. Unlike traditional blockchains that rely on arbitrary hashing for address generation, the CLR Chain utilizes a deterministic, bijective mapping of the 24-bit sRGB Color Spectrum to creating a finite, immutable spatial coordinate system. Key Innovations: Topological Hard Cap: The land supply is strictly bounded by the mathematical limit of the 24-bit integer space (16,777,216 unique volumetric units). O(1) Spatial Indexing: Implementation of a Direct Address Table structure replacing traditional B-Tree spatial queries. Proof-of-Spatial-Activity (PoSA): A hybrid consensus mechanism combining liquidity staking with active spatial verification challenges. Entropy Economics: An algorithmic decay function preventing passive rent-seeking and enforcing monetary velocity. This architecture establishes a "Digital Physics" layer where the visual identity of an asset (its color) acts as its cryptographic address, eliminating the abstraction gap between the user interface and the database logic.
Blockchain clients are fundamental software for running blockchain nodes. They provide users with various RPC (Remote Procedure Call) interfaces to interact with the blockchain. These RPC methods are expected to follow the same specification across different blockchain nodes, providing users with seamless interaction. However, there have been continuous reports on various RPC bugs that can cause unexpected responses or even Denial of Service weakness. Existing studies on blockchain RPC bug detection mainly focus on generating the RPC method calls for testing blockchain clients. However, a wide range of the reported RPC bugs are triggered in various blockchain contexts. To the best of our knowledge, little attention is paid to generating proper contexts that can trigger these context-dependent RPC bugs. In this work, we propose EthCRAFT, a Context-aware RPC Analysis and Fuzzing Tool for client RPC bug detection. EthCRAFT first proposes to explore the state transition program space of blockchain clients and generate various transactions to construct the context. EthCRAFT then designs a context-aware RPC method call generation method to send RPC calls to the blockchain clients. The responses of 5 different client implementations are used as cross-referring oracles to detect the RPC bugs. We evaluate EthCRAFT on real-world RPC bugs collected from the GitHub issues of Ethereum client implementations. Experiment results show that EthCRAFT outperforms existing client RPC detectors by detecting more RPC bugs. Moreover, EthCRAFT has found six new bugs in major Ethereum clients and reported them to the developers. One of the bug fixes has been written into breaking changes in the client's updates. Three of our bug reports have been offered a vulnerability bounty by the Ethereum Foundation.
In primary-backup replication, consensus latency is bounded by the time for backup nodes to replay (re-execute) transactions proposed by the primary. In this work, we present Ira, a framework to accelerate backup replay by transmitting compact \emph{hints} alongside transaction batches. Our key insight is that the primary, having already executed transactions, possesses knowledge of future access patterns which is exactly the information needed for optimal replay. We use Ethereum for our case study and present a concrete protocol, Ira-L, within our framework to improve cache management of Ethereum block execution. The primaries implementing Ira-L provide hints that consist of the working set of keys used in an Ethereum block and one byte of metadata per key indicating the table to read from, and backups use these hints for efficient block replay. We evaluated Ira-L against the state-of-the-art Ethereum client reth over two weeks of Ethereum mainnet activity ($100,800$ blocks containing over $24$ million transactions). Our hints are compact, adding a median of $47$ KB compressed per block ($\sim5\%$ of block payload). We observe that the sequential hint generation and block execution imposes a $28.6\%$ wall-time overhead on the primary, though the direct cost from hints is $10.9\%$ of execution time; all of which can be pipelined and parallelized in production deployments. On the backup side, we observe that Ira-L achieves a median per-block speedup of $25\times$ over baseline reth. With $16$ prefetch threads, aggregate replay time drops from $6.5$ hours to $16$ minutes ($23.6\times$ wall-time speedup).
The Cyber-Physical Systems (CPS) experience great operational complexity in the stochastic and non-stationary contexts when the control logic can be considered static. The current paper introduces an autonomous agent-based intelligence framework, which can be used in perpetually adaptive and decentralized organization of heterogeneous CPS systems. The given framework implements a multi-agent system (MAS) to bridge the gap between the cyber and physical layers with the help of built-in perception-action loops and planning modules. With the help of online reinforcement learning (RL) and predictive analytics, individual agents change control policies in real-time to alleviate disturbances in a system and changing operational constraints. A shared knowledge layer that is distributed is put in place to coordinate inter-agent coordination and policy refinement making the system-wide scalable and fault-tolerant. Experimental validation in a wide range of CPS situations proves that the suggested autonomous structure can be much more efficient and self-optimizing than centralized baseline frameworks, providing a stable channel of self-evolutionary industrial and robotic systems.
Emergence of blockchain technology has disrupted a number of economic sectors, particularly financial institutions, with significant effects on their operations. This paper investigates the impact of asset tokenization on the issuance and trading process of financial assets, specifically bonds. It examines the effect of tokenizing the High Yield Bond on the Ethereum blockchain across two key dimensions: On costs, a comparative cost-benefit analysis is conducted before and after tokenization, and on green sustainability, through a comparative analysis on the carbon footprint of the bond before and after Ethereum's merge to proof of stake. The results show that Tokenization improves cost-savings, and it promotes a greener, more sustainable approach when using the Ethereum blockchain post-transition to proof of stake.
We propose Proof of Witness (PoWit), a novel consensus mechanism for digital currency that replaces energy-intensive mining and capital-based staking with independent third-party witness verification. In PoWit, each transaction requires cryptographic signatures from three parties: sender, receiver, and a randomly selected witness. The witness validates the sender’s balance and transaction history before signing, eliminating the need for global consensus while maintaining security guarantees. Our simulation with 10,000 users demonstrates 100% double-spending prevention (n = 10, 000, 99% CI [99.93%, 100%]), 113.9 transactions per second, and complete chain integrity. The non-selective witness assignment achieves theoretical randomness with only 0.27% deviation, making collusion attacks impractical. PoWit offers a sustainable alternative to Proof of Work and Proof of Stake, with significantly lower energy consumption and fairer participation model.