# Sin7Y Tech Review(29): Design Principles of Private  Transactions in Aleo & Zcash ![](https://i.imgur.com/yR60yM6.png) References Zcash - [Zcash protocol specification](https://zips.z.cash/protocol/protocol.pdf) Aleo - [Zexe protocol specification](https://eprint.iacr.org/2018/962.pdf) ## Zcash ### 1. About Zcash ? A [short video](https://zcash.readthedocs.io/en/latest/rtd_pages/basics.html) to learn about Zcash. Features: - Anonymous version of BTC, UTXO-like model - Can only be used for payment scenarios with no programmability ### 2. Main Concepts Note: Zcash has undergone several [protocol upgrades](https://z.cash/upgrade/) and we only focus on the latest version. This article mainly introduces the core concepts of Zcash. #### 2.1 Key components ![](https://i.imgur.com/Fv43wjh.png) <center>Image source (Zcash protocol specification: section 3.1, page 12)</center> <br/><br/> - sk : spend key, generated uniformly - ask: spend authorizing key - ak : spend validating key - nk : nullifier deriving key - rivk : randomness - dk: diversifier key - ivk : private key / incoming viewing key - ovk : outgoing viewing key - pkd : transmission key - Spending key: secret key - Full viewing key: decrypt the transaction context - Incoming viewing key - Outgoing viewing key - Shielded payment address: should be different each time You can [learn about the computation methods of thesekeys in the Zcash protocol specification: section 4.2.3, page 36.](https://zips.z.cash/protocol/protocol.pdf) #### 2.2 Notes Note is the basic unit of the Zcash protocol, similar to the UTXO of BTC; in Zcash, the inputs and outputs of all transactions are notes. Of course, Zcash also supports non-anonymous transactions, identical to Bitcoin's transaction model. Therefore, in order to further understand Zcash, you must know the data structure of note first: ![](https://i.imgur.com/enwjVJw.png) <center>Image Source (Zcash protocol specification: section 3.2, page 14))</center> <br/><br/> - $\{d, pk_d\}$: address information of the owner of the note - v : the corresponding amount of the note - $\{\rho, \psi \}$: compute the random number of the nullifier - rcm : being used to compute the random number of the note commitment In the Zcash protocol, the note cannot be made public due to the requirement of privacy. Therefore, the corresponding commitment needs to be computed to represent the note. The computation method is as follows: ![](https://i.imgur.com/AzAc4b2.png) <center>Image source (Zcash protocol specification: section 3.2, page 15)</center> #### 2.3 Action transfer A transaction may contain multiple action transfers, and each action transfer will spend the old note and generate a new note. The data structure is as follows: ![](https://i.imgur.com/1RABNuW.png) <center>Image source (Zcash protocol specification: section 4.6, page 41)</center> <br/><br/> - $cv^{net}$: being used for the balance check for action transfer in the form of binding signature without being included in the zk proof - $rt^{Orchard}$: the treestate of the previous block, which is used to verify the spent note validity - $nf$: the logo of the spent note, which is used to prevent the double spend - $rk$: being used to verify that the spender has the right to the spend the note in the form of spendAuthSig signature verification - $cm_x$: commitment of generating a new note - $epk$ temporary public key, which is used to decrypt the noteplaint information of the new note - $C^{enc}, C^{out}$: the encrypted ciphertext of the new note - $enbaleSpends, enableOutputs$: indicating the type of the current action transfer - $\pi$: zk proof #### 2.4 Action statement The public inputs are: $$\{rt^{Orchard}, cv^{net}, nf^{old}, rk, cm_x, enbaleSpends, enableOutputs\}$$ The privacy inputs are: $$\{path, pos,g_d^{old}, pk_d^{old}, v^{old},\rho^{old}, \phi^{old}, rcm^{old}, cm^{old} \\ \alpha, ak^P, nk, rivk,\\ g_d^{new}, pk_d^{new}, v^{new},\phi^{new},rcm^{new},rcv\}$$ The statements to prove: ![](https://i.imgur.com/xxeXM55.png) <center>Image source (Zcash protocol specification: section 4.17.1, page 40)</center> <br/><br/> - Spent note integrity is uniquely bound to the noteplaint - Spent note validity, existence proof of the cm tree - Value commitment integrity is uniquely bound to rcv , old value, and new value - Nullifier integrity prevents double spend and maintains a spent note set - Spent note legitimacy - Address integrity - New note integrity - Flag legitimacy #### 2.5 Transaction constructions and examples ##### 2.5.1 Transaction construction ![](https://i.imgur.com/AROnMYV.png) <center>Image source (Zcash protocol specification: section 7.1, page 119)</center> <br/><br/> The entire transaction structure consists of four parts: - Public info (1 - 5) - Transparent transactions info (6 - 9) - Sapling transactions info (10 - 16) - Orchard transaction info (17 - 25) ##### 2.5.2 From transparent to shield The Orchard protocol includes two types of addresses, transparent address (TA) and shield address (SA). Generally, in order to execute a private transaction, it is necessary to transfer from TA to SA first. The corresponding transaction structure should be: - Public info (1 - 5) - Transparent transactions info (6 - 9) - tx_in _* : actual value - tx_out _* : default value - Sapling transactions info (10 - 16) - All : default value - Orchard transaction info (17 - 25) - All: actual value ##### 2.5.3 From shield to shield The Orchard protocol includes two types of addresses, transparent address (TA) and shield address (SA). Generally, in order to execute a private transaction, it is necessary to transfer from TA to SA first. The corresponding transaction structure should be: - Public info (1 - 5) - Transparent transactions info (6 - 9) - All : default value - Sapling transactions info (10 - 16) - All : default value - Orchard transaction info (17 - 25) - All: actual value ##### 2.5.4 From shield to transparent The Orchard protocol includes two types of addresses, transparent address (TA) and shield address (SA). Generally, in order to execute a private transaction, it is necessary to transfer from TA to SA first. The corresponding transaction structure should be: - Public info (1 - 5) - Transparent transactions info (6 - 9) - tx_in _* : default value - tx_out _* : actual value - Sapling transactions info (10 - 16) - All : default value - Orchard transaction info (17 - 25) - All: actual value #### 2.6 How is privacy achieved? - **Unlinkable** The generated note is represented by cm, and the spent note is represented by nf. There is no connection between nf and cm. Therefore, no one can know in which transaction any generated note was spent. - **Private** - **Sender address:** The transaction information does not contain the sender address and the spendAuthSig is a one-time signature (it is different every time, so the public key is different, rk) - **Receiver address:** The transaction does not contain the receiver's address and the new note plaint is encrypted by the receiver's public key (the receiver's private address is also one-time) - **Value:** Hide the note in the form of pedersen commitment, and ensure the balance attribute of the transaction by bindsig ## Aleo ### 1. The similarities and differences with Zcash Zcash can only execute private transactions based on the OUTX model and have no programmability; therefore, the main difference between Aleo and Zcash is privacy programmability; and the similarity is that they both support privacy attributes (transaction privacy is not only limited to assets). ### 2. Aleo vs Zcash #### 2.1 Unit Unlike the note of Zcash, the basic operation unit of Aleo is record (UTXO in BTC). Find the main differences between the two below: ![](https://i.imgur.com/zvattO5.png) <center>Image source (Zcash protocol specification: section 3.2, page 14))</center> <br/><br/> ![](https://i.imgur.com/PQgRd21.png) <center>Image source (Zexe protocol specification: section 3.1, page 17)</center> <br/><br/> Although the names of the specific parameters are different, there is a corresponding relationship between the two from the functional point of view: corresponding to the address information of the note owner, commitment-related information, nf/sn-related information, and value-related information, respectively. Therefore, the structures of the two are quite similar; the main differences exist in the birth predicate and death predicate of the record, which are two Boolean-type functions, representing the conditions that need to be met when a record is in the birth(generate) and death(spend) stages. This part supports user-defined, so it’s programmable. #### 2.2 Transaction construction ![](https://i.imgur.com/pNxCLQT.png) <center>Image source (Zexe protocol specification: section 3.1, page 17)</center> <br/><br/> There are still some resemblances compared with the main construction of the transaction of Zcash (2.5.1): - The corresponding serial number sn of the spent record, which is represented by nf in Zcash, is unique - The commitment of the new record - The plaint of the new record, including owner information, corresponding birth/death predicate, etc #### 2.3 Prover statement ![](https://i.imgur.com/QOs4cBd.png) ![](https://i.imgur.com/pNxCLQT.png) <center>Image source (Zexe protocol specification: section 2.4, page 13)</center> <br/><br/> You need to prove: - The old record validity - The old record legitimacy (have the right to spend the record) - The new record validity - **The birth/death predicate validity (similar to the balance check in Zcash)** ### 3. More #### 3.1 Technologies not mentioned From the perspective of the paper, the privacy design of Aleo 's programmable privacy design is more similar to the earlier Zcash white paper ([zerocash](https://eprint.iacr.org/2014/349.pdf)), the similar key structure, the similar note structure and the similar name (nf is called sn in zerocash, serial number). This article makes a comparison based on the latest paper of Zcash and the ZEXE of Aleo. Although there are differences in specific details, such as the key structure and the specific cryptographic methods used, the high-level design is generally the same. In addition to the technical details described above, there are still some other technical details that have not been mentioned yet, such as the delegate prover scheme, zero-knowledge proof algorithm, recursion/aggregation scheme, and so on. People interested in them can study further. #### 3.2 Why are they all UTXO -based, not account-based? Remark 2.3 (Zexe protocol specification: section 2.3, page 11)