Multi-client Authenticated Intersection Protocol from a Negative Database Server

The negative information (the complement of the original data) is a promising technology proven to provide diversified secure functions of Applications on Internet, such as privacy protection, intersection query, and negative authentication and so on. In this paper, we firstly propose a secure three-party authentication intersection protocol based on negative database which storing negative information. By carefully designing the proposed protocol, we expand the three-party protocol to multi-party instance while making the calculated consumption and communicating round restrict to an acceptable bound. In the two proposed protocols, we achieve the completion of authentication and data encryption transmission in one time. The server only plays the role of authentication and auxiliary transmission. At the same time, the client’s private information will not be leaked to others in the process of calculating intersections, and all the clients participating in the intersection calculation can only obtain their intersection information, while other database information can be secure and confidential. This paper proves that a negative database can be used for secure multi-party computing.

[1]  Huang Hong-sheng.  Protocol for privacy-preserving set intersection , 2010 .

[2]  Paul Helman,et al.  Protecting data privacy through hard-to-reverse negative databases , 2007, International Journal of Information Security.

[3]  Ran Liu,et al.  A fine-grained algorithm for generating hard-toreverse negative databases , 2015, 2015 International Workshop on Artificial Immune Systems (AIS).

[4]  Paul Helman,et al.  Negative representations of information , 2009, International Journal of Information Security.

[5]  Benny Pinkas,et al.  Efficient Private Matching and Set Intersection , 2004, EUROCRYPT.

[6]  Marina Blanton,et al.  Secure Multiparty Computation , 2011, Encyclopedia of Cryptography and Security.

[7]  Stephanie Forrest,et al.  A Relational Algebra for Negative Databases , 2007 .

[8]  Wenjian Luo,et al.  Estimating positive surveys from negative surveys , 2013 .

[9]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[10]  Ueli Maurer,et al.  General Secure Multi-party Computation from any Linear Secret-Sharing Scheme , 2000, EUROCRYPT.

[11]  Paul Helman,et al.  Enhancing Privacy through Negative Representations of Data , 2004 .

[12]  Mikhail J. Atallah,et al.  Algorithms and Theory of Computation Handbook , 2009, Chapman & Hall/CRC Applied Algorithms and Data Structures series.

[13]  Fernando Esponda,et al.  Everything That is Not Important: Negative Databases , 2008 .

[14]  Ran Liu,et al.  Experimental analyses of the K-hidden algorithm , 2017, Eng. Appl. Artif. Intell..

[15]  Liina Kamm,et al.  Privacy-preserving statistical analysis using secure multi-party computation , 2015 .

[16]  Wenjian Luo,et al.  A Study of the Private Set Intersection Protocol Based on Negative Databases , 2013, 2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing.

[17]  Wenjian Luo,et al.  On the dependable level of the negative survey , 2014 .

[18]  Wenjian Luo,et al.  Fast searching optimal negative surveys , 2014 .

[19]  Stephanie Forrest,et al.  Application and analysis of multidimensional negative surveys in participatory sensing applications , 2013, Pervasive Mob. Comput..

[20]  Xu Chen.  A(3,3) visual cryptography scheme for authentication , 2013 .

[21]  Paul Helman,et al.  On-line Negative Databases , 2004, Int. J. Unconv. Comput..

[22]  Huaxiong Wang,et al.  Privacy-Preserving Distributed Set Intersection , 2008, 2008 Third International Conference on Availability, Reliability and Security.