File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-319-89500-0_23
- Scopus: eid_2-s2.0-85045977197
- WOS: WOS:000460414100023
- Find via
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: Practical range proof for cryptocurrency monero with provable security
Title | Practical range proof for cryptocurrency monero with provable security |
---|---|
Authors | |
Issue Date | 2018 |
Citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018, v. 10631 LNCS, p. 255-262 How to Cite? |
Abstract | © Springer International Publishing AG, part of Springer Nature 2018. With a market cap of about 1.5 billion US dollar, Monero is one of the most popular crypto-currencies at present. Much of its growing popularity can be attributed to its unique privacy feature. Observing that no formal security analysis is presented, we initiate a formal study on Monero’s core protocol. In this study, we revisit the design rationale of an important component of Monero, namely, range proof. Our analysis shows that the range proof may not be a proof-of-knowledge even if the underlying building block, ring signature, is secure. Specifically, we show that if a certain secure ring signature scheme is used, it is impossible to construct a witness extractor unless the Computational Diffie-Hellman problem is equivalent to the Discrete Logarithm problem. This shows that the design rationale is to possibly flawed. Then, we present a new range proof protocol that enjoys a few advantages. Firstly, it is a zero-knowledge proof-of-knowledge protocol. Secondly, it is compatible with the Monero’s wallet and algebraic structure and thus does not require extensive modification in the codebase. Finally, the efficiency is comparable to Monero’s version which does not admit a formal security proof. |
Persistent Identifier | http://hdl.handle.net/10722/280658 |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Li, Kang | - |
dc.contributor.author | Yang, Rupeng | - |
dc.contributor.author | Au, Man Ho | - |
dc.contributor.author | Xu, Qiuliang | - |
dc.date.accessioned | 2020-02-17T14:34:36Z | - |
dc.date.available | 2020-02-17T14:34:36Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018, v. 10631 LNCS, p. 255-262 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10722/280658 | - |
dc.description.abstract | © Springer International Publishing AG, part of Springer Nature 2018. With a market cap of about 1.5 billion US dollar, Monero is one of the most popular crypto-currencies at present. Much of its growing popularity can be attributed to its unique privacy feature. Observing that no formal security analysis is presented, we initiate a formal study on Monero’s core protocol. In this study, we revisit the design rationale of an important component of Monero, namely, range proof. Our analysis shows that the range proof may not be a proof-of-knowledge even if the underlying building block, ring signature, is secure. Specifically, we show that if a certain secure ring signature scheme is used, it is impossible to construct a witness extractor unless the Computational Diffie-Hellman problem is equivalent to the Discrete Logarithm problem. This shows that the design rationale is to possibly flawed. Then, we present a new range proof protocol that enjoys a few advantages. Firstly, it is a zero-knowledge proof-of-knowledge protocol. Secondly, it is compatible with the Monero’s wallet and algebraic structure and thus does not require extensive modification in the codebase. Finally, the efficiency is comparable to Monero’s version which does not admit a formal security proof. | - |
dc.language | eng | - |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.title | Practical range proof for cryptocurrency monero with provable security | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/978-3-319-89500-0_23 | - |
dc.identifier.scopus | eid_2-s2.0-85045977197 | - |
dc.identifier.volume | 10631 LNCS | - |
dc.identifier.spage | 255 | - |
dc.identifier.epage | 262 | - |
dc.identifier.eissn | 1611-3349 | - |
dc.identifier.isi | WOS:000460414100023 | - |
dc.identifier.issnl | 0302-9743 | - |