Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography by J.‐F. Biasse, X. Bonnetain, E. Kirshanova, A. Schrottenloher, F. Song

“…Abstract In this survey, the authors review the main quantum algorithms for solving the computational problems that serve as hardness assumptions for cryptosystem. To this end, the authors consider both the currently most widely used classically secure cryptosystems, and the most promising candidates for post‐quantum secure cryptosystems. …”
Get full text

A New Countermeasure against Brute-Force Attacks That Use High Performance Computers for Big Data Analysis by Hyun-Ju Jo, Ji Won Yoon

“…However, these technical advancements also allow malicious individuals to obtain high computational power to attack cryptosystems. Traditional cryptosystem countermeasures have been somewhat passive in response to this change, because they simply increase computational costs by increasing key lengths. …”
Get full text

Advantages of Logarithmic Signatures in the Implementation of Crypto Primitives by Yevhen Kotukh, Hennadii Khalimov

“…Quantum-resistant cryptosystems based on lattices and other post-quantum candidates also exploit computationally complex tasks. …”
Get full text

Hybird group key management scheme for wireless sensor networks by CHEN Yan-li1, YANG Geng3

“…Since sensor nodes join or leave the wireless sensor networks frequently,it is necessary to build a secure and efficient group key management system.An efficient and secure group key management scheme was proposed.Private-key cryptosystems are used to encrypt multicast messages and rekey the group when new nodes join the group,while the tech-nology of identity-based broadcast encryption is used to distribute the group key and rekey the group when nodes leave the group.The proposed scheme satisfies the desired security properties,such as forward secrecy,backward secrecy and collusion resistant.Compared with existing group key management schemes in wireless sensor networks,the scheme can efficiently reduce key storage and communication overhead of rekeying messages.As storage overhead and rekeying cost of nodes are not dependent of the scale of networks,the proposed scheme is applicable to wireless sensor networks.…”
Get full text

Provably secure secret sharing scheme based on bilinear maps by LI Hui-xian1, PANG Liao-jun2

“…A method to construct provable secure secret sharing scheme using bilinear pairing was recommended.Firstly,the semantic security definition for secret sharing scheme is given,which is developed from the standard definition of semantic security for the public key cryptosystems.Then,a new secret sharing scheme based on the bilinear maps is pro-posed,with its correctness,security and performance analyzed and proven subsequently.Compared with the existing schemes,the proposed scheme is provably secure.At the same time,the proposed scheme departs the private key compu-tation of participants from the secret distribution process and the dealer does not have to securely save each participant’s private key,which makes this scheme more secure and more efficient.Therefore,the proposed scheme is more applicable than the existing ones.…”
Get full text

Overview of searchable encryption research by Ying LI, Chunguang MA

“…With the development of cloud computing,there is an increasing number of companies and individuals outsourcing their data to cloud server in the encrypted form to protect data security and user privacy.As a result,efficient retrieval of encrypted data stored on cloud server has become the issue that users may pay attention to.Searchable encryption (SE) is a cryptographic primitive that supports keyword search over encrypted data,and migrates the cumbersome search operation to the cloud server to utilize its vast computational resources.Reviews previous research according to the different cryptosystems used,and divides SE into two groups,that is symmetric searchable encryption and asymmetric searchable encryption.Based on this classification,first introduces a typical program,and then introduces from the two aspects of the expression of searchable encryption and security.Finally,the need-to-be-solved problems and main research directions are discussed.…”
Get full text

SviaB: Secure and verifiable multi‐instance iris remote authentication using blockchain by Mahesh Kumar Morampudi, Munaga V. N. K. Prasad, Surya Narayana Raju Undi

“…Abstract Homomorphic encryption (HE) is the most widely explored research area in the construction of privacy‐preserving biometric authentication systems because of its advantages over cancellable biometrics and biometric cryptosystems. However, most of the existing privacy‐preserving biometric authentication systems using HE assume that the server performs computations honestly. …”
Get full text

A lightweight privacy preservation authentication protocol for IoMT using ECC based blind signature by Kalpana Samal, Shanta Kumari Sunanda, Debasish Jena, Srikanta Patnaik

“…Compared with existing protocols that use public cryptosystems, such ElGamal and RSA, the suggested protocol stands out due to its smaller key size and reduced computational overhead. …”
Get full text

Cryptanalysis of Novel Image Encryption Scheme Based on Multiple Chaotic Substitution Boxes by Ammar S. Alanazi, Noor Munir, Majid Khan, Muhammad Asif, Iqtadar Hussain

“…The proposed attacks are successfully performed to retrieve the key with very little execution time by using just one chosen image which indicates the vulnerability of multiple chaotic S-boxes-based cryptosystems. The retrieved data is passed through some statistical analysis such as correlation, histogram, and entropy to check the correctness of recovered data.…”
Get full text

Lattice‐based hash‐and‐sign signatures using approximate trapdoor, revisited by Huiwen Jia, Yupu Hu, Chunming Tang

“…Abstract For the purpose of improving the efficiency of the cryptosystems built upon lattice trapdoors, Chen, Genise and Mukherjee at ASIACRYPT 2019 modified the gadget trapdoor (G‐trapdoor) to an approximate trapdoor, which enables one to sample short preimages approximately from a discrete Gaussian distribution. …”
Get full text

Enhancing the robustness of block ciphers through a graphical S-box evolution scheme for secure multimedia applications by Abdul Razaq, Muhammad Mahboob Ahsan, Hanan Alolaiyan, Musheer Ahmad, Qin Xin

“…In essence, the security of these cryptosystems is contingent upon the quality of the S-box that is implemented. …”
Get full text

Certificate integration management platform based on identity key by Mu-zhou LIU, Jian-shu QIU, Yun-yong ZHANG, Bin-feng YAN, Si-yao ZHANG, Ya-fei TANG

“…Asymmetric key cryptosystem plays an significant role in the field of information security.Compared with tra-ditional public key cryptosystem,the public key crypto system based on identity simplifies certificate management and reduces system communication and storage cost.A management platform and its unique merits were introduced after analyzing the current security schemes and comparing their various advantages and defects.According to the analysis of technical principles and functions,this product has a promising future.…”
Get full text

Efficient and privacy-preserving profile matching protocols in opportunistic networks by Yong-kai LI, Shu-bo LIU, Zhao-huan YANG, Meng-jun LIU

“…In opportunistic networks,users can take the advantage of parallel opportunistic contacts with other mobile users and find the appropriate helpers to forward the messages or share the contents.Most of the existing profile-matching protocols were designed on the basis of homomorphic cryptosystem and were not quite efficient in encryption and decryption.Three efficient and privacy-preserving profile matching protocols were proposed to deal with different privacy requirements in opportunistic networks,which do not use any homomorphic encryption.The proposed protocols were proved to be privacy-preserving and correct.The performances of the protocols are thoroughly analyzed and evaluated via real smartphone experiments,and the results show that the proposed protocols can decrease encryption and decryption time by at least an order of magnitude than the Paillier cryptosystem based protocol.…”
Get full text

Research on password-authenticated key exchange protocol over lattices by Yuanbo GUO, Anqi YIN

“…With the rapid development of quantum computing technology, password-authenticated key exchange (PAKE) protocol based on conventional difficult problems will face serious security threats in the post-quantum era.Lattice-based cryptosystem has been certified by NIST as the most promising cryptosystem in the post-quantum era due to its high efficiency, high security and support for stronger cryptographic service functions (such as fully homomorphic encryption and multi-linear mapping).Firstly, the research progress of lattice-based PAKE protocol was systematically sort out, mainly including the centralized two-party, three-party PAKE protocol and the distributed PAKE protocol over lattices.Then, the relevant typical schemes were compared and analyzed, respectively.Finally, the future research directions PAKE protocol over lattices were prospected.…”
Get full text

Private feasible solution determination by Xue Ge, Jiawei Dou, Wenli Wang, Yingnan Wang

“…In this study, the authors propose a protocol based on elliptic curve cryptosystem for this problem and prove that the protocol is secure in the semi‐honest model. …”
Get full text

Rational-security and fair two-party comparison protocol by Bowen ZHAO, Yao ZHU, Yang XIAO, Qingqi PEI, Xiaoguo LI, Ximeng LIU

“…., Bob) of the comparison result.Obviously, if Alice refused or failed to send the comparison result to Bob, Bob learned nothing about the comparison result, which broke the fairness of the two-party comparison protocol.Based on this, a rational-security and fair two-party comparison protocol TEAM was proposed by seamlessly combining the threshold Paillier cryptosystem and game theory.Specifically, a novel secure two-party comparison protocol based on the threshold Paillier cryptosystem was designed and then searched for equilibrium points at which two parties could obtain comparison results.Strict theoretical analysis demonstrate that TEAM guarantees rational two-party to always obtain the comparison result without sacrificing any of their inputs.In other words, TEAM was correct, secure, and fair.In addition, the experimental results show that TEAM improves up to 50 times in terms of efficiency compared with previous methods under the same experimental settings.…”
Get full text

EPN:encryption padding for NTRU with provable security by MU Ning-bo, HU Yu-pu, WANG Bao-cang

“…Known as the fastest public key cryptosystem available now,the provable security of NTRU has not been solved well.an encryption padding,called EPN was designed,for NTRU.Under the full domain one wayness assumption of NTRU,EPN had been proved indistinguishable from adaptive chosen ciphertext attack by using the Game-Hopping technology in the random oracle model.Compared with present NAEP available,implement efficiency of EPN improves by 25%.…”
Get full text

Cryptanalysis and improvement of a block cryptographic scheme based on logistic map by YANG Ji-yun, LIAO Xiao-feng, XIAO Di, DENG Shao-jiang

“…In order to avoid the flaw, a remedy which makes keystream dependent with plaintext though ciphertext feedback was suggested while keeping all the merits of the original cryptosystem.…”
Get full text

Efficient and secure message authentication scheme for VANET by Li-bing WU, Yong XIE, Yu-bo ZHANG

“…The proposed scheme decreased the complexity of cryptographic operations on signature by using elliptic curve cryptosystem (ECC) to construct authentication protocol without bilinear pairing and provided the function of conditional privacy-preserving. …”
Get full text

Research on Security Algorithm for Crossing Heterogeneous Network Based on Unified Communication Technology by Yingying Chen, Geng Zhang, Mingyue Di, Jie Li, Meilin Dang, Guilan Xing

“…Based on the study of heterogeneous networks through the issues and the status quo on the symmetric key cryptography, asymmetric key cryptosystem in-depth research, an encryption algorithm based on the RSA algorithm and improved DES algorithm was proposed. …”
Get full text