Search

Copyright of Journal of Cryptologic Research (2095-7025) is the property of Editorial Board of Journal of Cryptologic Research 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 Cryptologic Research (2095-7025) is the property of Editorial Board of Journal of Cryptologic Research 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 Cryptologic Research (2095-7025) is the property of Editorial Board of Journal of Cryptologic Research 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 Cryptologic Research (2095-7025) is the property of Editorial Board of Journal of Cryptologic Research 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 Cryptologic Research (2095-7025) is the property of Editorial Board of Journal of Cryptologic Research 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 Chongqing University of Posts & Telecommunications (Natural Science Edition) is the property of Chongqing University of Posts & Telecommunications 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.)

MIBS is a lightweight block cipher proposed by Izadi et al. in 2009, which has two variants: MIBS-64 and MIBS-80. In 2019, Chen et al. performed a key recovery attack on 15-round MIBS-64 based on a 13-round Rectangle distinguisher, and the time, data, and memory complexity (T;D;M) of the attack equal (259; 245; 245). Based on Chen et al.'s attack, this paper further investigates the ability of MIBS-64 to resist Rectangle and Boomerang attacks. By exploiting the fact that differences propagate through a linear layer deterministically, the time complexity of the 15-round Rectangle attack can be reduced from 259 to 247. In order to make a deeper analysis of MIBS, this paper adopts the new key recovery algorithms recently proposed by Song et al. for Boomerang attacks, and then constructs key recovery attacks on 15 and 16 rounds of MIBS whose complexities are (238; 237; 236) and (260; 260; 230) respectively. The results of this paper updates the cryptanalysis results of MIBS-64 under Boomerang and Rectangle attacks, proposes the first 16-round attack on MIBS-64. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Cryptologic Research (2095-7025) is the property of Editorial Board of Journal of Cryptologic Research 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 Cryptologic Research (2095-7025) is the property of Editorial Board of Journal of Cryptologic Research 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.)

Blockchain integrates cryptography, distributed consensus, P2P networking, and timestamping technologies, which can achieve functions such as consistent data storage, tamper resistance, and non-repudiation, solving the trust issue in open networks that do not rely on any trusted third parties. The decentralized nature of blockchain gives it a broad range of application prospects. However, as the applications become more extensive and profound, the scalability issue has become a key challenge for unlocking the full potential of blockchain technology. Blockchain is essentially still a distributed system. Based on this, this paper reviewed the research work on blockchain from the perspective of the scalability of distributed systems. It discussed the ideas and methods for blockchain scalability from three aspects: on-chain scalability, off-chain scalability, and cross-chain scalability. Then it summarized the research achievements in recent years. Building on the summary and analysis of existing solutions, this paper explored the challenges faced in improving blockchain scalability and discussed future research trends in this area. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Cryptologic Research (2095-7025) is the property of Editorial Board of Journal of Cryptologic Research 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 Cryptologic Research (2095-7025) is the property of Editorial Board of Journal of Cryptologic Research 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 Cryptologic Research (2095-7025) is the property of Editorial Board of Journal of Cryptologic Research 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 Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. 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.)

Both PFP and SLIM are ultra-lightweight block ciphers having Feistel structure, which have good performance both in software and hardware, especially in resource-constrained environments. So far, the integral analysis of the PFP cipher and SLIM cipher has not yet been conducted thoroughly. In this paper, a mixed integer linear programming (MILP) model is constructed by analyzing the structural characteristics of PFP cipher and SLIM cipher, and combining with the automatic search method of bit division property. The Gurobi optimizer is used to establish the model to determine whether there is an r-round integral distinguisher, and the integral distinguisher is selected to carry out key recovery attack on the cipher. The results show that a 11-round integral distinguisher of the PFP cipher is found, and a 12-round key recovery attack is carried out by using 10-round integral distinguisher to extend 2 rounds backward. The data complexity is 262:39 chosen plaintext, time complexity is 263:12 of 12round encryption, and storage complexity is 240. A 10-round integral distinguisher of SLIM cipher is also found, and a 9-round integral distinguisher is selected to carry out 12-round key recovery attack. The data complexity is 231:81 of chosen plaintext, the time complexity is 262:42 of 12-round encryption, and the storage complexity is 240. [ABSTRACT FROM AUTHOR]

The AES is one of the most widely used block ciphers in the world, the 3D block cipher is a 3-dimensional AES-like cipher proposed at CANS 2008, and the TANGRAM block cipher is an awardwinning algorithm of the recent National Cryptographic Algorithm Design Competition in China. The yoyo tricks is a powerful cryptanalysis technique based on zero difference, and its main idea is based on whether a plaintext pair and a pair generated by this plaintext pair share the same property after several rounds of encryption. This paper uses yoyo tricks to make an attack on 6-round AES with restricted ciphertexts, reducing the best previously published time complexity by 25:6 in the context of yoyo tricks. Second, the yoyo tricks are extended to n-tuple (n ≥ 3) and relations between the yoyo tricks and related differentials are established, more specifically, the related differentials can be represented by yoyo tricks, and 3-tuple yoyo tricks are used to launch a key recovery attack on 11-round 3D. Finally, the early abort technique is used to the exchange attack, where 2126 chosen plaintexts are used to make a distinguishing attack on 25-round TANGRAM with a 128-bit block size (denoted as TANGRAM-128), which is the first 25-round distinguisher for TANGRAM-128. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Advanced Technology & Management is the property of National Central University, Research Center for Advanced Science & 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.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. 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 Chongqing University of Posts & Telecommunications (Natural Science Edition) is the property of Chongqing University of Posts & Telecommunications 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 Chongqing University of Posts & Telecommunications (Natural Science Edition) is the property of Chongqing University of Posts & Telecommunications 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.)

At present, the steganographic capacity of deep learning-based steganographic models has been improved, but due to the complexity of the network structure, it requires a lot of time to train. Aiming at this problem, this paper proposed a lightweight invertible neural network structure and used to design an efficient image steganography scheme, which adopted a dense connection-based invertible neural network to achieve image hiding and recovery, and increased the number of convolutional blocks of invertible functions f()r() andy() in each invertible block to ensure the quality of the image while reducing the number of invertible blocks. It could significantly reduce the computational and storage overheads, making the model run more efficiently on devices with limited computational resources, making the process of model development and iteration more efficient, and effectively saving valuable computational resources. It transformed the cover and the secret image by forward hidden invertible transform to generate the stego image, and transformed the stego image and the random variable by reversing recovery invertible transform to get the recovered image. The experimental results show that compared with HiNet algorithm, the proposed lightweight network structure can achieve good image quality and security, while reducing the training time by 46% and the steganography time by 28%. [ABSTRACT FROM AUTHOR]

Copyright of Application Research of Computers / Jisuanji Yingyong Yanjiu is the property of Application Research of Computers Edition 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.)

CRAFT is a lightweight tweakable block cipher proposed in FSE 2019, which is suitable for the resource-constrained equipment with the small hardware area to protect information security. It adopts the128 bit key and 64 bit tweak to encrypt a 64 bit plaintext. The evaluation of its safety can provide a theoretical basis for future use. The paper researched the structural properties of CRAFT and the redundancy of its key schedule, and chose a 13-round impossible differential of CRAFT, which made full use of the linear relations of round subkeys. Appended three rounds and five rounds at its top and bottom, this paper proposed a 21-round impossible differential, which applied some techniques such as the precomputation tables, the differential enumeration and the key-dependent property. The time, data and memory complexities of the attack were 296.74 encryptions, 253.6 chosen plaintexts and 256.6 64 bit blocks, respectively. This impossible differential attack on reduced-round CRAFT was the lowest time complexity attack under the single-key and single-tweak model. This method relied on the linear correlation of the handle value tweakey schedule, which was helpful to further understand the design of CRAFT. [ABSTRACT FROM AUTHOR]

National standard for commercial cryptography named SM2 is a public key cryptosystem based on elliptic curve cryptography. In the process of software implementation, it may face the risk of sensitive data leakage through side channels. In order to improve the security of SM2 algorithm in practical applications, this paper analyzed the security of SM2 software implementation, which was based on multiprecision integer and rational arithmetic cryptographic library (MIRACL), using cache timing attack method. A selection strategy of monitoring addresses could avoid the mistakes caused by cache line size, temporal precision and data prefetching technology as much as possible. This paper also modified constant-time countermeasures according to leakage points. Experiments show that the constant-time scalar multiplication function can protect the sensitive data in SM2 much better than MIRACL scalar multiplication function, under the same cache timing attack conditions. It concludes that the SM2 algorithm based on MIRACL library needs to adopt necessary countermeasures to obtain security against cache timing attacks. [ABSTRACT FROM AUTHOR]

In the Internet of Things, the development and application of cloud storage technology reduce the storage and management overhead of user data and realize resource sharing. To protect privacy of users, this paper proposed a searchable encryption scheme with denial-authentication property. The sender encrypted the original data and uploaded the ciphertext, while the receiver couldn't prove the source of the data to a third party during the confirmation phase, ensuring data security. Compared with the single design based on identity authentication, the proposed scheme used certificateless cryptography technology to solve the disadvantages of the traditional scheme in the key escrow and key revocation stage, and also realized deniable encryption in the dense state search. Finally, it analyzed the security of the proposed scheme strictly. Experimental results show that the scheme can complete the searchable encryption task well. [ABSTRACT FROM AUTHOR]

Vehicular Ad hoc network (VANET) can significantly improve traffic safety, but security and privacy issues must be addressed before their deployment. This paper proposed an efficient certificateless authentication scheme with batch verification for VANET, which was free from the key escrow problem existing in the ID-based authentication schemes. The bilinear pairing was one of the most time-consuming operation in modern cryptography, which didn't involve in the proposed scheme to decrease the computational overhead . The system private key didn' t preloaded in the tamper-proof devices ( TPD), which reduced the dependence of the security on the TPD. This paper adopted batch authentication algorithm to improve the authentication efficiency. The proposed scheme is provable security in the random oracle model. Moreover, the proposed scheme yields a better performance in terms of computation cost and communication cost, making it more suitable for deployment in the VANET environment. [ABSTRACT FROM AUTHOR]

The Boolean functions are cryptographic functions that have been widely used in the fields of cryptography, error correction coding, and spread spectrum communication. Finding good performance Boolean functions has always been one of the important issues in the field of cryptography. Based on the gravitational search algorithm, this paper designed a new algorithm for searching Boolean functions. This algorithm imitated the law of universal gravitation, used the mass points in n-dimensional space to represent the Boolean function, and used the cryptographic characteristics of the Boolean function as the target fitness function for searching. The experimental results show that by changing the newly designed target fitness function, a balanced Boolean can be directly generated that meets a variety of cryptographic indicators such as 1-order resilient, 1-order propagation, or high non-linearity, high algebraic number, and low auto correlation index function. Further more, this paper implemented a computer search algorithm that directly generated a 2-output balanced Boolean function. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Data Acquisition & Processing / Shu Ju Cai Ji Yu Chu Li is the property of Editorial Department of Journal of Nanjing University of Aeronautics & Astronautics 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 South China University of Technology (Natural Science Edition) is the property of South China 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.)

The existing lattice-based key exchange protocols generally base on the single-stage security models like Bellare-Rogaway, which ignoring the stage separation of session key’s construction in secure communication. In order to solve this problem, this paper proposed a lattice-based multi-stage authenticated key exchange protocol based on MSKE model. The scheme used pre-shared password for authentication, and the construction of multi-stage key exchange adopted the Peikert error-reconciliation mechanism and the server’s static key. The security analysis shows that the protocol only introduces a small computing overhead, allow the mutual authentication, two-stage perfect forward-secrecy, and resists quantum attack. This protocol meets the KD-2 FS-M security level under MSKE model. It is a simple and efficient post-quantum multi-stage key exchange protocol. [ABSTRACT FROM AUTHOR]

In comparison with the former ZUC, this paper adopted a different way of design in initialization and the generation of MAC in ZUC-256 algorithm, and significantly promoted the cryptographic performance. In order to implement the algorithm by software in optimized and efficient way, this paper introduced the general structure and workflow of the algorithm in the first, and then implemented the basic functions of the algorithm by programming referring to the original algorithm. Furthermore, taking into consideration the transfer execution process of the array parameter in programming function together with the computational characteristics of the algorithm itself, this paper analyzed the factors affecting the execution efficiency of the program, and then promoted basic function program previously completed. After the actual programming test, the effectiveness of the two optimization methods is verified. In general, in two different software running reference machine environments, the optimized code execution efficiency combined with the two optimization schemes is improved 8% ~ 9% and 18% ~ 36% higher than that of the basic function implementation code respectively. It has practical significance for the future application of ZUC-256 cryptography in software engineering. [ABSTRACT FROM AUTHOR]

Aiming at the weak correlation between video steganography algorithm based on histogram translation and video content, this paper proposed a multiple histogram modification H. 264 video steganography algorithm based on motion vector. The algorithm designs correction parameters by counting the speed characteristics of macroblock movement and the sensitivity of dispersion to human vision in a specific frame, then designs multiple two-dimensional histograms according to the correction parameters, and finally embeds information in a non-specific frame through the two-dimensional histogram modification algorithm. The experimental results show that compared with the same type of video steganography algorithm, the embedding capacity is increased by 8.2% on average. When fully embedded, the change values of PSNR and SSIM of the algorithm are reduced by 19.9% and 17.5% respectively. The algorithm has better embedding capacity and imperceptibility while maintaining a low bit rate change. [ABSTRACT FROM AUTHOR]

In order to resist the attack of quantum algorithm and deal with the defect that malicious signers can output multiple signatures using the complete anonymity of ring signature technology to carry out double overhead attack, and to solve the unnecessary waste of system overhead, this paper proposed a new identity-based linkable ring signature scheme form lattice. The scheme takes the approximate shortest vector problem on the lattice as the security basis, reduces the solution of the problem to the solution of the collision problem, generates the signature by using the linear operation between matrix vectors, and combines the identity-based cryptography technology. It solved the problem of system overhead waste, does not involve complex algorithms such as trapdoor generation and Gaussian sampling, improves the signature efficiency and reduces the storage overhead. It is verified that the scheme meets the requirements of complete anonymity and strong unforgeability under the random oracle model. After analysis, the scheme is a secure and efficient ring signature scheme. [ABSTRACT FROM AUTHOR]

Copyright of China Sciencepaper is the property of China Sciencepaper 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.)

This paper proposed a new reversible robust steganography method in H.264/AVC. This paper first distributed the embedded secret data by a specific polynomial and obtain a series of sub-secrets. Then it used the BCH code to encode each group of the sub-secrets and embed the encoded sub-secrets into each frame of the video with prediction mode. And it recovered the hidden data by using the encoded / sub-secrets of the video frames. The experiment results shown that the method can recover the original video completely and has the high bit error and frame error robustness. When the random frame rate is less than or equal to 15% , the method can recover the secret data completely. In addition, the method can avoid intra-frame distortion drift and has better visual concealment. [ABSTRACT FROM AUTHOR]

In order to further enhance the practicability of image steganalysis, this paper expands the research goal of image steganalysis as steganography location of adaptive steganography and non-adaptive steganography LSB matching, an end-to-end steganography localization network PSL_NET is proposed. Input an image at the input end, and locate the position of the steganographic pixel of the image at the output end. In the preprocessing layer, the high-pass filter of the spatial rich model is used to extract the residual noise images. In the depth residual layer, deep residual learning is used to enhance the expression ability of steganographic features. In the pixel prediction layer, using the mask image which marks the actual position of the steganographic pixel to perform supervised learning, as well as treating the pixels in the smooth or texture area without distinction, the probability whether each pixel is steganographic pixels is predicted, and finally predict the steganographic pixels of the input image. The imbalance problem of positive and negative samples are solved from the perspective of objective function to improve the detection accuracy. In the experiment based on BOSSbase v1.01, when the network predicts the steganographic image of the adaptive steganography algorithm S-UNIWARD at the payload of 0.4 BPP, the pixel detection accuracy is 0.981 74, and the experiments also verify the network can detect the steganographic image embedded by non-content adaptive steganography LSB matching. [ABSTRACT FROM AUTHOR]

In view of the potential privacy leakage risk of air travel consumption, this paper proposed a supervisable privacy-preservation cryptography scheme. It guaranteed security for the transaction among airlines, group customers and business passengers. By adding an additional recipient's public key to the transaction ciphertext, the dual recipients could independently decrypt and obtain the same transaction information. The scheme ensured that the supervisor as the additional recipient could review the real transaction amount between the airline and the group customer. By designing the homomorphic encryption algorithm, the ciphertext transaction data in circulation could be analyzed normally, and the hidden trans action amount could be guaranteed by the zero-knowledge proof protocol. The experimental analysis shows that the scheme adds one more recipient without increasing the computational complexity. Not only the scheme increases the supervision function of the air transaction system, but also solves the internal conflicts between privacy-preservation and accurate audit faced by air business transaction. [ABSTRACT FROM AUTHOR]

This paper proposed a bit-plane encryption algorithm using noise adaptive embedding for noisy images such as radar and remote sensing images. Firstly, the algorithm adaptively found the best embedding threshold in different noisy images using genetic algorithm, and used an encryption algorithm that did not require a secret key at higher noise values to cross-embed two pieces of secret information into the first and in the three-dimensional plane. Then it used the BBE algorithm to compress the flag bit data to the second bit plane. Finally, it used the same encryption algorithm to embed the remaining secret information into the second and fourth bit planes to complete information hiding at the second bit plane redundancy. Experimental analysis shows that under the condition of satisfying high-capacity embedding, compared with other adaptive bit-plane steganography algorithms, it has better concealment and stronger robustness, and at the same time, it can resist the current better steganalysis algorithms to ensure security of data transmission. [ABSTRACT FROM AUTHOR]

In view of the high computational cost of the existing certificateless blind signature schemes, this paper proposed an efficient certificateless blind signature scheme based on SM2, which did not require bilinear pairing operation. Based on the difficulty of the elliptic curve discrete logarithm problem (ECDLP), it was analyzed formally and found to be provably secure against both the Type-I and Type-II attacks. Compared with the existing certificateless blind signature schemes, the performance analysis show that the computing cost of the proposed certificateless blind signature scheme is far less than other similar schemes. [ABSTRACT FROM AUTHOR]

Most of the current video steganography algorithms do not meet the Kerckhoffs criterion. Based on the game theory steganography model, this paper proposed a new H.264 video steganography algorithm based on motion vector modification. The algorithm calculated the distortion cost function according to the different sensitivity of human visual characteristics to the direction and speed characteristics of the motion vector, and then obtained the embedding probability of each motion vector according to the game theory and the distortion cost function, and realized a video steganography algorithm which met the Kerckhoffs criterion in theory. Experimental results show that, compared with the same type of video steganography algorithms, the change values of PSNR and SSIM of this algorithm are reduced by 18.9% and 5.9% respectively when it is fully embedded. This algorithm has better security and imperceptibility. [ABSTRACT FROM AUTHOR]

Pyjamask is the second-round candidate for the NIST lightweight cryptography selection. In order to use it in the practical system safely, it is very important to analysis its security against the popular attacks. This paper studied the security of Pyjamask against impossible differential cryptanalysis. Specifically, it constructed several 2.5 rounds of impossible differentials and studied their structures’ properties and the attacking efficiency. By appending one round at the top and half a round at the bottom of some effective impossible differentials, it proposed two 4-round multiple impossible differential attacking paths. The results show that Pyjamask can resist against impossible differential cryptanalysis effectively because it has a very powerful diffuse operation MixRows. Meanwhile, these results are important supplements for the security of Pyjamask. [ABSTRACT FROM AUTHOR]

To further explore the characteristics of the steganographic noise signal in the adaptive JPEG steganographic images, this paper proposed a noise-aware residual network for JPEG image steganalysis. The proposed network included three components, noise-aware component, noise analysis component and judgement component. First, noise-aware component extracted the noise of an image, it used denoising network to offer more comprehensive information related to steganography. Then, noise analysis component got discriminative features from image noise related information. Last,judgement network gave the final detection result. Moreover, residual connections integrated high-level features and low-level features and prevented gradient vanishing and exploding. Experiments under various conditions show that the network has an advanced performance, and has better generalization ability. [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]

Copyright of Journal of Liaoning Technical University (Natural Science Edition) / Liaoning Gongcheng Jishu Daxue Xuebao (Ziran Kexue Ban) is the property of Journal of Liaoning Technical University (Natural Science) Editorial Department 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.)

The authentication scheme based on smart card is an efficient and commonly used authentication mechanism, but most of the existing schemes whose security depends on the number theoretical hard problem cannot resist quantum attacks and malicious card reader attacks. This paper proposed a novel password authentication scheme from lattices, which utilized an approximate smooth projective hash function and a splitable public-key encryption scheme in the lattice-based cryptosystem. It completed identity authentication and secure session key agreement between the server and user by password and smart card. The scheme satisfied the theoretical provably security in random oracle model. It had high reliability in resisting quantum at-tacks, malicious card reader attacks and other types of attacks. Simulation experiments show that the proposed scheme has high execution efficiency and meets the requirements of practical application. [ABSTRACT FROM AUTHOR]

In traditional cover selection image steganography, the relationship between image and secret information needs to be constructed manually, and the robustness is not strong. In response to this problem, this paper proposed a cover selection image steganography algorithm. This algorithm combined the idea of image retrieval, used the discriminator of StarGAN as the feature extractor, mapped the extracted features into secret messages, and directly constructed the relationship between image and secret messages. In order to automatically update the mapping relationship database, this solution used feature update, searching image update and other methods to update the relationship database. Experiments show that this scheme has a higher steganography capacity and better robustness. When the image quality is not high, the extraction accuracy is about 6% higher than the existing methods. [ABSTRACT FROM AUTHOR]

In post-quantum cryptography, there are security flaws in the key exchange protocol that are easy to lose passwords and difficult to achieve mutual authentication. This paper proposed a new biometric authentication key exchange protocol based on ring learning with error. The constructed cryptosystem according to the RLWE problem had the advantages of short key and ciphertext size, and high operational efficiency. It used biometrics and passwords as long-term keys. The Peikert error coordination mechanism extracted random and uniform session keys from their respective ring elements, which realized explicit authentication of servers to customers. The performance analysis results show that the scheme can resist user fake attacks, have higher security attributes and improve communication efficiency. [ABSTRACT FROM AUTHOR]

Aiming to the weakness of resisting universal blind detection for traditional steganographies, this paper proposed an adaptive steganographic algorithm for JPEG images based on co-occurrence matrix feature. According to the analysis of histogram and blocking effect features extracted from image, this paper designed a distortion function by using correlation of interblock coefficients which could reflects co-occurrence matrix feature. And then completed embedding based on syndrome trellis codes (STC). Faced with three universal blind detections, experimental results demonstrate the superior performance of the proposed ternary embedding method in terms of security and adaptability of resisting various steganalyzers. [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]

GIFT is a lightweight block cipher with high efficiency and low power consumption. There are few research results to evaluate its security. This paper presented the balanced Biclique and Star attacks on GIFT- 64 based on the Biclique attack method, combined with the information leakage of the key scheduling and the round function structure of GIFT- 64. The data complexity and computational complexity required for the balanced Biclique attack of GIFT-64 are 232 and 2127.36 respectively. The data complexity and computational complexity required for the Star attack of GIFT-64 are 2 and 2127.48 respectively. These are the first security analysis for the full-round GIFT-64. [ABSTRACT FROM AUTHOR]