期刊文献+
共找到11篇文章
< 1 >
每页显示 20 50 100
A NEW PUBLIC-KEY ENCRYPTION SCHEME BASED ON LUCAS SEQUENCE 被引量:2
1
作者 Jiang Zhengtao Hao Yanhua Wang Yumin 《Journal of Electronics(China)》 2005年第5期490-497,共8页
Investigated the properties of LUCas sequence(LUC), the paper proposed a new variant of (probabilistic) public-key encryption scheme. Security analysis of the proposed encryption schemes shows that its one-wayness is ... Investigated the properties of LUCas sequence(LUC), the paper proposed a new variant of (probabilistic) public-key encryption scheme. Security analysis of the proposed encryption schemes shows that its one-wayness is equivalent to partial LUC discrete logarithm problem in ZN, and for the proposed probabilistic encryption scheme, its semantic security is equivalent to decisional LUC Diffie-Hellman problem in ZN. At last, the efficiency of the proposed schemes is briefly analyzed. 展开更多
关键词 Probabilistic public-key encryption scheme LUCas sequence(LUC) Discrete logarithm Integer factorization
在线阅读 下载PDF
A New Forward-Secure Authenticated Encryption Scheme with Message Linkages 被引量:1
2
作者 LI Yanping SI Guangdong WANG Yumin 《Wuhan University Journal of Natural Sciences》 CAS 2006年第6期1537-1540,共4页
Yoon and Yoo recently proposed a robust authenticated encryption scheme and claimed their scheme has the properties of forward secrecy and confidentiality. The current paper, however, points out that Yoon-Yoo's schem... Yoon and Yoo recently proposed a robust authenticated encryption scheme and claimed their scheme has the properties of forward secrecy and confidentiality. The current paper, however, points out that Yoon-Yoo's scheme also can not provide forward secrecy and confidentiality such that any adversary can easily recover the transferred message. Based on intractability of reversing the one-way hash function and discrete logarithm problem, an improved authenticated encryption scheme with messages linkage is proposed. The above security faults get solved perfectly. The new scheme is proven to satisfy all the basic security requirements of the authenticated encryption scheme. And by the concrete comparison, it has the similar efficiency of the original scheme. 展开更多
关键词 authenticated encryption scheme NON-REPUDIATION forward security
在线阅读 下载PDF
New chaos-based encryption scheme for digital sequence
3
作者 Zhang Zhengwei Fan Yangyu Zeng Li 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2007年第4期698-703,709,共7页
To enhance the anti-breaking performance of privacy information, this article proposes a new encryption method utilizing the leaping peculiarity of the periodic orbits of chaos systems. This method maps the secret seq... To enhance the anti-breaking performance of privacy information, this article proposes a new encryption method utilizing the leaping peculiarity of the periodic orbits of chaos systems. This method maps the secret sequence to several chaos periodic orbits, and a short sequence obtained by evolving the system parameters of the periodic orbits in another nonlinear system will be the key to reconstruct these periodic orbits. In the decryption end, the shadowing method of chaos trajectory based on the modified Newton-Raphson algorithm is adopted to restore these system parameters. Through deciding which orbit each pair coordinate falls on, the original digital sequence can be decrypted. 展开更多
关键词 encryption scheme LPO (leaping periodic orbits) chaos initial conditions parameter estimation nonlinear system
在线阅读 下载PDF
An Authenticated Identity-Based Key Establishment and Encryption Scheme for Wireless Sensor Networks 被引量:8
4
作者 CHENG Hong-bing YANG Geng +1 位作者 WANG Jiang-tao HUANG Xiao 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2006年第2期31-38,共8页
Security of wireless sensor networks has received considerable attention. It is a critical challenge to find out suitable encryption schemes for wireless sensor networks due to limitations of power, computation capabi... Security of wireless sensor networks has received considerable attention. It is a critical challenge to find out suitable encryption schemes for wireless sensor networks due to limitations of power, computation capability and storage resources of these networks. Many encryption schemes based on asymmetric and symmetric have been investigated. In this paper, we present an authenticated identity-based key encryption scheme for wireless sensor networks. We first review briefly about identity-based encryption and decryption, particularly, the Boneh-Franklin algorithms, then describe an authenticated identity-based key encryption scheme based on Boneh-Franklin algorithms, and finally show the integrity of our scheme and discuss its efficiency and security by comparing it with other asymmetric and symmetric encryption schemes. 展开更多
关键词 identity-based encryption scheme network security boneh-franklin algorithms wireless sensor network
原文传递
Efficient hierarchical identity based encryption scheme in the standard model over lattices 被引量:2
5
作者 Feng-he WANG Chun-xiao WANG Zhen-hua LIU 《Frontiers of Information Technology & Electronic Engineering》 SCIE EI CSCD 2016年第8期781-791,共11页
Using lattice basis delegation in a fixed dimension, we propose an efficient lattice-based hierarchical identity based encryption(HIBE) scheme in the standard model whose public key size is only(dm^2+ mn) log q b... Using lattice basis delegation in a fixed dimension, we propose an efficient lattice-based hierarchical identity based encryption(HIBE) scheme in the standard model whose public key size is only(dm^2+ mn) log q bits and whose message-ciphertext expansion factor is only log q, where d is the maximum hierarchical depth and(n, m, q)are public parameters. In our construction, a novel public key assignment rule is used to averagely assign one random and public matrix to two identity bits, which implies that d random public matrices are enough to build the proposed HIBE scheme in the standard model, compared with the case in which 2d such public matrices are needed in the scheme proposed at Crypto 2010 whose public key size is(2dm^2+ mn + m) log q. To reduce the message-ciphertext expansion factor of the proposed scheme to log q, the encryption algorithm of this scheme is built based on Gentry's encryption scheme, by which m^2 bits of plaintext are encrypted into m^2 log q bits of ciphertext by a one time encryption operation. Hence, the presented scheme has some advantages with respect to not only the public key size but also the message-ciphertext expansion factor. Based on the hardness of the learning with errors problem, we demonstrate that the scheme is secure under selective identity and chosen plaintext attacks. 展开更多
关键词 Hierarchical identity based encryption scheme Lattice-based cryptography Standard model Learning with errors problem GAUSSIAN
原文传递
A NEW THRESHOLD AUTHENTICATED ENCRYPTION SCHEME USING LABOR-DIVISION SIGNATURE
6
作者 Zuowen TAN 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2010年第6期1183-1194,共12页
This paper shows several security weaknesses of a threshold authenticated encryption scheme. A new threshold authenticated encryption scheme using labor-division signature is proposed without redundancy added to messa... This paper shows several security weaknesses of a threshold authenticated encryption scheme. A new threshold authenticated encryption scheme using labor-division signature is proposed without redundancy added to message blocks. On the assumptions of EDDH problems, the proposed scheme is secure against chosen-ciphertext attacks and existentially unforgeable against the chosen- message attacks in the random oracle model. 展开更多
关键词 Authenticated encryption scheme public key cryptography threshold signature.
原文传递
Timing and hamming weight attacks on minimal cost encryption scheme
7
作者 YUAN Zheng WANG Wei +1 位作者 ZHANG Hua WEN Qiao-yan 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2009年第1期81-85,共5页
The timing and Hamming weight attacks on the data encryption standard (DES) cryptosystem for minimal cost encryption scheme is presented in this article. In the attack, timing information on encryption processing is... The timing and Hamming weight attacks on the data encryption standard (DES) cryptosystem for minimal cost encryption scheme is presented in this article. In the attack, timing information on encryption processing is used to select and collect effective plaintexts for attack. Then the collected plaintexts are utilized to infer the expanded key differences of the secret key, from which most bits of the expanded secret key are recovered. The remaining bits of the expanded secret key are deduced by the correlations between Hamming weight values of the input of the S-boxes in the first-round. Finally, from the linear relation of the encryption time and the secret key's Hamming weight, the entire 56 bits of the secret key are thoroughly recovered. Using the attack, the minimal cost encryption scheme can be broken with 2^23 known plaintexts and about 2^21 calculations at a success rate a 〉 99%. The attack has lower computing complexity, and the method is more effective than other previous methods. 展开更多
关键词 timing and hamming weight attacks DES minimal cost encryption scheme digital right management (DRM)
原文传递
A Note on a Provable Secure Encryption Scheme
8
作者 王明强 秦静 《Journal of Shanghai Jiaotong university(Science)》 EI 2008年第6期655-658,共4页
A Cramer-Shoup scheme was modified in a variant way. The major advantage with respect to Kurosawa-Desmedt scheme is that it saves a key parameter and produces shorter ciphertext. The proof of security shows that our s... A Cramer-Shoup scheme was modified in a variant way. The major advantage with respect to Kurosawa-Desmedt scheme is that it saves a key parameter and produces shorter ciphertext. The proof of security shows that our scheme can be instantiated with any computational secure key derivation and message authentication functions. Thus it extends the applicability of the Kurosawa-Desmedt scheme and improves its efficiency. 展开更多
关键词 hybrid encryption scheme chosen-ciphertext attack authentication function
原文传递
A Method of Homomorphic Encryption 被引量:8
9
作者 XIANG Guang-li CHEN Xin-meng +1 位作者 ZHU Ping MA Jie 《Wuhan University Journal of Natural Sciences》 CAS 2006年第1期181-184,共4页
The existing homomorphie eneryption scheme is based on ring of the integer, and the possible operators are restricted to addition and multiplication only. In this paper, a new operation is defined Similar Modul. Base ... The existing homomorphie eneryption scheme is based on ring of the integer, and the possible operators are restricted to addition and multiplication only. In this paper, a new operation is defined Similar Modul. Base on the Similar Modul, the number sets of the homomorphic encryption scheme is extended to real number, and the possible operators are extended to addition, subtraction, multiplication and division. Our new approach provides a practical ways of implementation because of the extension of the operators and the number sets. 展开更多
关键词 SECURITY private homomorphism similar modul homomorphic encryption scheme
在线阅读 下载PDF
Cryptographic Based Secure Model on Dataset for Deep Learning Algorithms
10
作者 Muhammad Tayyab Mohsen Marjani +3 位作者 N.Z.Jhanjhi Ibrahim Abaker Targio Hashim Abdulwahab Ali Almazroi Abdulaleem Ali Almazroi 《Computers, Materials & Continua》 SCIE EI 2021年第10期1183-1200,共18页
Deep learning(DL)algorithms have been widely used in various security applications to enhance the performances of decision-based models.Malicious data added by an attacker can cause several security and privacy proble... Deep learning(DL)algorithms have been widely used in various security applications to enhance the performances of decision-based models.Malicious data added by an attacker can cause several security and privacy problems in the operation of DL models.The two most common active attacks are poisoning and evasion attacks,which can cause various problems,including wrong prediction and misclassification of decision-based models.Therefore,to design an efficient DL model,it is crucial to mitigate these attacks.In this regard,this study proposes a secure neural network(NN)model that provides data security during model training and testing phases.The main idea is to use cryptographic functions,such as hash function(SHA512)and homomorphic encryption(HE)scheme,to provide authenticity,integrity,and confidentiality of data.The performance of the proposed model is evaluated by experiments based on accuracy,precision,attack detection rate(ADR),and computational cost.The results show that the proposed model has achieved an accuracy of 98%,a precision of 0.97,and an ADR of 98%,even for a large number of attacks.Hence,the proposed model can be used to detect attacks and mitigate the attacker motives.The results also show that the computational cost of the proposed model does not increase with model complexity. 展开更多
关键词 Deep learning(DL) poisoning attacks evasion attacks neural network hash functions SHA512 homomorphic encryption scheme
在线阅读 下载PDF
Secure Two-Party Point-Circle Inclusion Problem 被引量:16
11
作者 罗永龙 黄刘生 仲红 《Journal of Computer Science & Technology》 SCIE EI CSCD 2007年第1期88-91,共4页
Privacy-preserving computational geometry is a special secure multi-party computation and has many applications. Previous protocols for determining whether a point is inside a circle are not secure enough. We present ... Privacy-preserving computational geometry is a special secure multi-party computation and has many applications. Previous protocols for determining whether a point is inside a circle are not secure enough. We present a two-round protocol for computing the distance between two private points and develop a more efficient protocol for the point-circle inclusion problem based on the distance protocol. In comparison with previous solutions, our protocol not only is more secure but also reduces the number of communication rounds and the number of modular multiplications significantly. 展开更多
关键词 secure multi-party computation computational geometry homomorphic encryption scheme private comparison
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部