Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2019-01-28 Cooperative journals: 《计算机应用研究》
Abstract： Study the problem of secure subset, most of the existing protocols that solve such problems can only keep the elements of one set private, therefore, it has great practical significance to study this kind of problem. Under the semi-honest model, this paper constructed a secure subset protocol by using Bloom filter and Goldwasser-Micali homomorphic encryption algorithm, and proved the security of the protocol by using common simulation examples in secure multi-party computing. It used the Bloom filter to map a data set with a large number or large number field elements into a smaller data set, improved the efficiency and range of the protocol, at the same time, it used the Goldwasser-Micali homomorphic encryption algorithm to ensure the security of the protocol. Most of the relevant researches are based on the difficult problems such that secondary residuals, it is impossible to resist quantum attacks, and the secure subset computation which can resist quantum attacks is a further research direction.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： The sponge function uses shorter keys and initial vectors, so it is used as a new pseudo-random generator structure. This paper proposed a fast pseudo-random sequence generation method based on spongy function in combination with the coding theory, to solve the problems of low efficiency and slow speed of 2SC (sponge code-based stream cipher) pseudo-random sequence generation method proposed by Meziani et al. uses a generic state transformation which is reducible to the Regular Syndrome Decoding problem(RSD) , but has better computational characteristics than the regular encoding. Theoretical analysis and experimental results show that the pseudo-random sequence generator preserves the characteristics of sponge function, but it improved the efficiency greatly. For the security level of 160bits, its 5 times faster than the original scheme. At the same time, NIST statistical test, sequence balance and cross correlation test results show that the generated pseudo-random sequence has good random characteristics.
Hits
Hits
Downloads
Comment