This Week in Blockchain Research Issue #106
BROUGHT TO YOU BY
Paper of the Week:
Paper Title: SnarkPack: Practical SNARK Aggregation.
This work presents and implements an argument for aggregating n Groth16 zkSNARKs with a O(log n) proof size and verifier time.
The techniques are inspired from the inner pairing product argument introduced by Bünz et al. with the difference that the final scheme does not require a different trusted setup, but it reuses the one from the pairing-based SNARK that it aggregates.
The key tool for the proposed construction is a new commitment scheme that allows to instantiate the inner product pairing argument of Bünz et al. by using existing powers of tau ceremony transcripts.
The work also describes a scheme that merges together a multi-exponentiation argument and an inner pairing product argument for some common randomness vector with minimal overhead.
Then it applies some optimisations to the protocol and illustrates it’s efficiency by implementing it.
SnarkPack can aggregate 1024 proofs in 2s and verify them in 33ms, including un-serialization time, yielding a verification mechanism that is exponentially faster than batching.
Summary: This paper conducts a systematic literature mapping identifying initiatives and tools to analyze SCs and how to deal with the identified vulnerabilities.
2. Paper Title: SoK: Exploring Blockchains Interoperability.
Summary: This paper presents a Systematization of Knowledge for the existing efforts on blockchains interoperability.
Authors: Gang Wang*,
Affiliations: * University of Connecticut.
Summary: A practical RingCT protocol based on post-quantum lattice assumptions.
1. Paper Title: On Simulation-Extractability of Universal zkSNARKs.
Summary: A class of computationally special-sound interactive proofs of knowledge that are zero- knowledge in the standard model and have a unique response property are simulation-extractable out-of- the box in the Random Oracle model when the Fiat–Shamir transformation is applied to them.
2. Paper Title: Non-Interactive Zero Knowledge from Sub-exponential DDH.
Summary: The first constructions of non-interactive zero-knowledge and Zap arguments for NP based on the sub-exponential hardness of Decisional Diffie-Hellman against polynomial time adversaries (without use of groups with pairings).
Affiliations: * Johns Hopkins University.
1. Paper Title: Decentralized Finance: Regulating Cryptocurrency Exchanges.
Summary: This Article proposes that regulators introduce formal registration obligations for cryptocurrency intermediaries —the exchange platforms that provide a marketplace for secondary market trading.
Authors: Kristin N. Johnson*,
Affiliations: * Emory University.
Thanks to our sponsor
Protocol Labs is an open-source research, development, and deployment laboratory. Projects include IPFS, Filecoin, libp2p, and many more. Protocol Labs aims to make human existence orders of magnitude better through technology.
The internet is humanity’s superpower, and they’re making it more dependable, equitable, and secure. Join the Protocol Labs team!
This newsletter is for informational purposes only. This content does not in any way constitute an offer or solicitation of an offer to buy or sell any investment solution or recommendation to buy or sell a security; nor it is to be taken as legal, business, investment, or tax advice. In fact, none of the information in this or other content on zk Capital should be relied on in any manner as advice. None of the authors, contributors, or anyone else connected with zk Capital, in any way whatsoever, can be responsible for your use of the information contained in this newsletter.