3篇
您的检索式：作者名="MAJianfeng"
|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Intrusion-Tolerant Based Survivable Model of Database System显示文摘Survivability has become increasingly important with society's increased dependence of critical infrastructures on computers. Intrusiontolerant systems extend traditional secure systems to be able to survive or operate through attacks, thus it is an approach for achieving survivability. This paper proposes survivable model of database system based on intrusion-tolerant mechanisms. The model is built on three layers security architecture, to defense intrusion at the outer layer, to detect intrusion at the middle layer, and to tolerate intrusion at the inner layer. We utilize the techniques of both redundancy and diversity and threshold secret sharing schemes to implement the survivability of database and to protect confidential data from compromised servers in the presence of intrusions. Comparing with the existing schemes, our approach has realized the security and robustness for the key functions of a database system by using the integration security strategy and multiple security measures. | ZHUJianming WANGChao MAJianfeng | 2005 | Chinese Journal of Electronics2005，14，3： | 3 |
| 2 | A New and Efficient Secret Sharing in Graph-Based Prohibited Structures显示文摘The secret sharing realizing the prohibited structure, which specifies the corruptible subsets of participants, can be determined directly by exploitation of the system setting and the attributes of all participants. Recently, Sun et al. had proposed a construction of secret sharing for graph-based prohibited structures where a vertex denotes a participant and an edge a pair of participants who cannot recover the secret. But their scheme is inefficient and costly. In this paper, we present a new and efficient secret sharing realizing graph-based prohibited structures and prove that the scheme satisfies both properties of the secret sharing scheme, i.e. the reconstruction property and the perfect property. The main features of our scheme are that it only needs some modular additions and subtractions in both shares assignment phase and secret recovery phase, which is an advantage in terms of computational complexity, and it can achieve higher information rate than existing ones. | GUOYuanbo MAJianfeng | 2005 | Chinese Journal of Electronics2005，14，3： | 2 |
| 3 | Security extension for the Canetti-Krawczyk model in identity-based systems显示文摘The Canetti-Krawczyk (CK) model is a formalism for the analysis of keyexchange protocols, which can guarantee many security properties for the protocols proved secure by this model. But we find this model lacks the ability to guarantee key generation center (KGC) forward secrecy, which is an important security property for key-agreement protocols based on Identity. The essential reason leading to this weakness is that it does not fully consider the attacker's capabilities. In this paper, the CK model is accordingly extended with a new additional attacker's capability of the KGC corruption in Identity-based systems, which enables it to support KGC forward secrecy. | LIXinghua MAJianfeng SangJaeMoon | 2005 | Science in China(Series F)2005，48，1： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员