 Hi everyone, this is Nan Wang from the Australian National University. We are going to present our paper Flash Proofs, Efficient Zero Knowledge Arguments of Range and Polynomial Evaluation on the 6th December in Asia Crypt 2022. Flash Proofs are three round sigma protocols and the discrete logarithm assumption with a transparent setup. They do not require any pairing operations. First, we will present a new type of zero-knowledge range argument. We devise a new variant of the bit decomposition approach to prove that a committed value is in the range between zero and two power n minus one. Our range argument is tailored to confidential transactions on blockchain platforms. It achieves n to the power of two-third sublinear efficiency in communication and verification. The major breakthrough is that verifying our range argument consumes a comparable amount of gas costs to that of the most efficient ZK snark without resorting to any trusted setup on Ethereum. Our argument also supports the aggregation of multiple arguments for further improvement in efficiency. The table at the bottom shows the proof size and verification gas costs on Ethereum for a 32-bit and a 64-bit range respectively. Second, we will introduce a new zero-knowledge argument for polynomial evaluation. The argument aims to prove a public polynomial relation between two committed values. We provide two zero-knowledge protocols, which are optimized for lower and higher degree polynomials respectively. Our protocols build on the work of buyer and growth. To the best of our knowledge, our argument can instantiate the most communication-efficient membership argument in the discrete logarithm setting among those not requiring trusted setups. It also supports the aggregation of multiple arguments sharing the same inputs. The table illustrates an efficiency comparison of VG13 and our two arguments for lower and higher degree polynomials. It can be observed that our argument achieves a non-trivial improvement, improving verification and proof size. If you're interested in our work, please come and watch our presentation on 6 December. Thank you.