Linear Mix-net and a Scheme for Collecting Data from Anonymous Data Holders

Shinsuke Tamura^1, and Shuji Taniguchi¹

¹School of Engineering, University of Fukui, Fukui, Japan

Cite this paper:
Shinsuke Tamura and Shuji Taniguchi. Linear Mix-net and a Scheme for Collecting Data from Anonymous Data Holders. Information Security and Computer Fraud. 2014; 2(3):39-47. doi: 10.12691/iscf-2-3-2

Abstract

To make e-society, e-governance and cloud computing systems be utilized more widely, this paper proposes a scheme to collect attribute values belong to same data holders and calculate functions of them without knowing correspondences between the attribute values and their holders or links among attribute values of same holders. Different from most of other schemes the proposed scheme is based on linear Mix-net that exploits secret key encryption functions such as linear equation based (LE-based) and multidimensional array based (MA-based) ones, therefore it can handle real numbers that appear in many important business and engineering applications efficiently in the same way as integers. In addition, anonymous tag based credentials used in the scheme ensure the correctness of calculation results. Although the scheme can calculate only linear combinations of attribute values when LE-based encryption functions are used, if they are replaced with MA-based ones, it can calculate also general polynomial functions of attribute values.

Keywords:
E-society E-governance cloud computing privacy homomorphic encryption functions anonymous tag based credentials

This work is licensed under a Creative Commons Attribution 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

References:

[1]	Diffie, W. and Hellman, M. E., “New directions in cryptography,” IEEE Trans. On Information Theory, IT-22 (6). 644-654. 1976.
[2]	Chaum, D., “Untraceable electronic mail, return address and digital pseudonyms,” Communications of the ACM, 24 (2). 84-88. 1981.
[3]	Cormen, T., Leiserson, C., Rivest, R. and Stein, C., Introduction to algorithms, MIT Press and McGraw-Hill, 2001.
[4]	Lee, B., Boyd, C., Dawson, E., Kim, K., Yang, J., and Yoo, S., “Providing receipt-freeness in Mixnet-based voting protocols,” Proc. of the ICISC ’03, 261-274. 2003.
[5]	Golle, P. and Jakobsson, M., “Reusable anonymous return channels,” Proc. of the 2003 ACM Workshop on Privacy in the Electronic Society, 94-100. 2003.
[6]	Belenkiy, M., Camenisch, J., Chase, M., Kohlweiss, M., Lysyanskaya, A. and Shacham, H., “Randomizable proofs and delegatable anonymous credentials,” Proc. of the 29th Annual International Cryptology Conference on Advances in Cryptology, 108-125. 2009.
[7]	Shahandashti, S. F. and Safavi-Naini, R., “Threshold attribute-based signatures and their application to anonymous credential systems,” Proc. of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology, 198-216. 2009.
[8]	Gentry, C., “Fully homomorphic encryption using ideal lattices,” Proc. of Symposium on theory of computing –STOC 2009, 169-178. 2009.
[9]	Chung, K., Kalai, Y. and Vadhan, S., “Improved Delegation of Computation Using Fully Homomorphic Encryption,” CRYPT 2010, LNCS 6223, 483-501. 2010.
[10]	Tamura, S., Anonymous Security Systems and Applications: Requirements and Solutions, Information Science Reference, 2012.
[11]	Tamura, S. and Taniguchi, S., “A scheme for collecting anonymous data,” Proc. of IEEE-ICIT2013, 1210-1215. 2013.
[12]	Tamura, S. and Taniguchi, S., “Enhanced Anonymous Tag Based Credentials,” Information Security and Computer Fraud, 2 (1). 10-20. 2014.