TY - GEN
T1 - Unified Proof of Work: Delegating and Solving Customized Computationally Bounded Problems in a Privacy-Preserving Way
AU - Fu, Yue
AU - Ye, Qingqing
AU - Du, Rong
AU - Hu, Haibo
N1 - Funding Information:
Acknowledgement. This work was supported by National Natural Science Foundation of China (Grant No: 62072390, 62102334), and the Research Grants Council, Hong Kong SAR, China (Grant No: 15222118, 15218919, 15203120, 15226221, 15225921, and C2004-21GF).
Publisher Copyright:
© 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2023
Y1 - 2023
N2 - 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.
AB - 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.
KW - Outsourced cloud computing
KW - Proof of work
KW - Security
UR - http://www.scopus.com/inward/record.url?scp=85151062771&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-25201-3_24
DO - 10.1007/978-3-031-25201-3_24
M3 - Conference article published in proceeding or book
AN - SCOPUS:85151062771
SN - 9783031252006
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 309
EP - 317
BT - Web and Big Data - 6th International Joint Conference, APWeb-WAIM 2022, Proceedings
A2 - Li, Bohan
A2 - Tao, Chuanqi
A2 - Yue, Lin
A2 - Han, Xuming
A2 - Calvanese, Diego
A2 - Amagasa, Toshiyuki
PB - Springer Science and Business Media Deutschland GmbH
T2 - 6th International Joint Conference on Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM), APWeb-WAIM 2022
Y2 - 25 November 2022 through 27 November 2022
ER -