This Week in Blockchain Research Issue #101
|zk Capital||Mar 24|
BROUGHT TO YOU BY
Paper of the Week:
Schnorr’s signature scheme provides an elegant method to derive signatures with security rooted in the hardness of the discrete logarithm problem, which is a well-studied assumption and conducive to efficient cryptography.
However, unlike pairing-based schemes which allow arbitrarily many signatures to be aggregated to a single constant sized signature, achieving significant non-interactive compression for Schnorr signatures and their variants has remained elusive.
This work shows how to compress a set of independent EdDSA/Schnorr signatures to roughly half their naive size.
This technique does not employ generic succinct proofs; it is agnostic to both the hash function as well as the specific representation of the group used to instantiate the signature scheme.
The paper demonstrates via an implementation that the proposed aggregation scheme is indeed practical.
Additionally, it gives strong evidence that achieving better compression would imply proving statements specific to the hash function in Schnorr’s scheme, which would entail significant effort for standardized schemes such as SHA2 in EdDSA.
Among the others, the proposed solution has direct applications to compressing Ed25519-based blockchain blocks because transactions are independent and normally users do not interact with each other.
Summary: The first Deep Neural Network (DNN)-based vulnerability detection framework for Ethereum smart contracts that supports lightweight transfer learning on unseen security vulnerabilities, thus is extensible and generalizable.
Authors: Oliver Lutz*, Huili Chen†, Hossein Fereidooni‡, Christoph Sendner*, Alexandra Dmitrienko*, Ahmad Reza Sadeghi‡, and Farinaz Koushanfar†,
Summary: A novel approach based on sound graph theory for identifying transaction inputs and outputs.
1. Paper Title: Nova: Recursive Zero-Knowledge Arguments from Folding Schemes.
Summary: A new zero-knowledge proof system for incremental computations, where for an N-sized computation with C-sized steps, the prover runs in Oλ(N) time to produce Oλ(logC)-sized proofs that can be verified in Oλ(C) time.
Summary: A new practical generic framework to attain randomized asynchronous BFT protocols with optimistic deterministic executions.
Summary: As mining significantly determines the reliability and security of the operation of the Bitcoin system, it’s important to understand whether the trading market can influence the investment in mining.
Summary: A model of transaction safety in permissioned and permissionless blockchains to study the tradeoff and find that in several settings there may be no tradeoff at all.
Affiliations: * New York 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.