Search

In order to ensure the location privacy of mobile nodes when using location-based services,a mobile privacy protection scheme for location based service(LBS)based on random onion routing is proposed.This scheme integrates random onion routing and hybrid encryption to ensure the privacy of mobile node location and the security of query requests.The mobile node randomly selects several nodes in the network before sending the query request to the LBS server to build an onion path,and forwards the query request along this path in turn until the LBS server receives the message.Then,the LBS sends the query result to the sen-ding node along the reverse direction of the onion path.In order to realize the anonymity of the sending node,the addresses of each layer on the randomly constructed onion path are encrypted with a combination of symmetric encryption and asymmetric encryption.In this way,layers of encryption are used to generate the final onion path.Each hop node in the path can get only its next-hop node.Neither the LBS server nor any relay node in the onion routing path can know which node is the sending node,so that the location privacy of the sending node can be kept.On the other hand,in order to ensure that no third party can get the query request or query result,the sending node first uses a symmetric key to encrypt the query request.Then it uses the public key of the LBS server to encrypt the symmetric key.Finally it attaches the symmetric key ciphertext to the query request ciphertext and send it to the LBS server.The LBS server will also return the encrypted query result.Experimental results show that the average response time of this scheme increases slowly with the increase of the number of nodes in the system.The average response time will not increases sharply with the increase of the number of nodes,which will lead to system paralysis.So the system has good stability and scalability.The onion path is randomly selected which does not depend on a specific node,so the scheme has better robustness.

With the rapid development of electronic information technology, the security of data has become increasingly serious. The traditional single cipher algorithm can not meet the requirements any more. In order to solve these problems, this paper proposed a hardware design scheme of high-speed hybrid encryption system based on SM2, SM3, SM4, in which the hardware structure of SM2 and SM4 algorithms is optimized. Besides, this paper optimized the SM2 algorithm with Karatsuba-Ofman modular multiplier and parallel with point operation. For SM4 algorithm, this paper designed a subpipelining hardware architecture based on composite field S-box so as to improve its throughout. The experimental results showed that all the algorithm circuits implemented by the system have high performance: the point multiplication time of SM2 was 68.37 μs; the hash generation of SM3 only took 0.71 μs; the throughput of SM4 was up to 53.76 Gbps. Compared with the SM2 algorithm with the same security, this hybrid system had 26.67% less encryption time. By comparing and analyzing with related work, it can be proved that this scheme has certain advantages in security and encryption and decryption performance. [ABSTRACT FROM AUTHOR]

Format preserving encryption has the characteristics of unchanged data format and data length after encryption, and does not destroy the data format constraints, thereby reducing the cost of modifying the data format. The existing format preserving encryption schemes for sensitive information are based on the symmetric encryption system, which has problems such as low key transmission security and high key management cost. This paper proposes a format preserving encryption scheme for sensitive information in identity cryptosystems. Compared with the existing format preserving encryption schemes, the two parties do not need to transmit a key, and the key derivation function is used to generate an encryption key and a decryption key. The use of hybrid encryption improves the security of sensitive information transmission. It is proved that the scheme satisfies the security of identity-based pseudo-random permutation. At the same time, the scheme has cipher text indistinguishability under adaptive selective plaintext attack. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Image & Graphics is the property of Editorial Office of Journal of Image & Graphics and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Dalian University of Technology / Dalian Ligong Daxue Xuebao is the property of Journal of Dalian University of Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)