Article citationsMore >>

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.

has been cited by the following article:

Article

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

1School of Engineering, University of Fukui, Fukui, Japan


Information Security and Computer Fraud. 2014, Vol. 2 No. 3, 39-47
DOI: 10.12691/iscf-2-3-2
Copyright © 2014 Science and Education Publishing

Cite this paper:
Shinsuke Tamura, 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.

Correspondence to: Shinsuke  Tamura, School of Engineering, University of Fukui, Fukui, Japan. Email: tamura@dance.plala.or.jp

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