Study of relationships between correlation-immunity and balanceness based on Boolean functions by LI Wei-wei

“…E-derivative and derivative were introduced to deeply study internal structure of Boolean function,and analyzed the cryptographic properties of Boolean function,which was a new subject in cryptology.The relationships between correlation-immunity and balanceness was analyzed,and obtain some important results which could not be obtained by analyzing the exterior structure of Boolean function at all.Beyond that,for researching on the correlation immunity of balanced H-Boolean function which play a important role in cryptology,here also give a new research methods to improve the anti-attack ability of cryptosystem.…”
Get full text

Encryption based on reversible cellular automata by PING Ping, ZHOU Yao, ZHANG Hong, LIU Feng-yu

“…Compared with the general irreversible toggle cellular automata cryptosystem,the proposed method greatly improves the speed of encryption and has large keys space,it can resist bruce attack and differ-ential cryptanalysis.…”
Get full text

Two-way and anonymous heterogeneous signcryption scheme between PKI and IBC by Cai-fen WANG, Chao LIU, Ya-hong LI, Shu-fen NIU, Yu-lei ZHANG

“…Exiting heterogeneous signcryption schemes which were between public key infrastructure (PKI) and identity-based cryptosystem (IBC) have some limitations.A new heterogeneous signcryption scheme between PKI and IBC was proposed.In the random oracle mode,the scheme ensured confidentiality and unforgeability on the basis of the assumption of computational Diffie-Hellman problem (CDHP),q-Diffie-Hellman inversion problem (q-DHIP) and bilinear Diffie-Hellman problem (BDHP).Simultaneously,the proposed scheme guaranteed unconnectedness and anonymity of the ciphertext.Compared with other heterogeneous schemes,the scheme achieved two-way signcryption,and it generated parameters without restrict,which was suitable for actual situations.Simulation tests show that proposed scheme is feasible.…”
Get full text

Comparative analysis of integer factorization algorithms by G. Kimsanova, R. Ismailova, R. Sultanov

“…Integer factorization problem, which is used as the basis in many public key cryptosystem, is generally thought to be hard problem even on a modern computers. …”
Get full text

ID-based on-line/off-line threshold signature scheme without bilinear pairing by Xiao-dong YANG, Chun-mei LI, Ting XU, Cai-fen WANG

“…Based on the distributed key generation (DKG) protocol and verifiable secret sharing (VSS) protocol,an identity-based on-line/off-line threshold signature scheme was proposed in order to eliminate the cost of the certificate management in the public key cryptosystem and improve the performance of on-line/off-line threshold signature schemes.This scheme was proven to be robust and unforgeable under the discrete logarithm assumption.Analysis results show that the proposed scheme eliminates the problem of certificate management and pairing operation,and it greatly reduces computation cost of off-line threshold signature generation algorithm and signature verification algorithm.The new scheme is more efficient than the available on-line/off-line threshold signature schemes.…”
Get full text

Certificateless signature scheme without bilinear pairings by Sheng-bao WANG, Wen-hao LIU, Qi XIE

“…To solve the key escrow problem inherited in ID-based cryptography and the complex certificate management problem of traditional certification-based public key cryptosystem,Al-Riyami and Paterson proposed the novel concept of certificateless public key cryptography.Almost all existing certificateless signature schemes need bilinear pairings either during signature generation stage or the signature verification stage,and were proven secure only with stronger computational assumptions.A new certificateless signature scheme without pairings was proposed.The scheme is provably secure in the random oracle model(ROM)under the relatively weaker assumption,i.e.…”
Get full text

Identity authentication scheme based on identity-based encryption by Ren-ji HUANG, Xiao-ping WU, Hong-cheng LI

“…In large-scale communication nodes network,there are a large number of network nodes and so many types of equipment.So there are problems of certificate management difficulties and resource waste in the tradi-tional PKI cryptosystem.A mutual node authentication scheme based on identity-based encryption,which solved the problem of the digital certificate management in the PKI system by the identity-based encryption and the key escrow problem in identity based cryptograph by splitting the key as well,was designed.At the same time,the introduction of random factor,timestamp and hash algorithm in the authentication protocol prevented various network attacks.Finally,the security and efficiency of the encryption algorithm and the security of the authentication protocol were analyzed,which proved the security and reliability of the authentication scheme.…”
Get full text

Algorithm of reducing the balanced H-Boolean function correlation-measure and research on correlative issue by HE Liang, WANG Zhuo, LI Wei-wei

“…Took the derivative and e-derivative of Boolean function as a tool,analyzed the inner structure of balanced H-Boolean functions,clearly obtained the conclusion that the second-order correlation-immune balanced H-Boolean function is not existent,solved the problem that whether there was a second-order correlation-immune balanced H-Boolean function which has not yet proper result.From the rationality of logic and theory,defined the necessity of discussing the generalized correlation-immune of balanced H-Boolean function for the security of cryptosystem.And through the analysis of generalized correlation-immunity and correlation-measure of balanced H-Boolean function,de-rived the algorithms which reduced the balanced H-Boolean function correlation-measure,and while increased the order of correlation-measure.…”
Get full text

Parameter selection of autocorrelation test for block ciphers by FAN Li-min1, FENG Deng-guo1, ZHOU Yong-bin1

“…Autocorrelation test was a statistical test to evaluate the correlation between one sequence and the corresponding non-cyclic left-shifted d bits sequence.It was impractical to adopt all the values of d since its range was often very wide.Three relations between parameters of randomness test were defined firstly.Then the relationships among the subclass D={1,2,m/4,m/2,3m/4,m,2m}of autocorrelation test for block cipher were studied by statistical experiments,where m was block length.The experiments show that the prefer choice of parameter d is m when doing autocorrelation test for block cipher.The method is also available for parameter selection of other randomness test for other types of cryptosystem.…”
Get full text

Accelerated algorithm in attribute-based encryption over cloud environment by Guowei WU, Ning FAN, Laifu WANG, Shuai WANG, Jun SHEN, Huamin JIN

“…Cloud computing provides storage,computing and network services to tenants.Data security and data sharing and access control between tenants are indispensable functions.Attribute-based encryption (ABE) system is a one to many encryption system,which allows users to fine -grained access control on encrypted data according to users’ attributes.This encryption system is very suitable for multi-tenant data sharing overcloud computing environment.However,the existing attribute-based encryption schemes is inefficient,which cannot be applied to practical applications.Two types of ABE and their application scenarios were analyzed,and an acceleration algorithms scheme in attribute encryption cryptosystem was proposed.The experiment can illustrate that the proposed scheme can improve the efficiency of key generation algorithm,encryption algorithm and decryption algorithm.…”
Get full text

Asymmetric proxy re-encryption system achievable for office user to securely sharing outsourcing data of mobile terminal by Wei HAO, Xu-an WANG, Xiao-yuan YANG, Li-qiang WU

“…In order to realize the office users securely share encrypted data of the mobile terminal,an asymmetric cross-cryptosystem proxy re-encryption system is proposed.In this system,mobile terminals who have the limited computing power use relatively simple identity-based encryption system,while the server and office users use more complex identity-based broadcast encryption system.This system is based on the ciphertext conversion mechanism,which enables the simple IBE ciphertext of mobile terminal to be converted into the complex IBBE ciphertext by proxy while the proxy know nothing of the plaintext.The security of this scheme can be reduced to the safety of the IBE and IBBE scheme.Theoretical and experimental analysis indicate that the scheme is useful for the mobile ter-minal to consume less resources to make the fixed users share the data encrypted by mobile terminal,and it is more practical.…”
Get full text

Correlation-immunity study of balanced H-Boolean functions by Wei-wei LI

“…As a novel definition,E-derivative was introduced to study problems that are extremely difficult to handle in the cryptographic system.By using the way of combining derivative with E-derivative and correlation-immunity of H-Boolean functions,the distribution structure of balanced H-Boolean functions were deeply analyzed,and some important results on how to determine whether or not a H-Boolean function has correlation-immunity with the relatively simplified method of distinguishing different structure were also obtained,which are going to play important roles in the field of cryptology and future worldwide applications.Beyond that,the problem of the most higher-order correlation-immunity of H-Boolean function which is also one of the most difficult unsolved problems in cryptology was solved successfully to improve the anti-attack ability of cryptosystem and ensured the secure transmission of secret information on the network effectively .…”
Get full text

An Anonymous Authentication Scheme in VANETs of Smart City Based on Certificateless Group Signature by Yuanpan Zheng, Guangyu Chen, Liguan Guo

“…Based on the certificateless cryptosystem and group signature ideas, this paper proposes a certificateless group signature anonymous authentication scheme for the VANETs of a smart city. …”
Get full text

Research of STR multicast key management protocol based on bilinear pairing in ad hoc network by ZHOU Fu-cai1, XU Jian2, XU Hai-fang1, LIU Ze-chao1

“…STR multicast key management protocol has an optimal cost in computation,communication and storage.But on security property,STR cannot resist active attacks without providing key authentication.By introducing the bilinear pairing cryptosystem and the 3-ary key tree,the improved STR protocol which is called PSTR（bilinear pairing-based STR） was proposed.The key generation process and six basic sub-protocols were included in the protocol.Through proving the bilinear form of PSTR key tree,the security of the PSTR in computation was proved.Finally PSTR were compared with STR through performance analysis,the results of which show that: PSTR is more efficient than STR in the communication cost and the computation cost as well as the storage requirement.Therefore,PSTR is a novel,reliable group key management protocol,and is well-suited for Ad hoc networks.…”
Get full text

Towards cooperation location privacy-preserving group nearest neighbor queries in LBS by Sheng GAO, Jian-feng MA, Qing-song YAO, Cong SUN

“…According to the motion status of a user group, two methods on the basis of this struc-ture, named location random perturbation and threshold secret sharing version of Paillier cryptosystem, were used to se-curely compute the center location of the user group. …”
Get full text

Certificate-based hybrid encryption scheme in the standard model by KANG Li, TANG Xiao-hu, FAN Jia

“…For construction a public cryptosystem that requiring fewer infrastructures than public key infrastructure（PKI）,a certificate-based public-key encryption（CBE） scheme was proposed by Gentry.In CBE scheme,a certification was signed by a third part on an applicant’s public key or identity and sent to the applicant,the applicant saved it and used it as partial private key（decryption key）.A receiver wanted to decrypt a ciphertext,the certification was needed from the third party and his own public-private keys,so CBE combined the best aspects of identity-based encryption（implicit cer-tification） and public key encryption（no escrow）.A new efficient certificate-based hybrid encryption scheme with short public key was proposed,which based on Gentry’s identity-based encryption scheme,the new scheme can be proved re-sistance adaptive chosen ciphertext attack in the standard model（without random oracle）.…”
Get full text

Pre-distribution asymmetric key management scheme for mobile ad hoc networks by Lei HAN, Ji-qiang LIU, Zhen HAN, Xue-ye WEI

“…In order to reduce communication overhead of the asymmetric key management in mobile ad hoc networks,an identity-based pre-distribution asymmetric key management scheme(PAKMS)was presented based on combined public key(CPK)framework,ElGamal public key cryptosystem and key pre-distribution mode.This scheme essentially reduced communication overhead of the asymmetric key management in mobile ad hoc networks by the private key generation (PKG)distributing a subset of master key for every node beforehand and a time-based key update approach.The method that PKG pre-distributed a subset of master key also made the nodes obtain their keys and key update services,which did not need to rely on online PKG.Thus,the inherent key escrow problem existing in identity-based asymmetric key management was avoided to some degree.Compared with typical schemes,this scheme needed much less communication overhead to accomplish node key update service.Furthermore,security proof of the scheme was described in detail.…”
Get full text

An Improved Genetic Algorithm for Developing Deterministic OTP Key Generator by Ashish Jain, Narendra S. Chaudhari

“…Recently, a genetic-based random key generator (GRKG) for the one-time pad (OTP) cryptosystem has been proposed in the literature which has certain limitations. …”
Get full text

Adaptor signature scheme based on ISRSAC digital signature algorithm by Yanshuo ZHANG, Ning LIU, Yuqi YUAN, Yatao YANG

“…The adapter signature scheme can provide good properties of atomic exchange in the block chain, and has been widely used in practice.A new adapter signature scheme was constructed based on a digital signature algorithm for improved security of RSA cryptosystem (ISRSAC).After proving that the proposed scheme satisfied the correctness of the pre-signature, unforgeability, adaptability of the pre-signature, extractability of the evidence and the security of the signature scheme, it was compared with the adapter signature scheme based on the SM2 digital signature algorithm, the Schnorr-based adapter signature scheme and the ECDSA-based adapter signature scheme.And these schemes were analyzed in terms of time overhead and main calculation amount.The analysis results show that the proposed scheme is similar to other schemes in terms of time overhead, but the proposed scheme expands the application scenarios of ISRSAC algorithm in the current environment, and through the combination of ISRSAC algorithm and adapter signature technology, the selection of adapter signature is more flexible and can have a wider range of applications.…”
Get full text

Attribute-based multi-keyword searchable encryption scheme based on counting Bloom filters by Zhidan LI, Yongqun CHEN, Wei WANG

“…To address the problems of low retrieval efficiency of searchable encryption scheme under traditional public key cryptosystem, high storage overhead of keyword index, and index does not support dynamic update, based on the good space and time efficiency of counting Bloom filter to determine whether an element belongs to a certain set, the feature into searchable encryption was applied to establish keyword index, thus, the keyword set was mapped into a binary vector, thereby reducing the keyword storage cost.Simultaneously, the feature of counting Bloom filter can be deleted was used to realize the dynamic update of keyword index.In addition, to prevent adversaries from inferring keyword plaintext information from binary vectors through statistical analysis, the binary vector was blinded by permutation, and then the permutation was encrypted by attribute-based encryption for secret sharing.After legitimate users generated keyword traps correctly, the service provider helped users complete keyword matching queries based on the user’s keyword trapdoor.Finally, the security and efficiency of the scheme were proved through security analysis and simulation experiments.…”
Get full text