Enhanced Security Model Research Articles

A Enhanced Security Model for Cloud Computing in SSO Environment

A Enhanced Security Model for Cloud Computing in SSO Environment

S-Detector: an enhanced security model for detecting Smishing attack for mobile computing

Recently the mobile computing technology has been generally used to people with the development of the IT technology. The mobile computing environment has provided a convenient environment via the intelligent devices such as tablet PC, smartphone, etc. However, many security threats in the mobile computing environment exist. Therefore, secure elements to protect against security threats are needed. In particular, Short Message Service phishing (Smishing) damage has continued to increase with the normalization of mobile computing environment. We discuss and analyze the security considerations about Smishing in mobile computing environments. In addition, we propose an enhanced security model for detecting Smishing attack (we called "S-Detector"). The proposed model is applied to a Naive Bayes classifier to improve the Smishing attack detection in smart devices. This model distinguishes normal text message and Smishing message. And this is mainly used to filter by using statistical learning method. As a result, it is possible to analyze a text message and effectively detect SMS phishing. Finally, we demonstrate the efficiency of our model through the evaluation and analysis of our proposed model.

Enhanced security model and efficient construction for direct anonymous attestation

Direct anonymous attestation (DAA) is a cryptographic scheme which enables the remote authentication of a trusted platform whilst preserving privacy under the user's control. In this paper, we first present the enhanced security model for DAA, in which more precise security notions demanded from DAA are defined than that in any previous model. Then we propose a novel approach for constructing an efficient DAA scheme: we design a secure two-party computation protocol for the join/issue protocol of DAA, and construct the DAA scheme concretely under the q-SDH assumption, DL assumption and XDH assumption. Based on the enhanced security model, we prove that our DAA scheme meets user-controlled anonymity, user-controlled traceability and non-frameability in the random oracle model. Finally, compared with other existing DAA schemes, our DAA scheme has better performance.

Enhanced security model and efficient construction for direct anonymous attestation

Direct anonymous attestation (DAA) is a cryptographic scheme which enables the remote authentication of a trusted platform whilst preserving privacy under the user's control. In this paper, we first present the enhanced security model for DAA, in which more precise security notions demanded from DAA are defined than that in any previous model. Then we propose a novel approach for constructing an efficient DAA scheme: we design a secure two-party computation protocol for the join/issue protocol of DAA, and construct the DAA scheme concretely under the q-SDH assumption, DL assumption and XDH assumption. Based on the enhanced security model, we prove that our DAA scheme meets user-controlled anonymity, user-controlled traceability and non-frameability in the random oracle model. Finally, compared with other existing DAA schemes, our DAA scheme has better performance.

A New Generic Construction of Proxy Signatures under Enhanced Security Models

A New Generic Construction of Proxy Signatures under Enhanced Security Models

Improved broadcast encryption schemes with enhanced security

A broadcast encryption scheme is one of important primitives to achieve message confidentiality in distributed network, which supports one-to-many encryption under insecure channels. In this paper, we show that any balanced incomplete block design constructed by perpendicular array can be used to realize secure BE schemes. Its broadcast rate, broadcast information rate and the upper bound of the number of collusion resistant are also obtained. According to the characteristics of the block, a more efficient broadcast encryption, using the strong part balanced incomplete block design constructed by rational normal curve is presented. This scheme is secure under an enhanced security model compared with the first construction. Particularly, even any two users are absent in the block, it can achieve fully collusion resistant. Moreover, an improved scheme is given based on the efficiency comparison of these two schemes, in which the broadcast rate is invariant while its broadcast information rate is significantly higher than that of the first construction. Finally, we propose a block reservation scheme, which provides the function of appending users dynamically.

Collusion-Resistance in Optimistic Fair Exchange

Optimistic fair exchange (OFE) is a type of cryptographic protocols aimed at solving the fair exchange problem over open networks with the help of a third party to settle disputes between exchanging parties. It is well known that a third party is necessary in the realization of a fair exchange protocol. However, a fully trusted third party may not be available over open networks. In this paper, the security of most of the proposed OFE protocols depends on the assumption that the third party is semitrusted in the sense that it may misbehave on its own but does not conspire with either of the main parties. The existing security models of OFE have not taken into account the case where the potentially dishonest third party may collude with a signer in the sense of sharing its secret key with the signer. In this paper, to reduce the trust level of the arbitrator and increase the security of OFE, we propose an enhanced security model that, for the first time, captures this scenario. We also show a separation between the existing model and our enhanced model with a concrete counter example. Finally, we revisit two popular approaches in the construction of OFE protocols, which are based on verifiably encrypted signature and conventional signature plus ring signature, respectively. Our result shows that the conventional signature plus ring signature approach approach remains valid in our enhanced model. However, for schemes based on verifiably encrypted signature, slight modifications are needed to guarantee the security.

A new certificateless signature scheme under enhanced security models

AbstractIn identity‐based signatures, the key generation center (KGC) always knows user private key, and thus, it can always impersonate the user. Certificateless signatures were introduced by Al‐Riyami and Paterson to solve this key escrow problem of identity‐based signatures in 2003. In certificateless signatures, the private key is determined by neither the user nor the KGC. In 2007, Huang et al. revisited the security models of certificateless signatures. They divided potential adversaries according to their attack power into normal, strong and super adversaries. On the other hand, Au et al. introduced a new attack called malicious‐but‐passive KGC attack in the same year. In the new attack, KGC that holds the master secret key is assumed malicious at the very beginning of the setup phase of the system. The previous schemes that can be proven secure against malicious‐but‐passive KGC attack provided only the security against strong adversaries. In this paper, we construct the first certificateless signature scheme that can be proven secure against malicious‐but‐passive KGC attack of super adversaries. Moreover, our scheme is still secure when the adversary is allowed to obtain valid signatures on the target identity and message. Our construction is based on the hard lattice problems in the random oracle model.Copyright © 2014 John Wiley & Sons, Ltd.

Crypto Steganography using linear algebraic equation

Demand of information security is increasing day by day with the exponential growth of Internet. The content of message is kept secret in cryptography, where as steganography message is embedded into the cover image. In this paper a system is developed in which cryptography and steganography are used as integrated part along with newly developed enhanced security model. In cryptography the process of encryption is carried out using symmetric block ciphers with linear algebraic equation to encrypt a message [1] and the obtained cipher text is hidden in to the cover image which makes the system highly secured. Least Significant Bit (LSB) technique is used for message hiding which replaces the least significant Bits of pixel selected to the hide the information. A large number of commercial steganographic programs use LSB as the method of choice for message hiding in 24-bit,8bit-color images, and gray scale images. It is observed from the simulation study that both methods together enhance security significantly.

Enhanced Security Model for Cloud Using Ones compliment Recoding for Fast Scalar multiplication in ECC

Enhanced Security Model for Cloud Using Ones compliment Recoding for Fast Scalar multiplication in ECC

Counteracting security attacks in virtual machines in the cloud using property based attestation

Cloud computing technologies are receiving a great deal of attention. Furthermore most of the hardware devices such as the PCs and mobile phones are increasingly having a trusted component called Trusted Platform Module embedded in them, which helps to measure the state of the platform and hence reason about its trust. Recently attestation techniques such as binary attestation and property based attestation techniques have been proposed based on the TPM. In this paper, we propose a novel trust enhanced security model for cloud services that helps to detect and prevent security attacks in cloud infrastructures using trusted attestation techniques. We consider a cloud architecture where different services are hosted on virtualized systems on the cloud by multiple cloud customers (multi-tenants). We consider attacker model and various attack scenarios for such hosted services in the cloud. Our trust enhanced security model enables the cloud service provider to certify certain security properties of the tenant virtual machines and services running on them. These properties are then used to detect and minimise attacks between the cloud tenants running virtual machines on the infrastructure and its customers as well as increase the assurance of the tenant virtual machine transactions. If there is a variation in the behaviour of the tenant virtual machine from the certified properties, the model allows us to dynamically isolate the tenant virtual machine or even terminate the malicious services on a fine granular basis. The paper describes the design and implementation of the proposed model and discusses how it deals with the different attack scenarios. We also show that our model is beneficial for the cloud service providers, cloud customers running tenant virtual machines as well as the customers using the services provided by these tenant virtual machines.

Certificate-based signcryption with enhanced security features

Certificate-based cryptography overcomes the inherent shortcomings in traditional public key cryptography and identity-based cryptography. It provides effective mechanisms to design efficient public key cryptography systems with less reliance on underlying infrastructure. As a classic primitive in public key cryptography, signcryption performs signature and encryption in a single logical step, by integrating confidentiality, integrity, authentication and non-repudiation much more efficiently than the traditional sign-then-encrypt approach. In this paper, we first define an enhanced security model for certificate-based signcryption. We then analyze an existing certificate-based signcryption scheme, and show that it is insecure due to two classic attacks. Furthermore, we propose a new certificate-based signcryption scheme. Our scheme is proven secure against adaptive chosen ciphertext attacks and adaptive chosen message attacks in the random oracle model.

Dynamic trust enhanced security model for trusted platform based services

Binary attestation in trusted computing platforms provide the ability to reason about the state of a system using hash measurements. Property based attestation, an extension of binary attestation enables more meaningful attestation by abstracting low level binary values to high level security properties or functions of systems. In this paper, we propose TESM: A Trust Enhanced Secure Model for trusted computing platforms. We argue that given the nature of both binary and property based attestation mechanisms, an attestation requester cannot be absolutely certain if an attesting platform will behave as it is expected to behave. TESM uses a hybrid trust model based on subjective logic to combine ‘hard’ trust from measurements and properties and ‘soft’ trust from past experiences and recommendations to reduce such uncertainties. We believe that such a model will enable better reasoning about the trustworthiness of attesting platforms and thereby facilitate better security decision making.

A New Collaborative Trust Enhanced Security Model For Distributed System

Designing a distributed system with the characteristics of reliability and trustworthiness is an important issue. Yet another important issue in the distributed system is the access to remote system which can be achieved on the basis of certain access rights, policies or authorization semantics. The aim of this paper is to establish a collaborative trust enhanced security model for distributed system in which a node either local or remote is trustworthy. This paper also provides a promising solution with trust policies as authorization semantics. While designing a new secure distributed system, it has been observed that mostly the new nodes joining the system are insecure. If these perfidious nodes are provided full authorization, they can perform malicious activities in the system. In the proposed solution, node registry and service level agreements are used to ensure the trust for a new client node. Kerberos, a network authentication protocol is also used to ensure the security aspect when a client requests for certain services. In the proposed solution, we have also considered the issue of performance bottlenecks. A Reactive agent system is proposed to balance the load of service providers with the aim of enhancing the performance of the distributed system.

Enhancing Security Modeling for Web Services Using Delegation and Pass-On

In recent years, security issues in web service environments have been widely studied and various security standards and models have been proposed. However, most of these standards and models focus on individual web services and do not consider the security issues in composite services. In this article, the authors propose an enhanced security model to control the information flow in service chains. It extends the basic web service security models by introducing the concepts of delegation and pass-on. Based on these concepts, new certificates, certificate chains, delegation and pass-on policies, and how they are used to control the information flow are discussed. The authors also introduce a case study from a healthcare information system to illustrate the protocols.

Trapdoor security in a searchable public-key encryption scheme with a designated tester

We study a secure searchable public-key encryption scheme with a designated tester (dPEKS). The contributions of this paper are threefold. First, we enhance the existing security model to incorporate the realistic abilities of dPEKS attackers. Second, we introduce the concept of “trapdoor indistinguishability” and show that trapdoor indistinguishability is a sufficient condition for thwarting keyword-guessing attacks. This answers the open problem of how to construct PEKS (dPEKS) schemes that are provably secure against keyword-guessing attacks. Finally, we propose a dPEKS scheme that is secure in the enhanced security model. The scheme is the first dPEKS scheme that is secure against keyword-guessing attacks.

ENHANCED SECURITY MODELS AND A GENERIC CONSTRUCTION APPROACH FOR LINKABLE RING SIGNATURE

A ring signature scheme is a group signature scheme but with no group manager to setup a group or revoke a signer's identity. It allows members of a group to sign messages such that the resulting signatures do not reveal the identities of the group members who actually created these signatures (anonymity) and no one can tell if two signatures are created by the same signer (unlinkability). Furthermore, the formation of a group is spontaneous. Diversion group members (non-signers) can be totally unaware of being conscripted to the group. The notion of linkable ring signature, introduced by Liu et al. in 2004, also provides signer anonymity and spontaneity, but at the same time, allows anyone to determine whether two signatures have been issued by the same group member (linkability). In this paper, we propose a suite of enhanced security models and show that they capture stronger notions of signer anonymity and linkability than the original ones proposed by Liu et al. in 2004. We also propose a generic approach for constructing a linkable ring signature scheme. The generic approach leads us to the construction of two efficient polynomial-structured schemes and one type-restricted separable scheme. The separable scheme allows group members to have different sets of DL (discrete logarithm) domain parameters. All schemes are shown secure under the enhanced security models defined in this paper.