Wang H.,Dalian Ocean University |
IEEE Transactions on Dependable and Secure Computing | Year: 2012
In 2011, Sun et al.  proposed a security architecture to ensure unconditional anonymity for honest users and traceability of misbehaving users for network authorities in wireless mesh networks (WMNs). It strives to resolve the conflicts between the anonymity and traceability objectives. In this paper, we attacked Sun et al. scheme's traceability. Our analysis showed that trusted authority (TA) cannot trace the misbehavior client (CL) even if it double-time deposits the same ticket. © 2006 IEEE.
Wang H.,Intrusion |
Wang H.,Dalian Ocean University
Proceedings - 2011 7th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2011 | Year: 2011
In order to improve the security of ring signature, we combine standard ring signature and key-insulated cryptography. We give the definition and security model for ID-based key-insulated ring signature, and at the same time we proposed an ID-based strong key-insulated ring signature scheme. This scheme can deal with key-exposure problem. The proposed ring signature scheme enjoys several attractive features: (1)it is provably secure in standard model, (2)it is unconditional anonymous, (3)it is strong key-insulated, (4)it allows frequent key-updates without increasing the risk of helper key-exposure, and thus enhances the security of the system. © 2011 IEEE.
Wu G.,Xidian University |
Li N.,Southwest Jiaotong University |
Helleseth T.,University of Bergen |
Finite Fields and their Applications | Year: 2014
In this paper, four classes of complete permutation polynomials over finite fields of characteristic two are presented. To consider the permutation property of the first three classes, Dickson polynomials play a key role. The fourth class is a generalization of a known result. In addition, we also calculate the inverses of these bijective monomials. © 2014 Elsevier Inc.
World Academy of Science, Engineering and Technology | Year: 2011
Duplicated region detection is a technical method to expose copy-paste forgeries on digital images. Copy-paste is one of the common types of forgeries to clone portion of an image in order to conceal or duplicate special object. In this type of forgery detection, extracting robust block feature and also high time complexity of matching step are two main open problems. This paper concentrates on computational time and proposes a local block matching algorithm based on block clustering to enhance time complexity. Time complexity of the proposed algorithm is formulated and effects of two parameter, block size and number of cluster, on efficiency of this algorithm are considered. The experimental results and mathematical analysis demonstrate this algorithm is more costeffective than lexicographically algorithms in time complexity issue when the image is complex.
Fu A.,Xidian University |
Zhang Y.,Intrusion |
Zhu Z.,Xidian University |
Liu X.,Xidian University
IEEE Communications Letters | Year: 2010
IEEE 802.16m is now under consideration by the ITU to become the IMT-Advanced standard. However, handover authentication is a critical issue in this area. In this letter, we propose a fast handover authentication mechanism based on ticket for IEEE 802.16m. The credential ticket of Mobile Station (MS) is issued by the access Base Station (BS) using a multi-BS group key during the initial authentication. When the MS moves from the service BS to a target BS, it can show its ticket to the target BS and this BS can authenticate the MS without communicating with any other third party (e.g., previous BS and authentication server). Our analysis shows that the proposed scheme meets the security requirements in handover authentication semantics and provides robust efficiency in terms of communication overhead and computational cost. © 2010 IEEE.