|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Universally composable one-time signature and broadcast authentication显示文摘Broadcast authentication is a vital security primitive for the management of a copious number of parties. In the universally composable framework, this paper investigates broadcast authentication using one-time signature based on the fact that one-time signature has efficient signature generation and verification suitable for low-power devices, and gives immediate authentication, which is a favorable property for time-critical messages. This paper first formulates a broadcast authentication model with the ideal functionalities such as one-time signature and broadcast authentication, and proposes a broadcast authentication scheme in the hybrid model. This paper then improves HORS, which is secure based on a strong assumption (i.e., a subset-resilient hash function) and presents the improved version as HORS+, which diffiers from HORS such that it is a secure one-time signature based on weaker assumptions, i.e. one-way functions, one-way hash functions and collisionresistant hash functions. At the same time, a protocol OWC using one-way chains is proposed to provide more registered keys for multi-message broadcast authentication. Our broadcast authentication scheme constructed by the combined use of HORS+ and OWC is universally composable secure and suitable for low-power devices. | ZHANG JunWei MA JianFeng MOON SangJae | 2010 | Science China(Information Sciences)2010，53，3： | 12 |
| 2 | Universally composable secure TNC model and EAP-TNC protocol in IF-T显示文摘This paper analyzes trusted network connect (TNC) protocols within the universally composable (UC) framework. We propose the first TNC model in the UC framework by first designing the TNC ideal functionality FTNC, the EAP ideal functionality FEAP and the EAP-TNC ideal functionality FE-PA. Then, we construct a trusted network connect protocol named TK-TNC that UC-realizes FTNC in the (FEAP, FE-PA)- hybrid model. Subsequently, we perform a security analysis on protocol D-H PN given in the TCG specification and show that this protocol cannot securely realize the EAP-TNC ideal functionality and be resistant to an attack. Finally, we propose an alternative protocol using the twin Diffie-Hellman key-exchange technique, named protocol TD-H PN, which can securely realize the EAP-TNC ideal functionality in the (FREG, FCERT)-hybrid model. | ZHANG JunWei MA JianFeng MOON SangJae | 2010 | Science China(Information Sciences)2010，53，3： | 11 |
| 3 | Universally composable anonymous Hash certification model显示文摘Ideal function is the fundamental component in the universally composable security model. However, the certification ideal function defined in the universally composable security model realizes the identity authentication by binding identity to messages and the signature, which fails to characterize the special security requirements of anonymous authentication with other kind of certificate. Therefore, inspired by the work of Marten, an anonymous hash certification ideal function and a more universal certificate CA model are proposed in this paper. We define the security requirements and security notions for this model in the framework of universal composable security and prove in the plain model (not in the random-oracle model) that these security notions can be achieved using combinations of a secure digital signature scheme, a symmetrical encryption mechanism, a family of pseudorandom functions, and a family of one-way collision-free hash functions. Considering the limitation of wireless environment and computation ability of wireless devices, this anonymous Hash certification ideal function is realized by using symmetry primitives. | ZHANG Fan MA JianFeng SangJae MOON | 2007 | Science in China(Series F)2007，50，3： | 9 |
| 4 | Provable Efficient Certificateless Group Key Exchange Protocol显示文摘Certificateless public key cryptography (CL-PKC) avoids the inherent escrow of identity-based cryptography and does not require certificates to guarantee the authenticity of public keys. Based on CL-PKC, we present an efficient constant-round group key exchange protocol, which is provably secure under the intractability of computation Diffie-Hellman problem. Our proto- col is a contributory key exchange with perfect forward secrecy and has only two communication rounds. So it is more efficient than other protocols. Moreover, our protocol provides a method to design efficient constant-round group key exchange protocols and most secret sharing schemes could be adopted to construct our protocol. | CAO Chunjie MA Jianfeng MOON Sangjae | 2007 | Wuhan University Journal of Natural Sciences2007，12，1： | 8 |
| 5 | A new approach for UC security concurrent deniable authentication显示文摘Deniable authentication protocols allow a sender to authenticate a message for a receiver, in a way which the receiver cannot convince a third party that such au- thentication ever took place. When we consider an asynchronous multi-party net- work with open communications and an adversary that can adaptively corrupt as many parties as it wishes, we present a new approach to solve the problem of concurrent deniable authentication within the framework of universally compos- able (UC) security. We formulate a definition of an ideal functionality for deniable authentication. Our constructions rely on a modification of the verifiably smooth projective hashing (VSPH) with projection key function by trapdoor commitment. Our protocols are forward deniable and UC security against adaptive adversaries in the common reference string model. A new approach implies that security is pre- served under concurrent composition of an unbounded number of protocol execu- tions; it implies non-malleability with respect to arbitrary protocols and more. The novelty of our schemes is the use of witness indistinguishable protocols and the security is based on the decisional composite residuosity (DCR) assumption. This new approach is practically relevant as it leads to more efficient protocols and se-curity reductions. | FENG Tao LI FengHua MA JianFeng SangJae MOON | 2008 | Science in China(Series F)2008，51，4： | 6 |
| 6 | Stability analysis of a SEIQV epidemic model for rapid spreading worms显示文摘 | Fangwei Wang Yunkai Zhang Changguang Wang Jianfeng Ma SangJae Moon | 2009 | Computers & Security2009，，4： | 1 |
| 7 | Provably Secure Identity-based Group Key Exchange Protocol显示文摘Group key management is one of the basic building blocks in securing group communication.A number of solutions to group key exchange have been proposed,but most of them are not scalable and,in particular,require at least 0(log n) communication rounds.We formally present a constant -round Identity-based protocol with forward secrecy for group key exchange,which is provably secure in the security model introduced by Bresson et al.Our protocol focuses on round efficiency and the number of communication round is only one greater than the lower bound presented by Becker and Wille.And,the protocol provides a batch verification technique,which simultaneously verifies the validity of messages from other group participants and greatly improves computational efficiency.Moreover,in our protocol,it is no necessary of always-online key generation center during the execution of the protocol compared to other Identity-based protocols. | SangJae Moon | 2007 | China Communications2007，4，4： | 0 |
| 8 | Authentication Methods for 802.11s Mesh Networks显示文摘With the rapid development of the WLAN,the 802. 11 s mesh network is emerging.Reliability,adaptability and scalability are the most important attributes of a mesh network.However,the security in an 802.11s mesh network is not well defined or specified,and there is no standard method to authenticate a mesh point that is creating a mesh link.In this paper,we propose solutions for the authentication of mesh points.For the Basic Infrastructure Security Mode,we combine the 802.1X/EAP and neighbor graph to realize the fast mutual authentication between a new mesh point and every its mesh link.We prove that our scheme maintains the security of the standardized EAP authentication algorithm.At the same time,the simulation result shows that the authentication latency of our scheme is much lower than that of the scheme in[2].In the Basic Decentralized Security Mode(BDSM),802.11s mesh networks are very similar to ad hoc networks,but they are different in several aspects.We first analyze the differences between them.Based on this analysis, we investigate the main authentication methods used in ad hoc networks and select the pairwise key pre-distribution model and identity-based model for the WLAN mesh network. | SangJae Moon | 2007 | China Communications2007，4，1： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员