检索结果-南通市图书馆

A secure key agreement protocol based on chaotic maps

在线全文

学校读者我要写书评

暂无评论

Chinese Physics B 2013年第11期22卷 239-243页

作者：王兴元栾大朋 Faculty of Electronic Information and Electrical Engineering Dalian University of Technology

To guarantee the security of communication in the public channel, many key agreement protocols have been proposed. Recently, Gong et al. proposed a key agreement protocol based on chaotic maps with password sharing. In this paper, Gong et al.＇s protocol is analyzed, and we find that this protocol exhibits key management issues and potential security problems. Furthermore, the paper presents a new key agreement protocol based on enhanced Chebyshev polynomials to overcome these problems. Through our analysis, our key agreement protocol not only provides mutual authentication and the ability to resist a variety of conarnon attacks, but also solve the problems of key management and security issues existing in Gong et al.＇ s protocol.

关键词： chaos Chebyshev polynomials key agreement protocol security

Improved authenticated key agreement protocol based on Bi-ISIS problem

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2020年第3期27卷 93-102页

作者： Yang Yatao Zhang Juanmei Huang Jierun Zhang Yaze Department of Electronic and Communication Engineering Beijing Electronic Science and Technology InstituteBeijing 100070China Department of Cryptography Science and Technology Beijing Electronic Science and Technology InstituteBeijing 100070China School of Telecommunication Engineering Xidian UniversityXi'an 710071China

In the post quantum era,public key cryptographic scheme based on lattice is considered to be the most promising cryptosystem that can resist quantum computer ***,there are still few efficient key agreement protocols based on lattice up to *** solve this issue,an improved key agreement protocol with post quantum security is ***,by analyzing the Wess-Zumino model+(WZM+)key agreement protocol based on small integer solution(SIS)hard problem,it is found that there are fatal defects in the protocol that cannot resist man-in-the-middle *** based on the bilateral inhomogeneous small integer solution(Bi-ISIS)problem,a mutual authenticated key agreement(AKA)protocol with key confirmation is proposed and *** with Diffie-Hellman(DH)protocol,WZM+key agreement protocol,and the AKA agreement based on the ideal lattice protocol,the improved protocol satisfies the provable security under the extend Canetti-Krawczyk(eCK)model and can resist man-in-the-middle attack,replay attack and quantum computing attack.

关键词： lattice small integer solution problem key agreement protocol provable security eCK model

An Efficient Lightweight Authentication and key agreement protocol for Patient Privacy

在线全文

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2021年第12期69卷 3495-3512页

作者： Seyed Amin Hosseini Seno Mahdi Nikooghadam Rahmat Budiarto Department of Computer Engineering Ferdowsi University of MashhadMashhad***Iran Department of Informatics Faculty of Science and TechnologyUniversitas Alazhar IndonesiaJakarta12110Indonesia

Tele-medical information system provides an efficient and convenient way to connect patients at home with medical personnel in clinical *** this system,service providers consider user authentication as a critical *** address this crucial requirement,various types of validation and key agreement protocols have been *** main problem with the two-way authentication of patients and medical servers is not built with thorough and comprehensive analysis that makes the protocol design yet has *** paper analyzes carefully all aspects of security requirements including the perfect forward secrecy in order to develop an efficient and robust lightweight authentication and key agreement *** secureness of the proposed protocol undergoes an informal analysis,whose findings show that different security features are provided,including perfect forward secrecy and a resistance to DoS ***,it is simulated and formally analyzed using Scyther *** results indicate the protocol’s robustness,both in perfect forward security and against various *** addition,the proposed protocol was compared with those of other related protocols in term of time complexity and communication *** time complexity of the proposed protocol only involves time of performing a hash function Th,i.e.,:O(12Th).Average time required for executing the authentication is 0.006 seconds;with number of bit exchange is 704,both values are the lowest among the other *** results of the comparison point to a superior performance by the proposed protocol.

关键词： Authentication key agreement protocol tele-medical Scyther perfect forward secrecy

SM algorithms-based encryption scheme for large genomic data files

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Digital Communications and Networks 2021年第4期7卷 543-550页

作者： Yatong Jiang Tao Shang Jianwei Liu School of Cyber Science and Technology Beihang UniversityBeijing100083China

With the rapid development of the genomic sequencing technology,the cost of obtaining personal genomic data and effectively analyzing it has been gradually *** analysis and utilization of genomic dam gradually entered the public view,and the leakage of genomic dam privacy has attracted the attention of *** security of genomic data is not only related to the protection of personal privacy,but also related to the biological information security of the ***,there is still *** genomic dam privacy protection scheme using Shangyong Mima(SM)*** this paper,we analyze the widely used genomic dam file formats and design a large genomic dam files encryption scheme based on the SM ***,we design a key agreement protocol based on the SM2 asymmetric cryptography and use the SM3 hash function to guarantee the correctness of the ***,we used the SM4 symmetric cryptography to encrypt the genomic data by optimizing the packet processing of files,and improve the usability by assisting the computing platform with key *** implementation demonstrates that the scheme can be applied to securely transmit the genomic data in the network environment and provide an encryption method based on SM algorithms for protecting the privacy of genomic data.

关键词： Genomic data Privacy protection SM algorithm key agreement protocol Hybrid encryption

New Public key Cryptosystems from Combinatorial Group Theory

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2006年第5期11卷 1267-1270页

作者： TANG Xueming WANG Xiaofei HONG Fan CUI Guohua College of Computer Science and Technology HuazhongUniversity of Science and Technology Wuhan 430074Hubei China

External direct product of some low layer groups such as braid groups and general Artin groups, with a kind of special group action on it, provides a secure cryptographic computation platform, which can keep secure in the quantum computing epoch. Three hard problems on this new platform, Subgroup Root Problem, Multi-variant Subgroup Root Problem and Subgroup Action Problem are presented and well analyzed, which all have no relations with conjugacy. New secure public key encryption system and key agreement protocol are designed based on these hard problems. The new cryptosystems can be implemented in a general group environment other than in braid or Artin groups.

关键词： public key cryptosystem key agreement protocol combinatorial group theory Artin group external direct product quantum computing