MoneroResearch.info |
Resource type: Book Chapter DOI: 10.1007/978-3-030-95161-0_1 ID no. (ISBN etc.): 978-3-030-95161-0 BibTeX citation key: Kovalchuk2022 View all bibliographic details |
Categories: Monero-focused Creators: Bespalov, Kovalchuk, Kuznetsov, Lemeshko, Oliynykov, Radivilova, Rodinko Publisher: Springer International Publishing (Cham) Collection: Information Security Technologies in the Decentralized Distributed Networks |
Views: 56/3325
|
Attachments | URLs https://doi.org/10 ... 78-3-030-95161-0_1 |
Abstract |
The section discusses all currently available methods and mechanisms used in cryptocurrency blockchains to ensure user privacy. Each of these methods and mechanisms is described in detail, their comparative analysis is performed. It has been determined which of them are most suitable for maintaining the confidentiality of certain private personal information. The methods and cryptographic primitives used in blockchain technologies of such largest market capitalizations and ``most private'' digital currencies as Monero, Dash and Zcash are analyzed. In addition, these cryptocurrencies are the object of close attention and ban by many intelligence agencies and financial institutions around the world. This attention also indicates the level of their anonymity. However, only the Monero cryptocurrency is anonymous, of course, and the Dash and Zcash cryptocurrencies only allow the choice of the anonymity option at the user's request. The results of the analysis show how the information obtained can be used to create a network that will operate on a blockchain basis and store, process and transmit confidential information, such as personal data, while ensuring its privacy. It is concluded that to ensure a given level of privacy in the processing, storage, transmission and receipt of confidential personal information, it is possible to use only the appropriate mathematical apparatus, such as ring signatures (such as Monero) or SNARKs, such as Zcash. The example of the most common protocol Groth16 shows how the information is structured before constructing the SNARK-proof, how the preliminary calculations are performed (the so-called ceremony, or Setup), how the proof itself is built and how its correctness is verified. It also shows how to build recursive SNARK-proofs and why and in what situations they are necessary.
Added by: Rucknium |