arXiv subjects

Zhuan Cheng

Publications and source records attributed to Zhuan Cheng.

3 recordsLinked to original sources

arXiv2024

Zero-Knowledge Proof in NuLink

NuLink provides privacy-preserving technology for decentralized applications via APIs. Users can securely store its valuable data, trade with others and so on. To ensure the privacy and security of service provided by NuLink, (zero-knowledge) proof systems are necessary. Zero-knowledge proof systems allow the prover to make the verifier believe that a certain conclusion is correct without providing any useful information to the verifier. In NuLink, we are going to use (zero-knowledge) proof system in the following three methods: 1. Users store their data through NuLink in a decentralized manner. To ensure that the storage clients are indeed storing the data, we employ proof of storage systems. In this system, users prepare certain challenges that can only be correctly answered by those who are actually storing the data. 2. Users have the option to outsource computations to NuLink. To verify the correctness of the computation results provided by the compute node, we require the node to provide a proof of correctness via SNARK systems. When sensitive parameters are used as inputs for computation, we utilize zk-SNARKs to prevent any potential leakage of these parameters. 3. Users may choose to trade their data through NuLink. To confirm that the buyer has sufficient digital funds and the seller possesses the desired data, both parties can provide a proof via zk-SNARKs. This builds confidence and prevents cheating during transactions. Using zero-knowledge proof systems, we can ensure that all nodes in NuLink behaves honestly and avoid cheating in the whole system.

cs.CR↗

arXiv2018

A New Hybrid Consensus Protocol: Deterministic Proof Of Work

The Decentralized-Consistent-Scale (DCS) Triangle defines three dimensions that illustrate the tradeoffs of the blockchain consensus mechanism. In this paper, we propose a new hybrid consensus protocol, called Deterministic Proof of Work (DPoW), which can reach high levels of scalability and consistency without significant reduction to decentralization. Our protocol introduces a Map-reduce PoW mining algorithm to perform alongside Practical Byzantine Fault Tolerance (PBFT) verification, which together allow for transactions to be confirmed immediately, largely improving scalability. In addition, the protocol is designed such that forking cannot occur, ensuring strong consistency and security against a multitude of attacks. The Map-reduce PoW mining process ensures that no single entity can control the network, guaranteeing decentralization. We analyzed the security of our protocol by evaluating the possibility of double spending attacks, and furthermore, conducted experiments which demonstrate our claims.

cs.CR↗

arXiv2018

Data assimilation and parameter estimation for a multiscale stochastic system with alpha-stable Levy noise

This work is about low dimensional reduction for a slow-fast data assimilation system with non-Gaussian $α-$stable Lévy noise via stochastic averaging. When the observations are only available for slow components, we show that the averaged, low dimensional filter approximates the original filter, by examining the corresponding Zakai stochastic partial differential equations. Furthermore, we demonstrate that the low dimensional slow system approximates the slow dynamics of the original system, by examining parameter estimation and most probable paths.

math.DS↗