TY - GEN
T1 - EVOC
T2 - IEEE International Conference on Communications, ICC 2015
AU - Zhou, Jun
AU - Cao, Zhenfu
AU - Dong, Xiaolei
AU - Lin, Xiaodong
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/9/9
Y1 - 2015/9/9
N2 - Verifiable outsourced computation enables a computational resource-constrained mobile device to outsource the computation of a function F on multiple inputs x1,..., xn to the cloud that is generally assumed to possess abundant powers. The most existing work depends on Yao's Garbled Circuit and fully homomorphic encryptions that took considerable computational overhead on weak clients. In this paper, a more efficient verifiable outsourced computation of encrypted data EVOC supporting any functions from any one-way trapdoor function is proposed, based on our newly-devised privacy preserving data aggregation supporting both addition and multiplication operations without exploiting fully homomorphic encryption (FHE). It solves the open problem suggested by Gennaro et al. that how to devise a verifiable computation scheme that used a more efficient primitive than FHE. Finally, the formal security proof and extensive efficiency evaluations demonstrate our proposed EVOC satisfies the target security and privacy requirements and far outperforms the state-of-the-art in terms of computational and communication complexity.
AB - Verifiable outsourced computation enables a computational resource-constrained mobile device to outsource the computation of a function F on multiple inputs x1,..., xn to the cloud that is generally assumed to possess abundant powers. The most existing work depends on Yao's Garbled Circuit and fully homomorphic encryptions that took considerable computational overhead on weak clients. In this paper, a more efficient verifiable outsourced computation of encrypted data EVOC supporting any functions from any one-way trapdoor function is proposed, based on our newly-devised privacy preserving data aggregation supporting both addition and multiplication operations without exploiting fully homomorphic encryption (FHE). It solves the open problem suggested by Gennaro et al. that how to devise a verifiable computation scheme that used a more efficient primitive than FHE. Finally, the formal security proof and extensive efficiency evaluations demonstrate our proposed EVOC satisfies the target security and privacy requirements and far outperforms the state-of-the-art in terms of computational and communication complexity.
UR - https://www.scopus.com/pages/publications/84953807113
U2 - 10.1109/ICC.2015.7249516
DO - 10.1109/ICC.2015.7249516
M3 - 会议稿件
AN - SCOPUS:84953807113
T3 - IEEE International Conference on Communications
SP - 7444
EP - 7449
BT - 2015 IEEE International Conference on Communications, ICC 2015
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 8 June 2015 through 12 June 2015
ER -