RZcoin: Ethereum-Based Decentralized Payment with Optional Privacy Service

Round 1

Reviewer 1 Report

• The author's work heavily depends on Schnorr algorithm. I would like authors to clearly state what is their originality other than simple application of Schnorr algorithm instead of ECDSA.
• They did not provide proofs for Theorems 1 and 2.
• Many definitions and many equations are provided, but they should clarify what part of them belongs to them.
• It would be more helpful for readers to follow the defintions and theorems if they provide simple examples.

Author Response

Please see the attachment.

Author Response File: Author Response.docx

Reviewer 2 Report

Some key notions are not defined correctly and not clear, and therefore there is a problem to estimate the originality and novelty of the paper.

The paper is not well structured and a lot of notions are not introduced:

In line 191: Z_q^* should be exactly defined.

In line 221: what is commitment vector?

In line223: what is <L(x),R(x)>?

In line 225: are there any relation between Z_q and F_p?

In line 235: equation (??).

In line 284: Hash₁ and Hash₂ must be exactly defined. Wihout that b₁~/b₂~ seems as nonsense but it is partially explained in line 289.

In line 298: is mentioned that Hash₁ and Hash₂ are construct on SHA-256 so this should be described at first by exactly definition of Hash₁ and Hash₂.

 

Common comments.

1.CE must be described.

2.Some of presented diagrams are trivial.

3.Presented key disclosure attacks are naive in the context of the paper.

4.The notion of bulletproof must be introduced and clearly defined.

5.The method of CE referenced in internal source [14] must be presented.

6.The confusion of programming language and math operations take place, e.g. formula (40) is incorrect.

 

 

Author Response

Please see the attachment.

Author Response File: Author Response.docx

Round 2

Reviewer 2 Report

The response to my comments is adequate and therefore I recommend to publish this paper.