Cryptology ePrint Archive: Report 2021/1350

Generalized Proof of Liabilities

Yan Ji and Konstantinos Chalkias

Abstract: Proof of liabilities (PoL) allows a prover to prove his/her liabilities to a group of verifiers. This is a cryptographic primitive once used only for proving financial solvency but is also applicable to domains outside finance, including transparent and private donations, new algorithms for disapproval voting and publicly verifiable official reports such as COVID-19 daily cases. These applications share a common nature in incentives: it's not in the prover's interest to increase his/her total liabilities. We generalize PoL for these applications by attempting for the first time to standardize the goals it should achieve from security, privacy and efficiency perspectives. We also propose DAPOL+, a concrete PoL scheme extending the state-of-the-art DAPOL protocol but providing provable security and privacy, with benchmark results demonstrating its practicality. In addition, we explore techniques to provide additional features that might be desired in different applications of PoL and measure the asymptotic probability of failure.

Category / Keywords: cryptographic protocols / distributed audit, blockchains, range proofs, sparse Merkle trees, solvency, tax reporting, disapproval voting, fundraising, COVID-19 reporting, credit score

Original Publication (with minor differences): ACM CCS 2021

Date: received 6 Oct 2021

Contact author: chalkiaskostas at gmail com, kostascrypto at fb com, yj348 at cornell edu

Available format(s): PDF | BibTeX Citation

Version: 20211007:112938 (All versions of this report)

Short URL: ia.cr/2021/1350


[ Cryptology ePrint archive ]