期刊文献+
共找到8篇文章
< 1 >
每页显示 20 50 100
Study of the Security Enhancements in Various E-Mail Systems
1
作者 Afnan S. Babrahem Eman T. Alharbi +2 位作者 Aisha M. Alshiky Saja S. Alqurashi Jayaprakash Kar 《Journal of Information Security》 2015年第1期1-11,共11页
E-mail security becomes critical issue to research community in the field of information security. Several solutions and standards have been fashioned according to the recent security requirements in order to enhance ... E-mail security becomes critical issue to research community in the field of information security. Several solutions and standards have been fashioned according to the recent security requirements in order to enhance the e-mail security. Some of the existing enhancements focus on keeping the exchange of data via e-mail in confident and integral way. While the others focus on authenticating the sender and prove that he will not repudiate from his message. This paper will survey various e-mail security solutions. We introduce different models and techniques used to solve and enhance the security of e-mail systems and evaluate each one from the view point of security. 展开更多
关键词 E-MAIL Security Enhancement MALWARE ATTACKS AUTHENTICATION INTEGRITY
下载PDF
对一类无证书签名方案的攻击及改进 被引量:8
2
作者 曹雪菲 Kenneth. G. Paterson 寇卫东 《北京邮电大学学报》 EI CAS CSCD 北大核心 2008年第2期64-67,141,共5页
给出了对一个已有的高效无证书签名方案的替换公钥攻击,表明了在该方案中,攻击者可以通过替换签名者公钥伪造签名;进而针对该攻击提出了改进方案.改进方案将用户单一公钥替换为公钥对,增加了公钥有效性验证,简化了签名产生算法,在随机... 给出了对一个已有的高效无证书签名方案的替换公钥攻击,表明了在该方案中,攻击者可以通过替换签名者公钥伪造签名;进而针对该攻击提出了改进方案.改进方案将用户单一公钥替换为公钥对,增加了公钥有效性验证,简化了签名产生算法,在随机预言机模型下具有存在性不可伪造性. 展开更多
关键词 无证书签名 替换公钥攻击 密钥托管
下载PDF
A Fully Homomorphic Encryption Scheme with Better Key Size 被引量:5
3
作者 CHEN Zhigang WANG Jian +1 位作者 ZHANG ZengNian SONG Xinxia 《China Communications》 SCIE CSCD 2014年第9期82-92,共11页
Fully homomorphic encryption is faced with two problems now.One is candidate fully homomorphic encryption schemes are few.Another is that the efficiency of fully homomorphic encryption is a big question.In this paper,... Fully homomorphic encryption is faced with two problems now.One is candidate fully homomorphic encryption schemes are few.Another is that the efficiency of fully homomorphic encryption is a big question.In this paper,we propose a fully homomorphic encryption scheme based on LWE,which has better key size.Our main contributions are:(1) According to the binary-LWE recently,we choose secret key from binary set and modify the basic encryption scheme proposed in Linder and Peikert in 2010.We propose a fully homomorphic encryption scheme based on the new basic encryption scheme.We analyze the correctness and give the proof of the security of our scheme.The public key,evaluation keys and tensored ciphertext have better size in our scheme.(2) Estimating parameters for fully homomorphic encryption scheme is an important work.We estimate the concert parameters for our scheme.We compare these parameters between our scheme and Bra 12 scheme.Our scheme have public key and private key that smaller by a factor of about logq than in Bra12 scheme.Tensored ciphertext in our scheme is smaller by a factor of about log2 q than in Bra 12 scheme.Key switching matrix in our scheme is smaller by a factor of about log3 q than in Bra 12 scheme. 展开更多
关键词 加密方案 同态加密 主要尺寸 交换矩阵 二进制 组密钥 安全性 音乐会
下载PDF
Detection of Sophisticated Network Enabled Threats via a Novel Micro-Proxy Architecture
4
作者 Andrew Blyth 《Journal of Information Security》 2014年第2期37-45,共9页
With the increasing use of novel exploitation techniques in modern malicious software it can be argued that current intrusion detection and intrusion prevention systems are failing to keep pace. While some intrusion p... With the increasing use of novel exploitation techniques in modern malicious software it can be argued that current intrusion detection and intrusion prevention systems are failing to keep pace. While some intrusion prevention systems have the capability to detect evasion techniques they all fail to detect novel unknown exploitation techniques. Traditional proxy approaches have failed to protect the universe of discourse that a network enabled service can be engaged in as they view all information flows of the same type in a uniform manner. In this paper we propose a micro-proxy architecture that utilizes reverse engineering techniques to identify a valid universe of discourse for a network service. This valid universe of discourse is then applied to validate legitimate transactions to a service. Thus in effect, the micro proxy implements a default deny policy via the analysis of the application level discourse. 展开更多
关键词 NETWORK Security FIREWALLS PROXIES and INTRUSION DETECTION
下载PDF
A Socio-Technical Approach to Cyber Risk Management and Impact Assessment
5
作者 Konstantinia Charitoudi Andrew Blyth 《Journal of Information Security》 2013年第1期33-41,共9页
Technology is increasingly being used by organisations to mediate social/business relationships and social/business transactions. While traditional models of impact assessment have focused on the loss of confidentiali... Technology is increasingly being used by organisations to mediate social/business relationships and social/business transactions. While traditional models of impact assessment have focused on the loss of confidentiality, integrity and availability, we propose a new model based upon socio-technical systems thinking that places the people and the technology within an organisation’s business/functional context. Thus in performing risk management in a cyber security and safety context, a detailed picture of the impact that a security/safety incident can have on an organisation is developed. This in turn stimulates a more holistic view of the effectiveness, and appropriateness, of a counter measure. 展开更多
关键词 IMPACT Assessment RISK MANAGEMENT Socio-Technical Systems
下载PDF
Authenticated Key Agreement Protocols: A Comparative Study
6
作者 Areej Omar Baalghusun Olfa Fahad Abusalem +1 位作者 Zahra Abbas Al Abbas Jayaprakash Kar 《Journal of Information Security》 2015年第1期51-58,共8页
One of the most important and challenging cryptographic primitives in Public Key Cryptography is Key Agreement Protocol where two or more parties share secret values and establish the session key. Many authors have pr... One of the most important and challenging cryptographic primitives in Public Key Cryptography is Key Agreement Protocol where two or more parties share secret values and establish the session key. Many authors have proposed key agreement protocols. In this article, we have viewed some authenticated Key Agreement Protocols and presented a comparative study. We have also described the design principle, security requirement and various attacks on Key Agreement Protocol. 展开更多
关键词 Impersonation RESILIENCE PRIME FACTORIZATION ECDLP TRAPDOOR Function
下载PDF
Public Key Infrastructure: A Survey
7
作者 Aysha Albarqi Ethar Alzaid +2 位作者 Fatimah Al Ghamdi Somaya Asiri Jayaprakash Kar 《Journal of Information Security》 2015年第1期31-37,共7页
As security is essential in communications through electronic networks, development of structures providing high levels of security is needed. Public Key Infrastructure (PKI) is a way of providing security measures by... As security is essential in communications through electronic networks, development of structures providing high levels of security is needed. Public Key Infrastructure (PKI) is a way of providing security measures by implementing the means of key pairs among users. In this paper, an overview of the public key infrastructure is discussed that includes various components and operation, some well known PKIs and their comparisons. Also we discuss current implementations, risk and challenges of PKIs. 展开更多
关键词 Impersonating ATTACK EPHEMERAL KEY COMPROMISE ATTACK CERTIFICATE REPOSITORY
下载PDF
A fast algorithm for determining the linear complexity of a binary sequence with period 2~np^m 被引量:3
8
作者 魏仕民 肖国镇 陈钟 《Science in China(Series F)》 2001年第6期453-460,共8页
An efficient algorithm for determining the linear complexity and the minimal polynomial of a binary sequence with period 2npm is proposed and proved, where 2 is a primitive root modulo p2. The new algorithm generalize... An efficient algorithm for determining the linear complexity and the minimal polynomial of a binary sequence with period 2npm is proposed and proved, where 2 is a primitive root modulo p2. The new algorithm generalizes the algorithm for computing the linear complexity of a binary sequence with period 2' and the algorithm for computing the linear complexity of a binary sequence with period pn, where 2 is a primitive root modulo p2. 展开更多
关键词 CRYPTOGRAPHY periodic sequence linear complexity minimal polynomial fast algorithm.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部