Search

The message negotiations involved in the Orthus authentication protocol for self-contained realms are a matter of prior publication. Orthus provides Authentication of a compliant entity to a realm, and a clear demarcation between realm membership verification and service access. Version II of the protocol introduces some security enhancements. Furthermore, functional descriptions of the supplementary application and functioning of supporting services and architecture in the Enterprise Environment are provided. Namely, those protocol exchanges necessary for the establishment of realm-to-realm trusts, and hierarchies, including a remote realm location protocol, and security hardening functions such as key revocation and re-issue procedures are described. [ABSTRACT FROM AUTHOR]

Abstract: In recent years, there has been growing interest in secure pairing, which refers to the establishment of a secure connection between two mobile devices. Many published studies have described the various types of out-of-band (OOB) channels through which authentication data can be transferred with user control and involvement. However, there has been little discussion of setting up secure connections between groups of mobile devices. Some security protocols have been proposed, but they have tended to focus on a scenario whereby all devices must be located in one place to perform the association. In this paper, we describe a new group association method, called MobileCA. Our method is designed for a broader range of scenarios and does not require all devices to be in one place at one time. MobileCA extends the OOB channel concept and utilizes digital certification. We have implemented a prototype system using smart phone handsets. [Copyright &y& Elsevier]

Abstract: Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy or authentication. There are however several security properties, which cannot be defined (or cannot be naturally defined) as trace properties and require a notion of behavioral equivalence. Typical examples are anonymity, privacy related properties or statements closer to security properties used in cryptography. In this paper, we consider three notions of equivalence defined in the applied pi calculus: observational equivalence, may-testing equivalence, and trace equivalence. First, we study the relationship between these three notions. We show that for determinate processes, observational equivalence actually coincides with trace equivalence, a notion simpler to reason with. We exhibit a large class of determinate processes, called simple processes, that capture most existing protocols and cryptographic primitives. While trace equivalence and may-testing equivalence seem very similar, we show that may-testing equivalence is actually strictly stronger than trace equivalence. We prove that the two notions coincide for image-finite processes, such as processes without replication. Second, we reduce the decidability of trace equivalence (for finite processes) to deciding symbolic equivalence between sets of constraint systems. For simple processes without replication and with trivial else branches, it turns out that it is actually sufficient to decide symbolic equivalence between pairs of positive constraint systems. Thanks to this reduction and relying on a result first proved by M. Baudet, this yields the first decidability result of observational equivalence for a general class of equational theories (for processes without else branch nor replication). Moreover, based on another decidability result for deciding equivalence between sets of constraint systems, we get decidability of trace equivalence for processes with else branch for standard primitives. [Copyright &y& Elsevier]

Abstract: Nowadays, the secure flash disk is the most common secure mobile storage device. Two conventional schemes, flash encryption and identity authentication, are used to ensure the security of the information stored in it, but there is no comprehensive security model. We summarize three shortcomings of it: the USB cable is very easy to be monitored; the disk is not applicable to a big group and does not resist the corruption attack. In this paper, a new attack named USB cable monitor attack is proposed and implemented. In order to overcome the existing shortcomings, we give a notion of “secure group flash disk” and its security model. Accordingly, a set of universal cryptographic strategies and a concrete authenticated key exchange protocol are devised, whose security can be proved via the universally composable security model. Based on the strategies, the system architecture of this USB flash disk is designed. An IP core of the USB device controller is implemented and verified on a FPGA, so that the performance superiority can be given. Our experiment shows that our strategies can perfectly solve the problems of USB cable monitor, group application, and resistance to corruption. [Copyright &y& Elsevier]

Abstract: Secret handshake (SH) schemes enable two members who belong to the same group to authenticate each other in a way that hides their affiliation to that group from all others. In previous work on SH, the group authority (GA) of the group G has been shown to have the ability to reveal the identity (ID) of a handshake player who belongs to G. The capability to reveal a malicious player is important in SH systems. In this paper, we focus first on the classification of traceability of GA. We classify this feature as follows: (i) GA of G is able to reveal IDs of members belonging to G by using a transcript of a handshake protocol; and (ii) GA of G is able to confirm whether handshake players belong to G or not by using a transcript of a handshake protocol. Previous research in this field only considers the former capability. In some situations, only the latter capability is needed. Next, we consider a SH system that GA has only an ability to confirm whether a handshake player belongs to his own group without revealing his ID. The most naive method is that member IDs are eliminated and members have a common group ID. However, if member ID does not exist, one cannot reveal the handshake player’s ID in the event of disputes. Thus, we introduce a SH with request-based-revealing (SHRBR). In SHRBR schemes, GA can check whether handshake players belong to their own group, but cannot reveal member IDs alone. After a handshake player executes a handshake protocol with , if wants to reveal a handshake partner (in this case ), requests GA to reveal a handshake partner’s ID by bringing forth his own ID and secret information of . We define the security requirements for SHRBR schemes and propose two concrete SHRBR schemes, SHRBR-1 and SHRBR-2. We prove that the proposed SHRBR schemes satisfy security requirements in the random oracle model. [Copyright &y& Elsevier]

Abstract: The main goal of this paper is to analyze the security of a multiple-key agreement protocol and to show that this protocol is vulnerable to forgery attack. In order to address the security weakness, a new efficient multiple-key agreement protocol is proposed. The proposed protocol is based on bilinear pairings and utilizes a novel signature scheme without one-way hash functions. In contrast to related protocols which are based on bilinear pairings, in the proposed protocol, these pairings are not utilized for the included signature scheme, but they are only used for session keys. As a result, the computational complexity of the proposed protocol is decreased by 50% compared to that of the existing protocols. Another contribution of the proposed protocol is an increase of the number of the session keys up to (n 2(n +1)2/4), for n ⩾2 random numbers, regarding the bilinear property of the pairings. Finally, the simulation results from AVISPA tools confirm the security analysis of the proposed protocol. [Copyright &y& Elsevier]

Abstract: The Internet has been population, which it was implement information technology, to every enterprise, also changed their contact mode of information flow style. Since public key conception was proposed, it had authentication function to secure while they are communication, and defense the data to leak based on stranger. In this article, we improved the Kwon-Song protocol that it avoids password guessing attack. [Copyright &y& Elsevier]

Abstract: Studying the process of Diameter protocol and Protocol for carrying Authentication for Network Access(PANA) and through the analysis of the combination of PANA in work model and protocol structure, the paper proposes a complete solution which combines the two protocols. The solution includes the architecture of key device and the implementation method of open source software package based on Open Diameter. We introduce the building process, technical route, the function design. And the experimental result shows that the solution can meet the complex requirements of Authentication, Authorization, Accounting (AAA) in network system. So the system will make AAA framework much safer in protocol layer, which is a trend of AAA framework in the future. [Copyright &y& Elsevier]

Abstract: This paper proposes a new approach, named Card-Aided Firewall (CAF) that combines the simplified firewall and the state-oriented smart card technologies to construct a controllable and accountable Internet access framework. The idea suggests that a client computer, protected by a light-weight firewall, could establish diversified authenticated communication channels, controlled and accounted by “legal” states of the smart card. The program of a smart card is state-oriented or a state machine, which defines a chain of events involving various state transitions. The “legal” states of a smart card program are defined to be legal to communicate with surfing targets. A predefined Access Control List (ACL), stored in the same card, is necessary. An ACL is a sequential list of permit or deny statements that apply to addresses or upper-layer protocols. The proposed firewall decides acceptance or rejection messages by matching the current state of the card program and the ACL. In addition, a complete surfing account for tracing back is recorded. It is a by-product of the smart card authentication. The proposed Card-Aided Firewall framework is implemented to demonstrate its effectiveness. The implementation is done at the driver level. It keeps up with the high line speed. The driver takes 39K bytes and works well with other firewalls. The average packet processing time of the CAF driver is 31.74 μs. On the premise of secure authentication within the smart card, the Card-Aided Firewall would facilitate various rapidly growing applications in campus cards, family cards, and employee cards, etc. that require accurate controllability and accountability in the surfing boundary. [Copyright &y& Elsevier]