TY - GEN
T1 - V-EPTD
T2 - 21st International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2021
AU - Xu, Chang
AU - Rao, Hongzhou
AU - Zhu, Liehuang
AU - Zhang, Chuan
AU - Sharif, Kashif
N1 - Publisher Copyright:
© 2022, Springer Nature Switzerland AG.
PY - 2022
Y1 - 2022
N2 - Privacy-preserving truth discovery has been researched from many perspectives in the past few years. However, the complex iterative computation and multi-user feature makes it challenging to design a verifiable algorithm for it. In this paper, we propose a novel scheme named V-EPTD that not only protects the privacy information but also verifies the computing in truth discovery. The proposed technique adopts a threshold paillier cryptosystem to solve the multi-user problem so that all parties encrypt the data with the same public key while being unable to decrypt the ciphertext if there are not enough parties. V-EPTD also transforms complex iterative computation into polynomials, uses linear homomorphic hash, and commitment complete verification. The experimentation and analysis show that V-EPTD has good performances for users, verifiers, and the server, both in communication overhead and computation overhead.
AB - Privacy-preserving truth discovery has been researched from many perspectives in the past few years. However, the complex iterative computation and multi-user feature makes it challenging to design a verifiable algorithm for it. In this paper, we propose a novel scheme named V-EPTD that not only protects the privacy information but also verifies the computing in truth discovery. The proposed technique adopts a threshold paillier cryptosystem to solve the multi-user problem so that all parties encrypt the data with the same public key while being unable to decrypt the ciphertext if there are not enough parties. V-EPTD also transforms complex iterative computation into polynomials, uses linear homomorphic hash, and commitment complete verification. The experimentation and analysis show that V-EPTD has good performances for users, verifiers, and the server, both in communication overhead and computation overhead.
KW - Commitment
KW - Homomorphic encryption
KW - Privacy-preserving
KW - Truth discovery
KW - Verifiable computation
UR - http://www.scopus.com/inward/record.url?scp=85126183588&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-95391-1_28
DO - 10.1007/978-3-030-95391-1_28
M3 - Conference contribution
AN - SCOPUS:85126183588
SN - 9783030953904
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 447
EP - 461
BT - Algorithms and Architectures for Parallel Processing - 21st International Conference, ICA3PP 2021, Proceedings
A2 - Lai, Yongxuan
A2 - Wang, Tian
A2 - Jiang, Min
A2 - Xu, Guangquan
A2 - Liang, Wei
A2 - Castiglione, Aniello
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 3 December 2021 through 5 December 2021
ER -