This Week in Blockchain Research Issue #86

Issue #86


Issue #86

Paper of the Week:

Paper Title: Zero-Knowledge Succinct Arguments with a Linear-Time Prover.

TLDR:

  1. This work constructs a zero knowledge argument system with polylogarithmic communication complexity where the prover runs in linear time and the verifier runs in polylogarithmic time.

  2. This achieves a central goal in the area of efficient zero knowledge.

  3. The result is a direct consequence of a new interactive oracle proof (IOP) that simultaneously achieves linear-time proving and zero knowledge.

  4. The work constructs an IOP where, for the satisfiability of an N -gate arithmetic circuit over any field of size Ω(N), the prover uses O(N) field operations and the verifier uses polylog(N) field operations (with proof length O(N) and query complexity polylog(N)).

  5. Polylogarithmic verification is achieved in the holographic setting for every circuit (the verifier has oracle access to a linear-time-computable encoding of the circuit whose satisfiability is being proved).

AuthorsJonathan Bootle*, Alessandro Chiesa†, and Siqi Liu†,

Affiliations: * IBM Research – Zurich and † UC Berkeley.


Security:

1. Paper Title: Reducing Participation Costs via Incremental Verification for Ledger Systems.

Summary: A systematic study of incremental verification for ledger systems, including its foundations, implementation, and empirical evaluation.

Authors: Weikeng Chen*, Alessandro Chiesa*, Emma Dauterman*, and Nicholas P. Ward*,

Affiliations* UC Berkeley.

2. Paper Title: CLUE: Towards Discovering Locked Cryptocurrencies in Ethereum.

Summary: The first systematic investigation on locked cryptocurrencies in Ethereum.

AuthorsXiaoqi Li*, Ting Chen†, Xiapu Luo*, and Chenxu Wang‡,

Affiliations: * The Hong Kong Polytechnic University, † University of Electronic Science and Technology of China, and ‡ Xi’an Jiaotong University.

3. Paper Title: Pricing Security in Proof-of-Work Systems.

Summary: This work characterizes the security investment of miners in terms of its cost in fiat money.

AuthorsGeorge Bissias*, Rainer Bohme†, David Thibodeau‡, and Brian N. Levine*,

Affiliations: * University of Massachusetts Amherst, † University of Innsbruck, and ‡ Unaffiliated.


Privacy:

1. Paper Title: Balancing Privacy and Accountability in Blockchain Transactions.

Summary: A novel design principle for identity management in Blockchains to maintain privacy, while still allowing compliance with current regulations and preventing exploitations of Blockchain technology for purposes which are incompatible with the social good.

Authors: Ivan Damgard*, Chaya Ganesh†, Hamidreza Khoshakhlagh*, Claudio Orlandi*, and Luisa Siniscalchi*,

Affiliations* Aarhus University and † Indian Institute of Science.

2. Paper Title: Delegated RingCT: faster anonymous transactions.

Summary: A modification to RingCT protocol with stealth addresses that makes it compatible with Delegated Proof of Stake based consensus mechanisms called Delegated RingCT.

Authors: Rui Morais*, Paul Crocker*, and Simao Melo de Sousa*,

Affiliations* University of Beira Interior.


Scalability:

1. Paper Title: VM Matters: A Comparison of WASM VMs and EVMs in the Performance of Blockchain Smart Contracts.

Summary: The first step to measure the impact of contract engines on the performance of smart contract execution.

Authors: Shuyu Zheng*, Haoyu Wang†, Lei Wu‡, Gang Huang*, and Xuanzhe Liu*,

Affiliations* Peking University, † Beijing University of Posts and Telecommunications, and ‡ Zhejiang University.


Proofs:

1. Paper Title: On the Concurrent Composition of Quantum Zero-Knowledge.

Summary: The notion of zero-knowledge secure against quantum polynomial-time verifiers (referred to as quantum zero-knowledge) in the concurrent composition setting. Despite being extensively studied in the classical setting, concurrent composition in the quantum setting has hardly been studied.

Authors: Prabhanjan Ananth*, Kai-Min Chung†, and Rolando L. La Placa

Affiliations* UC Santa Barbara, † Academia Sinica, and ‡ MIT.


Consensus:

1. Paper Title: Byzantine Eventual Consistency and the Fundamental Limits of Peer-to-Peer Databases.

Summary: What are the limits of what we can achieve without introducing Sybil countermeasures? In other words, which applications can tolerate arbitrary numbers of Byzantine faults?

Authors: Martin Kleppmann* and Heidi Howard*,

Affiliations* University of Cambridge.


Tokenomics:

1. Paper Title: Crypto-Enforcement Around the World.

Summary: A detailed analysis of enforcement in major crypto-market jurisdictions.

AuthorsYuliya Guseva* and Douglas Eakeley,

Affiliations: * Rutgers.


Conferences, Journals, & CFPs:


Conferences’ Videos:


Jobs:


RFPs:


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.