In this work,we propose a stateless blockchain called CompactChain,which compacts the entire state of the UTXO(Unspent Transaction Output)based blockchain systems into two RSA accumulators.The first accumulator is cal...In this work,we propose a stateless blockchain called CompactChain,which compacts the entire state of the UTXO(Unspent Transaction Output)based blockchain systems into two RSA accumulators.The first accumulator is called Transaction Output(TXO)commitment which represents the TXO set.The second one is called Spent Transaction Output(STXO)commitment which represents the STXO set.In this work,we discuss three algorithms:(i)To update the TXO and STXO commitments by the miner.The miner also provides the proofs for the correctness of the updated commitments;(ii)To prove the transaction’s validity by providing a membership witness in TXO commitment and non-membership witness against STXO commitment for a coin being spent by a user;(iii)To update the witness for the coin that is not yet spent;The experimental results evaluate the performance of the CompactChain in terms of time taken by a miner to update the commitments and time taken by a validator to verify the commitments and validate the transactions.We compare the performance of CompactChain with the existing state-of-the-art works on stateless blockchains.CompactChain shows a reduction in commitments update complexity and transaction witness size which inturn reduces the mempool size and propagation latency without compromising the system throughput(Transactions per second(TPS)).展开更多
Zero knowledge sets is a new cryptographic primitive introduced by Micali, Rabin, and Kilian in FOCS 2003. It has been intensively studied recently. However all the existing ZKS schemes follow the basic structure by M...Zero knowledge sets is a new cryptographic primitive introduced by Micali, Rabin, and Kilian in FOCS 2003. It has been intensively studied recently. However all the existing ZKS schemes follow the basic structure by Micali et al. That is, the schemes employ the Merkle tree as a basic structure and mercurial commitments as the commitment units to nodes of the tree. The proof for any query consists of an authentication chain. We propose in this paper a new algebraic scheme that is completely different from all the existing schemes. Our new scheme is computationally secure under the standard strong RSA assumption. Neither mercurial commitments nor tree structure is used in the new construction. In fact, the prover in our construction commits the desired set without any trapdoor information, which is another key important difference from the previous approaches.展开更多
文摘In this work,we propose a stateless blockchain called CompactChain,which compacts the entire state of the UTXO(Unspent Transaction Output)based blockchain systems into two RSA accumulators.The first accumulator is called Transaction Output(TXO)commitment which represents the TXO set.The second one is called Spent Transaction Output(STXO)commitment which represents the STXO set.In this work,we discuss three algorithms:(i)To update the TXO and STXO commitments by the miner.The miner also provides the proofs for the correctness of the updated commitments;(ii)To prove the transaction’s validity by providing a membership witness in TXO commitment and non-membership witness against STXO commitment for a coin being spent by a user;(iii)To update the witness for the coin that is not yet spent;The experimental results evaluate the performance of the CompactChain in terms of time taken by a miner to update the commitments and time taken by a validator to verify the commitments and validate the transactions.We compare the performance of CompactChain with the existing state-of-the-art works on stateless blockchains.CompactChain shows a reduction in commitments update complexity and transaction witness size which inturn reduces the mempool size and propagation latency without compromising the system throughput(Transactions per second(TPS)).
基金This work is supported by NSF of USA under Grant Nos.IIS-0430274, and CCR-0325951, and sponsors of CERIASRui Xue is partially supported by the Fund of the China Scholarship Council, partially by National Natural Science Foundation of China under Grant No.60773029+1 种基金National Grand Fundamental Research 973 Program of China under Grant No.2007CB311202the National High Technology Research and Development 863 Program of China under Grant No.2006AA01Z427.
文摘Zero knowledge sets is a new cryptographic primitive introduced by Micali, Rabin, and Kilian in FOCS 2003. It has been intensively studied recently. However all the existing ZKS schemes follow the basic structure by Micali et al. That is, the schemes employ the Merkle tree as a basic structure and mercurial commitments as the commitment units to nodes of the tree. The proof for any query consists of an authentication chain. We propose in this paper a new algebraic scheme that is completely different from all the existing schemes. Our new scheme is computationally secure under the standard strong RSA assumption. Neither mercurial commitments nor tree structure is used in the new construction. In fact, the prover in our construction commits the desired set without any trapdoor information, which is another key important difference from the previous approaches.
