Abstract
In this paper, we have achieved privacy protection and high transparency in a permissioned blockchain. There is a sidechain that connects the permissionless blockchain and the permissioned blockchain. The behavior in the permissioned blockchain is almost a black box from the perspective of the permissionless blockchain. While this fact is useful for privacy protection, there is room for improvement in terms of transparency. To improve the transparency of the permissioned blockchain under privacy protection, we consider traceability in the permissioned blockchain consisting of the following three properties: trade privacy (who trades with whom and at what asset amount), preservation (the total amount inside the permissioned blockchain, including deposits and withdrawals to the permissionless blockchain, is immutable), and noninvolvement (some members in the permissioned blockchain are not involved in some trades, and it is possible to prove that specified members performed the transaction). To the best of our knowledge, we are the first to achieve both preservation and noninvolvement while protecting the privacy of transactions. Our approach is as follows. We model traceability based on the hidden Markov model. Because the proof of traceability requires the calculation of more than quadratic degrees, we encrypt this model by homomorphic encryption. The number of participants in the permissioned blockchain corresponds to the number of additions in the model. Then, we can construct the encrypted model by employing somewhat homomorphic encryption. The establishment of the original model is verifiable by applying the noninteractive zero-knowledge proof of the knowledge that the plaintext is equal to zero. This is an adaptation of Benhamouda et al. (Asiacrypt 2014).
Highlights
Bitcoin [2] has spread over the past decade, and many cryptocurrencies continue to be born
By combining fully homomorphic encryption and the zero-knowledge proof, we prove the establishment of the encrypted model by the zero-knowledge proof of knowledge in which plaintext is zero
Letting a prover be the permissioned blockchain and a verifier be the permissionless blockchain, we prove with zeroknowledge that each encrypted function corresponds to a plaintext m = 0
Summary
Bitcoin [2] has spread over the past decade, and many cryptocurrencies continue to be born. Regarding the transparency of the transaction history, the concept of traceability is common in the field of supply chain management In this way, using blockchain in corporate activities, it is crucial to balance trade privacy and transparency. A. OUR RESULT This work provides the basic technology to achieve meaningful traceability in the blockchain that balances the privacy and transparency of transactions in corporate activities. We realize the trade privacy by encrypting this model with fully homomorphic encryption and transparency by proving the equations of the encrypted model with the zero-knowledge proof of plaintext knowledge.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
