Zero-knowledge proofs are becoming increasingly important for addressing privacy and scalability concerns in a variety of applications. Zk-SNARK, one of the most practical zero-knowledge schemes requires a separate trusted setup for each circuit. In this talk, we will discuss SONIC which requires a single trusted setup for all circuits. Moreover SONIC allows updates to its structured reference string which scales linearly in size. SONIC proofs are constant in size and in the batched mode of operation, the cost of verification is comparable with the most efficient SNARKs in the literature.