Search

This paper proposes a searchable encryption model for graph data to address the problem that most of the current searchable encryption schemes cannot deal with complex data structures. The algorithms and security models of the scheme are described. Taking the encryption index of matrix structure into account， the detailed description of the searchable encryption scheme for graph data that supports adjacency queries is presented. The scheme utilizes pseudo-random functions and pseudo-random permutations to protect the privacy of the graph data and the encrypted index. Real models and ideal models test the security of the scheme. Compared with traditional searchable encryption schemes， the proposed scheme has more flexible searching ability and higher efficiency， which promotes broader application under big data environment. [ABSTRACT FROM AUTHOR]

Timed-release encryption( TRE) is a cryptography that studies the problem of sending information into the future,it can solve many practical problems to construct a feasible and safe TRE. This paper proposed a scheme based on the research of indistinguishability obfuscation and TRE. This scheme encapsulated the sender’s encryption and receiver’s decryption by a circuit and obfuscated this circuit by an indistinguishability obfuscator. It could make great use of the time of obfuscators obfuscate circuits,simplified the scheme and improved the security of this scheme. Finally,this paper proves the correctness and security of this TRE scheme. [ABSTRACT FROM AUTHOR]

Aiming at the problem of high complexity of image encryption algorithm at present, a new wavelet domain block encryption method was proposed. First, the algorithm decomposed the original image into multiple different resolution images using DWT(discrete wavelet transform), and the low-frequency coefficients of the image were scrambled by the hyperchaotic system. After IDWT(inverse discrete wavelet transform), bitwise XOR was performed on the reconstructured image with a sequence generated using hyperchaostic system. The experimental results verified that the grey information of the original image was hidden, this encrypting method had a large space of keys and high safety performance; and the scrambled image had good performance of the resisting statistic attack and differential cryptanalysis. [ABSTRACT FROM AUTHOR]

The key encryption methods can't guarantee the key distribution security. To overcome the above limitations, this paper proposed an encryption scheme over fading channels based on independency of channel phase response. Firstly, the paper divided the channel between the sender and the eavesdropper into the cascade of the two channeled, and calculated the key security capacity. Secondly, the paper discussed the discrete source PSK encryption parameters. Finally, the legitimate users could guarantee the system security. Simulation results show that, the error rate is rapidly increased to 0.5 with the estimation error of the received signal phase is 0.001. [ABSTRACT FROM AUTHOR]

Using RSA encryption algorithm and symmetric encryption algorithm, the hierarchical encryption algorithm for different levels of information of digital library was proposed. In this algorithm, the core information (first level information) was encrypted and decrypted using RSA, and the inside information (second level information) was encrypted and decrypted using RSA and symmetric algorithm. The first level manager could decrypt the first level information and the second level information, but the second level manager could only decrypt the second level information. None but the first level manager or the second level manager could decrypt. This kind of hierarchical management could not only satisfy the security requirements for different users of digital library, but also facilitate the hierarchical management of different levels of information for digital library. The hierarchical encryption scheme had the availability and effectiveness. [ABSTRACT FROM AUTHOR]