Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2022-04-07 Cooperative journals: 《计算机应用研究》
Abstract： Aiming at the problems of key abuse and digital certificate management in the current lattice-based proxy re-encryption scheme, this paper proposed a new identity based accountable proxy re encryption scheme by introducing the accountability algorithm. This scheme used the user ID to calculate matrix as the public key and used the pre-image sampling algorithm to extract the private key, which solved the problem of digital certificate management; used the public keys of both users to calculate and generate the re-encryption key, which improved the computational efficiency of encryption and decryption; used the proxy's public and private keys to participate in the re-encryption calculation, completed the accountability algorithm, and inhibited the collusion of the proxy and the delegatee. The security analysis shows that the scheme satisfies the chosen-plaintext attack security. In terms of efficiency, the scheme has less computational complexity and ciphertext overhead.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2020-09-28 Cooperative journals: 《计算机应用研究》
Abstract： Splatting is a classical direct volume rendering method based on object order, which volume data exists in layers and each layer of data has similar lines. The amount of calculation data restricts the speed of image rendering. In order to further improve the rendering speed, this paper used a method based on the combination of similarity between adjacent layers and empty voxel jump to speed up the algorithm. It filtered the 3D texture data of the image in the process of reading the data, and then used the footstep table in the 3D texture data after filtering was projected in two dimensions. It calculated the gray value of each point by using the similarity between adjacent layers, and classified the data according to the gray value of each point to calculate the empty voxel that had no effect on the imaging, skiped the rendering process and speeded up the algorithm. The experimental results show that the optimized algorithm can solve and improve the spatial correlation and operation efficiency of splatting algorithm to a certain extent on the basis of ensuring the quality of the drawn image.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2020-09-28 Cooperative journals: 《计算机应用研究》
Abstract： In order to depict the attacker's attack trajectory better, this paper proposed a path prediction method based on T_NAG(time attribute network attack graph) model. First of all, proposed a new attack graph model T_NAG to distinguish the attacker's ability according to the real-time behavior trace. Secondly, according to the characteristics of the attacker's different capabilities, proposed the concept of attack intention, considered the operation risk and attack profit as a whole and introduced the time decay parameter into the intention calculation, and designed a vulnerability utilization quantification method based on the attacker's capabilities. Finally, further integrated attack intention and vulnerability utilization into the consideration of path reachability probability, and given the IntenAbi-PathPre algorithm to predict the attack path. The experimental results show that this method can effectively remove the redundancy in the attack graph and improve the accuracy of attack path prediction.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2019-01-03 Cooperative journals: 《计算机应用研究》
Abstract： With the rapid development of service computing and Internet of Things (IoT) technology, a large number of IoT services have appeared on the network. To recommend the most suitable IoT services for target user, some approaches has proposed in the field of service recommendation. However, with the increase of services data, existing methods may not guarantee that better recommendation performance can be achieved, which ignore real-time context information of users. To solve the problem, a method based on context-aware IoT service recommendation is proposed. The method, based on improved FolkRank algorithm, firstly generates a list of IoT services which are available to the current user. Then the user context information model is constructed according to the current critical context of user. Finally, the IoT services that best match the current context are filtered out from service list according to user context information model. The experimental results show that the proposed context-aware IoT service recommendation method is feasible and effective.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-05-24 Cooperative journals: 《计算机应用研究》
Abstract： Cross-site scripting (XSS) attacks have been one of the biggest threats to Internet security. Aiming at the problems of traditional vulnerability detection method based on penetration testing technology, such as attack vectors of low complexity easy to filter and overall detection process cumbersome, this paper proposed a new attack vectors automatic generation method which based on extended Backus-naur form (EBNF) and a XSS vulnerability twice crawling strategy. By defining the EBNF rule, the method generated a rule-parsing tree, and then traversed hierarchically the tree to obtain high-complexity attack vectors. In the first page crawling, the strategy inserted input point information to attack vectors and requested injection. Then it carried on the second crawling and requested legal parameters to get the return page. In the final, this paper designed and implemented a prototype system, and used two platforms for vulnerability detection. The comparative experiments prove that the system has a simple detection process, and to a certain extent, improves the number of vulnerability detection and reduces the false positive rate.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-05-20 Cooperative journals: 《计算机应用研究》
Abstract： To evaluate various service matching strategies accurately for selecting the best appropriate service strategy, and to achieve the best service matching of supply and demand in the dynamic process of cluster collaborative manufacturing, this paper proposed a computational experiment method for the service matching strategy of cluster collaborative manufacturing. it researched the service matching strategy of cluster collaborative manufacturing from three aspects, which included the design of service matching strategy (service matching strategy only considering the change of QoS attribute of service resource, service matching strategy only considering the change of customer demand, service matching strategy considering change of customer demand and QoS attribute of service resource) , the construction of experiment system of cluster collaborative manufacturing, and the experimental evaluation analysis of service matching strategy. The experimental results show that service matching strategy considering change of customer demand and QoS attribute of service resource is the best strategy which can achieve the service matching of supply and demand in the dynamic market environment.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-04-19 Cooperative journals: 《计算机应用研究》
Abstract： Aiming at the privacy protection problem of location service in mobile Internet environment, a high quality of service privacy enhancement scheme based on bilinear pairing property and anonymity is proposed. The terminal generates 2k evenly distributed false locations in the ring area of Euclidean distance. According to location entropy, location dispersion and map background information, the terminal screens superior k-1 false locations from them to achieve better k-anonymity. Through the security analysis, the scheme not only satisfies the privacy, anonymity, unforgeability etc. , but also can resist query service tracking attack. The simulation experiments show that the selection of false position nodes in this scheme has a better uniformity, and the efficiency of the false node generation and selection is also improved.
Hits
Hits
Downloads
Comment