检索结果-内蒙古大学图书馆

Classifying and clustering in negative databases

Frontiers of Computer Science 2013年第6期7卷 864-874页

作者： Ran LIU Wenjian LUO Lihua YUE School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei 230027 China

Recently, negative databases （NDBs） are proposed for privacy protection. Similar to the traditional databases, some basic operations could be conducted over the NDBs, such as select, intersection, update, delete and so on. However, both classifying and clustering in negative databases have not yet been studied. Therefore, two algorithms, i.e., a k nearest neighbor （kNN） classification algorithm and a k-means clustering algorithm in NDBs, are proposed in this paper, respectively. The core of these two algorithms is a novel method for estimating the Hamming distance between a binary string and an NDB. Experimental results demonstrate that classifying and clustering in NDBs are promising.

关键词： negative databases classification clustering k nearest neighbor k-means hamming distance

来源：评论

学校读者我要写书评

暂无评论

A Two-Factor Authentication Scheme based on negative databases 8

A Two-Factor Authentication Scheme based on Negative Databas...

引用

8th IEEE Symposium Series on Computational Intelligence (IEEE SSCI)

作者： Liu, Ran Wang, Xiang Wang, Can China Univ Geosci Sch Comp Sci Wuhan 430074 Hubei Peoples R China Griffith Univ Sch Informat & Commun Technol Gold Coast Australia

ISBN: (纸本)9781538692769

In some scenes such as smart mobile terminal, low energy consumption and high efficiency are highly important in information security. So two-factor authentication scheme based on classical encryption algorithms are not suitable in some scenes. negative database (NDB), inspired by the artificial immune system, is significant with wide applications in information security and privacy protection for the high efficiency. Password authentication schemes based on NDBs can be used in mobile internet, sensor network and smart card because of the high efficiency of generating NDBs. This paper proposes a two-factor authentication scheme based on NUBs, the security of the scheme depends on the NP-Completeness of reversing an NDB to obtain the original database (DB). The efficiency of this proposed scheme is similar to the present one-time password authentication scheme based on NUBs. The efficiency and the security of this proposed scheme is analyzed as well.

关键词： artificial immune system NP-Complete negative databases two-factor authentication

来源：评论

学校读者我要写书评

暂无评论

An efficient two-factor authentication scheme based on negative databases: Experiments and extensions

引用

APPLIED SOFT COMPUTING 2022年第0期119卷 108558-108558页

作者： Liu, Ran Wang, Xiang Wang, Can China Univ Geosci Sch Comp Sci Wuhan 430078 Peoples R China China Univ Geosci Hubei Key Lab Intelligent Geoinformat Proc Wuhan 430078 Peoples R China Griffith Univ Sch Informat & Commun Technol Gold Coast Australia

With the rapid development of network communication technology, identity authentication based on smart cards is one of the most common two-factor authentication schemes. In some real-world applications, timeliness is another challenge besides security and privacy because of the frequent logon and logoff or data updating. Presently, two-factor authentication schemes based on elliptic curve cryptography (ECC) are efficient. They are based on asymmetric encryption algorithms. But the time efficiency can be improved by hash-based methods, such as negative databases (NDB) inspired by the artificial immune system. A one-time password authentication scheme based on NDBs is efficient, but it does not achieve the functions of mutual authentication and password changing, nor resists stolen-verifier attacks.& nbsp;In this paper, we propose an efficient two-factor authentication scheme based on NDBs. With this scheme, the password changing function is achieved, and the properties of uncertain form of negative databases can reduce the frequency of data updating. As the proposed scheme is a hash function based one, it has fewer calculation steps and higher time efficiency, compared with the authentication schemes based on asymmetric encryption algorithms such as ECC. This scheme also resists the majority of attacking behaviours, such as password-guessing attacks and man-in-the-middle attacks. Experimental results verify the time efficiency of this proposed scheme, and its security is analysed as well. (C)& nbsp;2022 Elsevier B.V. All rights reserved.

关键词： Artificial immune system negative databases Two-factor authentication Uncertain representation

来源：评论

学校读者我要写书评

暂无评论

negative representations of information

引用

INTERNATIONAL JOURNAL OF INFORMATION SECURITY 2009年第5期8卷 331-345页

作者： Esponda, Fernando Forrest, Stephanie Helman, Paul Univ New Mexico Dept Comp Sci Albuquerque NM 87131 USA Santa Fe Inst Santa Fe NM 87501 USA

In a negative representation, a set of elements (the positive representation) is depicted by its complement set. That is, the elements in the positive representation are not explicitly stored, and those in the negative representation are. The concept, feasibility, and properties of negative representations are explored in the paper;in particular, its potential to address privacy concerns. It is shown that a positive representation consisting of n l-bit strings can be represented negatively using only O(ln) strings, through the use of an additional symbol. It is also shown that membership queries for the positive representation can be processed against the negative representation in time no worse than linear in its size, while reconstructing the original positive set from its negative representation is an NP-hard problem. The paper introduces algorithms for constructing negative representations as well as operations for updating and maintaining them.

关键词： negative databases Immune-inspired algorithms Privacy information hiding Data representations

来源：评论

学校读者我要写书评

暂无评论

Hiding multiple solutions in a hard 3-SAT formula

引用

DATA & KNOWLEDGE ENGINEERING 2015年第PartA期100卷 1-18页

作者： Liu, Ran Luo, Wenjian Yue, Lihua Univ Sci & Technol China Sch Comp Sci & Technol Anhui Prov Key Lab Software Engn Comp & Commun Hefei 230026 Anhui Peoples R China China Univ Geosci Sch Comp Sci Wuhan Hubei Peoples R China

Hiding solutions in 3-SAT formulas can be used in privacy protection and data security. Although the typical q-hidden algorithm could cancel the attraction to the unique predefined solution, and generate deceptive 3-SAT formulas with unique predefined solution, few works have mentioned that with multiple predefined solutions. Therefore, the objective of this paper is to propose algorithms which could cancel the attraction to the multiple predefined solutions simultaneously. The core element of these proposed algorithms is misguiding the SAT solvers with local search strategy to the reverse direction of the centre solution of the multiple predefined solutions, so that the attraction to the multiple predefined solutions can be cancelled simultaneously. Experimental results verify the behaviour of the two classical SAT solvers: the SAT solvers with local search strategy (such as WalkSAT) and that with DPLL strategy (such as zChaff). And a real-world application is introduced based on the proposed algorithm. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Security Protection NP-complete negative databases negative authentication

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：