Research on One Secure Solution for Multiple Factor Ambiguous Pattern Recognition System

Abstract:

Ambiguous pattern recognition is a very important technology in the field of science including engineering application nowadays, it uses methods of fuzzy mathematics enabling the computer to recognize and judge the objective things. But, the research on ambiguous pattern recognition system rarely involves the field of security, while in fact both the participant of the pattern recognition and the database need to protect their privacy. This paper mainly introduces the secure multi-party computation into the field of ambiguous pattern recognition, raises a new solution for the secure multi factor ambiguous pattern recognition system under the half honest model, and proves the validity and security of the protocol.

• Periodical: Applied Mechanics and Materials (Volume 577)
• Pages: 948-951
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.577.948
• Online since: July 2014
• Authors: Xiao Mei Wang*, Sheng Qin Bian, Rong Zheng, An Wang
• Keywords: Inverter, Light-Load Energy Saving, Optimal Voltage Ratio

References

[1] WangXuhua, ChenShouyu. Multi-layer fuzzy pattern recognition model and the application in slope stability assessment. Journal of Liaoning Technical University. 2006：855-857.

[2] FU Hai-dong, YUAN Xi-guo. Design of an immune model based on fuzzy pattern recognition. Journal of Computer Applications, 2007. 1: 89-91.

[3] YAO,A.C. Protocols for secure computations [A]. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science [C]. 1982: 160-164.

DOI: 10.1109/sfcs.1982.38

[4] O. Goldreich, S. Micali and A. Wigderson. How play any mental game over the net. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing. 1987: 218-229.

DOI: 10.1145/28395.28420

[5] M. Ben-or, S. Goldwasser, A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proc. ACM STOC'88: 1-10.

DOI: 10.1145/62212.62213

[6] D. Chaum, C. Crépeau, I. Damgard. Multi-party unconditionally secure protocols. Proc of ACM STOC'88: 11-19.

DOI: 10.1145/62212.62214

[7] S. Goldwasser. Multi-party computations: past and present. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, Santa Barbara, CA USA. 1997, 8: 1-6.

DOI: 10.1145/259380.259405

[8] Cachin C, Micali S, Stadler M. Computationally private information retrieval with polylogarithmic communication. In: SLEM J, ed. Proc. of the Advances in Cryptology- EUROCRYPT'99. Lecture Notes in Computer Science. Vol. 1592, Springer-Verlag. 1999: 402-414.

DOI: 10.1007/3-540-48910-x_28

[9] Cachin C. Efficient private bidding and auctions with an oblivious third party. In: ACM Conf. on Computer and Communications Security, ed. Proc. of the 6th ACM Conf. on Computer and Communications Security. Assn for Computing Machinery. 1999: 120-127.

DOI: 10.1145/319709.319726

[10] O. Goldreich. Secure Multi-party computation. Working Draft. Version 1. 3. 2001, 6. Available fromhttp: /www. wisdom. weizmann. ac. il/~oded/pp/html.

[11] QIN Jing, ZHANG Zhen-feng, FENG Deng-guo, LI Bao. A protocol of specific secure two-party computation. Journal of China Institute of Communications. 25(11), 2004: 35-42.

[12] QIN Bo, QIN Hui, ZHOU Ke-fu, WANG Xiao-feng, WANG Yu-min. Millionaires' protocol with constant complexity. Journal of Xi'an University of Technology. 21(2), 2005: 149-152.

[13] LI Shun-dong, Dai Yi-qi, YOU Qi-you. An efficient solution to Yao's millionaires' problem. Chinese of Journal Electronics. 33(5). 2005, 5: 769-773.

[14] DU Wen-liang. Secure multi-party computation problems and their applications: A Review and Open Problems. Proceedings of the New Security Paradigms Workshop 2001: 13-22.

DOI: 10.1145/508171.508174