With the development of cloud computing, the advantages of low cost and high computation ability meet the demands of complicated computation of multimedia processing. Outsourcing computation of cloud could enable users with limited computing resources to store and process distributed multimedia application data without installing multimedia application software in local computer terminals, but the main problem is how to protect the security of user data in untrusted public cloud services. In recent years, the privacy-preserving outsourcing computation is one of the most common methods to solve the security problems of cloud computing. However, the existing computation cannot meet the needs for the large number of nodes and the dynamic topologies. In this paper, we introduce a novel privacy-preserving outsourcing computation method which combines GM homomorphic encryption scheme and Bloom filter together to solve this problem and propose a new privacy-preserving outsourcing set intersection computation protocol. Results show that the new protocol resolves the privacy-preserving outsourcing set intersection computation problem without increasing the complexity and the false positive probability. Besides, the number of participants, the size of input secret sets, and the online time of participants are not limited.

No abstract

Social and economic activity of the Russian elder generation has a contradictory nature. On the one hand, Russian pensioners often continue working beyond the existing comparatively low retirement age, on the other hand, in terms of involvement in volunteering, political activities, and even in care for children and grandchildren they lag significantly behind the average European level. Explaining it only by the lack of time does not seem plausible, since in many European countries, the employment rates, involvement in unpaid work and caring for other family members are all higher than in Russia. In our study we attempt to identify reasons for lower social and economic activity of older adults in Russia as compared with European countries. We use data of Tomsk regional survey (2015, N=400) for accessing older adults' social activity. Data analysis on Tomsk region suggests that employment (as an activity) and education (as a prerequisite) contribute to higher involvement in social interactions in later life.

This paper aims to contribute to the theorisation of the expectations for the future life (EFL) of floating people whose household registration books (hukou) are not registered locally in China's mega-cities. Although the EFL of many rural-urban migrants is explicit, the EFL type of other floating cohorts such as educated migrants and the formation mechanism of EFL of floating people are much less well understood. We argue that EFL is a person's pre-judgment or estimation of living conditions in the future based on his/her perception of current human well-being or utility of life and its main concern is whether he/she expects to live in the mega-city in the future. Based on the social production functions (SPF) theory, three types of EFL for floating population are identified by using data collected from in-depth interviews with 30 Beijing's migrants. This paper reveals that the EFL of floating population is formed by comparing their current actual utility of life with the "normative utility" in the specific life course stage, which is the life utility that people should have in their specific life course stage expected by the society. Finally, these findings are checked out that the theoretical saturation has been reached by applying another 9 copies of transcripts of interviewees.

LowMC is a family of block ciphers proposed by Albrecht et al. at EUROCRYPT 2015, which is tailored specifically for FHE and MPC applications. At ToSC 2018, a difference enumeration attack was given for the cryptanalysis of low-data instances of full LowMCv2 with few applied S-boxes per round. Recently at CRYPTO 2021, an efficient algebraic technique was proposed to attack 4-round LowMC adopting a full S-box layer. Following these works, we present a new difference enumeration attack framework, which is based on our new observations on the LowMC S-box, to analyze LowMC instances with a full S-box layer. As a result, with only 3 chosen plaintexts, we can attack 4-round LowMC instances which adopt a full S-box layer with block size of 129, 192, and 255 bits, respectively. We show that all these attacks have either a lower time complexity or a higher success probability than those reported in the CRYPTO paper.