Infrastructure assets often generate stable, policy-backed cash flows, yet existing investment instruments bundle asset exposure with corporate balance-sheet and governance risks. Existing RWA tokenization does not change this; it still treats an asset as a contractbased claim rather than as the asset itself. We argue that reducing property rights (rights tied to the asset) to rights tied to a contract is a fundamental limitation, and one that a smart contract alone cannot overcome. What is needed is an object-centric model in which each asset unit carries its own identity and rights natively. We propose a dual-layer architecture that separates legal asset anchoring from investor-facing cash-flow participation. The first layer anchors the asset identity and legal linkage. The second layer issues participation units with a mutable yield-beneficiary pointer, allowing custody and cash-flow entitlement to be held independently. The architecture targets policy-backed infrastructure assets, such as renewable energy under feed-in tariffs, where generation, validation, and settlement are already institutionally established. A token-bound dividend routing algorithm distributes revenues at the individual token level via parallel batched transactions. Cost projections show that micro-distributions across one million tokens can be executed at negligible marginal cost under parallel execution, compared to prohibitive gas expenses in sequential EVM-based models. The contribution is a blockchain-native design space and representation model that gives investors exposure to asset-level yields, not to the risks of a corporate wrapper.

Digital signatures confirm message integrity and signer identity, but linking public keys to identities can cause privacy concerns in anonymized settings. Signatures with randomizable keys can break this link, preserving verifiability without revealing the signer. While effective for privacy, complex cryptographic systems need to be modular structured for efficient implementation. Threshold structure-preserving signatures enable modular, privacy-friendly protocols. This work combines randomizable keys with threshold structure-preserving signatures to create a valid, modular, and unlinkable foundation for privacy-preserving applications.

Verifiable Timed Signatures (VTS) are cryptographic primitives that enable the creation of a signature that can only be retrieved after a specific time delay, while also providing verifiable evidence of its existence. This framework is particularly useful in blockchain applications. Current VTS schemes rely on signature algorithms such as BLS, Schnorr, and ECDSA, which are vulnerable to quantum attacks due to the vulnerability of the discrete logarithm problem to Shor’s Algorithm. We introduce VT-UOV, a novel VTS scheme based on the Salt-Unbalanced Oil and Vinegar (Salt-UOV) Digital Signature Algorithm. As a multivariate polynomialbased cryptographic primitive, Salt-UOV provides strong security against both classical and quantum adversaries.

Verifiable Timed Signatures (VTS) are crypto-graphic constructs that enable obtaining a signature at a specific time in the future and provide evidence that the signature is legitimate. This framework particularly finds utility in applications such as payment channel networks, multiparty signing operations, or multiparty computation, especially within blockchain architectures. Currently, VTS schemes are based on signature algorithms such as BLS signature, Schnorr signature, and ECDSA. These signature algorithms are considered insecure against quantum attacks due to the effect of Shor's Algorithm on the discrete logarithm problem. We present a new VTS scheme called VT-Dilithium based on CRYSTALS-Dilithium Digital Signature Algorithm that has been selected as NIST's quantum-resistant digital signature standard and is considered secure against both classical and quantum attacks. Integrating Dilithium into the VTS scheme is a more challenging problem due to its complex mathematical operations (i.e. polynomial multiplications, rounding operations) and large module param-eters such as polynomials, polynomial vectors, and matrices. This work aims to provide a comprehensive exposition of VT-Dilithium scheme.

National Institute of Standards and Technology (NIST) initiated a post-quantum standardization process in 2016, and as of July 2020, Round 3 candidates were announced. Among these candidates, Crystals-Kyber and Crystals-Dilithium are the most promising lattice-based key encapsulation mechanism (KEM) and signature algorithm that rely on the module learning with errors (Module-LWE) problem. In general, polynomial multiplication is one of the most time-consuming operations in Module-LWE based cryptosystems. There are several polynomial multiplication methods for multiplying two polynomials effectively. One of the most efficient methods is Number Theoretic Transform (NTT). This paper analyzes the number of arithmetic operations occupied in NTT multiplication for Kyber and Dilithium cryptosystems. The general formula on the number of multiplications and additions used in NTT operation for the lattice-based algorithms which have a ring structure similar to Kyber and Dilithium is given for$q < 2^{w-1}$where$w$is the word size and$q$is the modulus. Also, cycle counts of arithmetic operations of Kyber and Dilithium are calculated on reference implementations to determine the relationship between our formulations and cycle counts.