# How should the Zcash ecosystem move towards generic zkAssets (UDAs/ZSAs)? **Date & Time:** August, Tuesday 3rd @2:30pm UTC / 5:30pm Israel Time / 10:30am EST / 7:30am Pacific time **Link to the Space:** https://twitter.com/i/spaces/1BRJjBZQvNWJw **Confirmed Participants**: - _Technical part:_ [Daira](https://twitter.com/feministPLT), [Pratyush](https://twitter.com/zkproofs), [Chelsea](https://twitter.com/chelseakomlo), [Eran](https://twitter.com/EranTromer), [Zac](https://twitter.com/Zac_Aztec) and [Ian](https://twitter.com/secparam) - _Economics part:_ [Zooko](), [Jon](https://twitter.com/jonrouach), [Michelle](https://twitter.com/88crypt), [Hudson](https://twitter.com/hudsonjameson), [Jack](https://twitter.com/JackGavigan) and **Moderators:** Mary (as [@ZKProof](https://twitter.com/zkproof)) and [Daniel](https://twitter.com/BenarrochDaniel) **What:** Given the on-going conversations taking place since [Zcon2 Lite](https://www.youtube.com/playlist?list=PL40dyJ0UYTLLa68H9ibpiSZqeevqKizg4), Mary Maller and Daniel Benarroch decided to host a discussion on the topic of [Zcash Shielded Assets](https://electriccoin.co/blog/ecc-exploring-zcash-shielded-assets/_) or [User Defined Assets](https://www.zfnd.org/blog/zero-knowledge-all-the-things/) on the Zcash ecosystem in order to enable the community at large to understand the different perspectives of the discussion. This will mostly be informal and will take place on a twitter space as a live audio conversation. The [space will take place on August, Tuesday 3rd at 14:30 UTC](https://twitter.com/i/spaces/1mrGmwaaelNxy). ## Proposed Agenda The conversation will be divided into two different parts: **Technical & Applications @2:30pm UTC:** Part 1 will cover the technical and applications aspects of adding UDAs to the Zcash ecosystem - What are UDAs and what are the extent of their applications? - What are the main technical challenges in adopting UDAs in Zcash? - How could UDAs be implemented in Zcash Orchard Protocol? - [Write up of a proposed circuit design](https://github.com/zcash/zcash/issues/830#issuecomment-891855536). - What applications could be built with the UDAs feature (e.g.: stable coins) - Specifically, could it be used for a Central Bank Digital Currency (CBDC) where some auditability properties may be needed? **Economical & Usability @3:30pm UTC:** Part 2 will cover the economical and usability aspects of adding UDAs to the Zcash ecosystem - What are the economic (dis)advantages for allowing UDAs on Zcash? How can they be overcome? - What are the current economic incentives in Zcash and how would this change after adding UDAs functionality? - What are important design and usability considerations (UX, product, incentives) needed to increase adoption with - How can we ensure as a community that UDAs will have a positive impact on the zcash ecosystem and in general? - Specifically, Each part will have a Q&A of questions tweeted about the event. Feel free to start sharing them now :)
Last changed by  
 
danib31
1403

Read more

ZKProof 5 Call for Submissions

General Information ZKProof5 (2022), the 5th workshop of the zero-knowledge proof standardization effort, will take place, as an in-person event. Hybrid remote participation will be possible in most sessions, but we encourage physical presence to enable effective discussions and in-situ collaborations. Where: Tel Aviv Stock Exchange, Tel Aviv, Israel When: November 15--17, 2022 Submission due: Friday, October 14th Submission mail: zkproof5-submissions@zkproof.org Acceptance notification: Tuesday, October 25th Venue address: Ahuzat Bayit St 2, Tel Aviv-Yafo, 6525216, Israel

9/12/2022
Packing HE ciphertexts for coordinate-wise multiplication

Let $X$ be an integer, and $(x_n,...,x_0)$ binary decomposition Goal: define packing technique so that we can assume that the scheme works over messages that are vectors in $F^n_p$ despite the HE message space are polynomials in $R=F_p[X]/(X^n + 1)$. To this end we want define a bijection $(encode, decode)$ where $encode: F_p^n \to R=F_p[X]/(X^n + 1))$ s.t. $\forall v_1, v_2 \in F^n_p: v_1\cdot v_2 = decode(encode(v_1) * encode(v_2))$ Let $z$ be an integer, $n = 2^z$, $m = 2 · n$, and $p$ be a prime such that $p = 1 \mod m$. In this case, $(X^n + 1)$ splits over $F_p$, i.e., $(X^n +1) = \prod_i F_i(X)$, where each $F_i$ is a linear polynomial.

3/24/2021
zkInterface: SIEVE Intermediate Representation (IR) Proposal

![](https://i.imgur.com/4rVEsHh.png =200x) Introduction As part of the SIEVE program, TA1 and TA2 performers are required to interoperate by generating or consuming the same intermediate representation (IR) of zero-knowledge statements. This document contains a brief description of the zkInterface interoperability tool, and focuses on outlining the relevant and important features. zkInterface is the first such proposal, allowing TA1 performers to use the most suitable and convenient TA2 proving system, and viceversa, without having to implement every possible connection. Furthermore, zkInterface can facilitate the process of testing and evaluation (T&E) for the deliverables of different performers. zkInterface was created as part of the ZKProof Standardization effort, where it quickly got traction becoming the standard tool for interoperability between frontends and backends. Resources

7/14/2020
Intro to Lattice-based Cryptography

Intro to Lattice-based Cryptography By Daniel Benarroch, July 2020 Most pictures taken from Daniele Micciancio's & Chris Peikert's presentations Content Lattices Motivation What is a Lattice? Important properties Computational problems

7/13/2020
Read more from danib31
Published on HackMD