Unified Proof of Work: Delegating and Solving Customized Computationally Bounded Problems in a Privacy-Preserving Way

Yue Fu, Qingqing Ye, Rong Du, Haibo Hu

Abstract

Proof of work (PoW), which was initially introduced for combating junk email spam, is extremely energy-thirsty, but the computed outcomes are of very little relevance to any practical usage. Some existing works tackle this issue by replacing the useless cryptographic puzzles with some pre-determined practical problems. However, the allowable problem types are usually limited and fixed, and some problems are of no significant value. This paper presents a Unified Proof of Work (UPoW) mechanism using flexible problems as puzzles, which features a computation-trading platform where delegators post their problems and PoW executors compute them as a by-product. The proposed UPoW puts known problem types together and frames them as verifiable computation problems using Fully Homomorphic Encryptions (FHE) techniques to replace PoW puzzles. It also secures and preserves the functionality of the delegated problems, which is showcased by delegating a Private Set Intersection (PSI) problem.
BibTeX
@inproceedings{fu2022unified,
  author = {Yue Fu and Qingqing Ye and Rong Du and Haibo Hu},
  title = {{Unified Proof of Work: Delegating and Solving Customized Computationally Bounded Problems in a Privacy-Preserving Way}},
  booktitle = {APWeb/WAIM},
  year = {2022},
  doi = {10.1007/978-3-031-25201-3\_24},
}

Loading related content...

Figure