Gang Xu^1,2, Fan Yun¹, Xiu-Bo Chen^3,*, Shiyuan Xu¹, Jingzhong Wang¹, Tao Shang⁴, Yan Chang⁵, Mianxiong Dong⁶

Intelligent Automation & Soft Computing, Vol.34, No.1, pp. 531-541, 2022, DOI:10.32604/iasc.2022.028264

Abstract Secure multi-party computation has been playing a fundamental role in terms of classical cryptography. Quantum homomorphic encryption (QHE) could compute the encrypted data without decryption. At present, most protocols use a semi-honest third party (TP) to protect participants’ secrets. We use a quantum homomorphic encryption scheme instead of TP to protect the privacy of parties. Based on quantum homomorphic encryption, a secure multi-party quantum summation scheme is proposed in which N participants can delegate a server with strong quantum computing power to assist computation. By delegating the computation and key update processes to a server and a semi-honest key center,… More >

T. Zhang^1,2, D. G. Zhang^1,2,*, X. H. Liu^1,2, C. L. Gong^1,2

Intelligent Automation & Soft Computing, Vol.26, No.3, pp. 429-437, 2020, DOI:10.32604/iasc.2020.013919

Abstract It is known that the locating accuracy of the traditional Distance Vector-HOP (DV-HOP) approach in a Wireless Sensor Network (WSN) depends on the density of the anchor node. A novel WSN-oriented locating approach based on a node's density is proposed in this paper. The approach can compute the distance of the node based on the maximum likelihood estimation strategy. It can improve the accuracy ratio of the measuring distance among the nodes. The relative nodes of a WSN can find the average hop distances by estimating the distances from themselves to their circular nodes. In order to assess the performance… More >