Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Internet Technology and Secured Transactions (ICITST), 2011 International Conference for

Date 11-14 Dec. 2011

Filter Results

Displaying Results 1 - 25 of 143
  • [Front cover]

    Publication Year: 2011 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (15 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2011 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (20 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2011 , Page(s): 1 - 10
    Save to Project icon | Request Permissions | PDF file iconPDF (97 KB)  
    Freely Available from IEEE
  • Hardware implementations of Elliptic Curve Cryptography in Wireless Sensor Networks

    Publication Year: 2011 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (521 KB) |  | HTML iconHTML  

    This paper presents a study of hardware implementations of Elliptic Curve Cryptography (ECC) in Wireless Sensor Networks (WSN). A critical study of the underlying finite field, representation basis, occupied chip area, consumed power, and time performances of these implementations is conducted. The study shows that most of the reviewed implementations were implemented on Application Specific Integrated Circuits (ASIC) and only one was implemented on Field Programmable Gate Array (FPGA). Most of these implementations were implemented over the binary fields GF(2m) and using polynomial basis representation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of GF(2m) Elliptic Curve cryptoprocessor on a Nano FPGA

    Publication Year: 2011 , Page(s): 7 - 12
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (550 KB) |  | HTML iconHTML  

    This paper presents an implementation of an Elliptic Curve Cryptography (ECC) cryptoprocessor on a Nano Field Programmable Gate Array (FPGA). Nano FPGAs offer groundbreaking possibilities in power, size, lead-times, operating temperature and cost. To the best of our knowledge, this is the first ECC implementation on Nano FPGAs. The proposed ECC cryptoprocessor was modeled using VHDL and synthesized on Actel IGLOO AGLN250V2-VQFP100 Nano FPGA. The synthesis results show that the targeted Nano FPGA can not exceed the values of m ≤ 11 bits. This is because of the limited number of resources available on Nano FPGAs, which opens a new challenging opportunity for future Nano FPGAs to satisfy the needs of critical portable applications. However, these results may be interesting for battery limited applications that require moderate level of security such as those of Wireless Sensor Networks (WSN). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified countermeasure against side channel attacks on cryptographic RFID

    Publication Year: 2011 , Page(s): 13 - 18
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (563 KB) |  | HTML iconHTML  

    Side channel analysis attacks have been successfully used to attack embedded systems and cryptographic hardware systems. These attacks have been categorized into different types of attacks yielding to a specific countermeasure for each type based on the nature of the attack. As a result, a significant overhead in terms of performance and resources is introduced by the countermeasures applied to the cryptosystems. Having a unified scheme to counteract different attacks can be challenging. In this paper, we introduce a unified gate-level countermeasure scheme that protects against both power analysis attacks and fault attacks simultaneously. In this paper, we show and study how such a unified countermeasure can be applied to todays cryptographic RFIDs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Forensics and war-driving on unsecured wireless network

    Publication Year: 2011 , Page(s): 19 - 24
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1079 KB) |  | HTML iconHTML  

    This paper investigates the effect of common war-driving on wireless network. Different war-driving software tools are examined and their effects are compared. It also investigates how forensics tools can monitor war drivers. The experiments show that significant numbers of homes are deploying wireless access points without much regard to the security of these devices and it is anticipated that more digital crime cases in this field will be deployed. Such cases include connecting to an unsecured home Wi-Fi network and performing illegal activities, or stealing personal data with sensitive information and using it to threaten victims or perform identity theft. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FPGA implementation of high speed XTS-AES for data storage devices

    Publication Year: 2011 , Page(s): 25 - 28
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (230 KB) |  | HTML iconHTML  

    This paper presents a novel architecture of XTS-AES mode for data storage devices. An enhanced fully pipelined and area efficient XTS-AES mode design using one AES core is proposed. We propose a design of XTS module to handle the data blocks to be encrypted using a single AES core. Considering previous work in XTS, few designs have been published that use a single AES core, and few efforts have been targeted toward their optimization. This paper describes hardware implementation of XTS-AES design with a throughput of 19.56 Gbps and a maximum achievable frequency of 153.84 MHz. This design is written in Verilog HDL and verified on Altera Cyclone II FPGA. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The use of Boolean functions in stream ciphers

    Publication Year: 2011 , Page(s): 29 - 33
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (815 KB) |  | HTML iconHTML  

    Cryptographic properties of Boolean functions such as balancedness, high nonlinearity and high algebraic degree play an important role in the design of the symmetric key encryption schemes, especially the design of S-boxes for block ciphers and the design of robust pseudo-random generators for stream ciphers. In this paper, we focus on Boolean functions for the design of stream ciphers. First, we give brief introduction to stream ciphers and Boolean functions. Then, we provide the ways of constructing appropriate Boolean functions with good cryptographic characteristics needed to design stream ciphers. Last, we survey the resistance of Boolean function against algebraic attack which is a powerful tool of cryptanalysis. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the security of inclusion or omission of MixColumns in AES cipher

    Publication Year: 2011 , Page(s): 34 - 39
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (455 KB) |  | HTML iconHTML  

    The Rijndael cipher or Advanced Encryption Standard (AES) is the most widely used block cipher these days. It is composed of a number of rounds of transformations. The transformations in each round are similar except for the last round where a linear mixing operation (called MixColumns) is omitted. Since its acceptance in 1999, the designers of the cipher had advocated, and it was widely believed, that the omission of the last round MixColumns has no security implications, and is left out for optimization reasons. However, in mid 2010, it was claimed that such an omission operation may have security implications as it may reduce the time complexity of the majority of attacks targeted against AES. This paper investigates both claims and evaluates the security of the AES when including and omitting the MixColumns operation in AES. The paper also studies the performance overhead when including the MixColumns operation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Study on Secret Sharing Schemes (SSS) and their applications

    Publication Year: 2011 , Page(s): 40 - 45
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (918 KB) |  | HTML iconHTML  

    Hiding a secret is needed in many situations. One might need to hide a password, an encryption key, a secret recipe, and etc. Information can be secured with encryption, but the need to secure the secret key used for such encryption is important too. Imagine you encrypt your important files with one secret key and if such a key is lost then all the important files will be inaccessible. Thus, secure and efficient key management mechanisms are required. One of them is secret sharing scheme (SSS) that lets you split your secret into several parts and distribute them among selected parties. The secret can be recovered once these parties collaborate in some way. This paper will study these schemes and explain the need for them and their security. Across the years, various schemes have been presented. This paper will survey some of them varying from trivial schemes to threshold based ones. Explanations on these schemes constructions are presented. The paper will also look at some applications of SSS. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Survey on computationally hard problems and their applications to cryptography

    Publication Year: 2011 , Page(s): 46 - 52
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (390 KB) |  | HTML iconHTML  

    Security of several cryptosystems rests on different computational hard problems. Many popular cryptographic schemes are based on the intractability of number theoretic problems such as factoring and discrete logarithms. These hard problems are widely believed to be intractable for classical algorithms. However, these problems may turn to be polynomial-time solvable when the quantum computer comes into existence. Therefore, it is desired to investigate new classes of alternative candidates of hard problems that have exponential complexity to both the ordinary and quantum computers, for instance, error correcting codes, lattice problems, braid groups and subset - product. In this paper, we will focus on the computationally hard problems and their applications to cryptography. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Survey on certificateless public key cryptography

    Publication Year: 2011 , Page(s): 53 - 58
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (218 KB) |  | HTML iconHTML  

    In the notion of traditional public key infrastructure (PKI), we need to deliver public keys in an authentic way. More precisely, digital certificate binds a public key with the identity of its owner. However, significant overhead is associated with managing digital certificates. For this reason, the new notion called “identity-based public key cryptography” (ID-PKC) in which bitstring of user identity (could be name, email addresses, etc) is directly being the public key. The private key generator (PKG) is responsible for creating users private keys according to their public keys (identities). As a result, the need of certificates is eliminated because the authenticity of the public key is highly achieved. On the other hand, key escrow issue exists since PKG is able to find (calculate) any user's private key. Can you imagine what a malicious or compromised PKG can do? In order to overcome this issue a new paradigm which is certificateless public key cryptography (CL-PKC) is introduced in which the private key is partially determined by the key generating centre (KGC). In this paper we study the first CL-PKC scheme which is proposed by Al-Riyami and Paterson. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Anonymous electronic voting protocol with traceability

    Publication Year: 2011 , Page(s): 59 - 66
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (299 KB) |  | HTML iconHTML  

    A new electronic voting protocol is presented by using techniques of cut-and-choose, Shamir threshold scheme, multi-party secure computation and key escrow. It satisfies most properties including anonymity, traceability, receipt-freeness etc.. In this protocol, we use secret sharing to reduce the probability of the corruption and there isn't any authority need to be highly trusted. A sub protocol for registration phase is designed to cut the vote-voter link before casting the ballot. Finally, we analyze the security in an informal way and evaluate the performance by implementing a simple process. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Understanding the security challenges of virtualized environments

    Publication Year: 2011 , Page(s): 67 - 72
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (715 KB) |  | HTML iconHTML  

    Virtualization is an emerging technology which offers organizations with a range of benefits but still suffers from some potential security challenges. This review paper mainly emphasizes on several security challenges that virtualization technology may introduce to an IT environment. However, the main contribution of the paper lies in summarizing the progress of various individuals in the field of virtualization and its security challenges. To start with, we will further our understanding of the state of knowledge for virtualization technology up until what it means today. We will then provide an in-depth explanation about the various forms of virtualization and discuss the benefits and drawbacks that accompany this form of technology. The paper will also highlight several security challenges that exist in a virtualized environment. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synchronization recovery of chaotic signal through imperfect channel using optimization approach

    Publication Year: 2011 , Page(s): 73 - 78
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (310 KB) |  | HTML iconHTML  

    The implementation of robust synchronization technique between transmitter-receiver pair in chaotic communication is the main challenge in chaotic communication system design. In this paper we present a new approach to achieve chaotic synchronization by the design of a compensator at the receiver side depending on several optimization algorithms, namely genetic algorithm GA, pattern search, and particle swarm optimization PSO. The behavior of these optimization algorithms are evaluated under the condition of imperfect linear transmitting channel with constant attenuation and offset. Our evaluation shows that the optimization algorithms can be used to accomplish robust chaotic synchronization. The simulation results verify the robustness of our approach in the three algorithms but with accuracy of the last two algorithms (pattern search and PSO) are significantly higher than GA. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Denoising algorithm for noisy chaotic signal by using wavelet transform: Comprehensive study

    Publication Year: 2011 , Page(s): 79 - 85
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (371 KB) |  | HTML iconHTML  

    Although a significant amount of research has been given to wavelet transform as a denoising technique, little has been done to apply new approach to chaotic noisy signal and most of them have a lack of details and they do not discuss the results on a complete chaotic communication system. In this paper a comprehensive study for a new approach to denoise chaotic signals by using wavelet transform has been studied. A detailed study for Lorenz chaotic signal is applied in order to obtain the optimal denoising parameters including the threshold selection rule, wavelet form, the threshold rescaling methods, and wavelet decomposition level. The validity of this approach is verified by numerical simulations. Moreover, our results can be expanded easily to other chaotic signals. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Chaos generation from 1D or 2D circuits including switches

    Publication Year: 2011 , Page(s): 86 - 90
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (690 KB) |  | HTML iconHTML  

    Generation of chaos is of the highest interest for many kind of applications as secure transmissions, image processing or telecommunications. In this paper, we continue previous studies in order to show that chaotic signals can be obtained from very simple circuits including switches. Such circuits are very easy to implement and robust chaos can be obtained, depending upon parameter values. For this aim, it is necessary to study and understand the bifurcation structures of the circuit model. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Noise-resisting ciphering based on a chaotic multi-stream pseudo-random number generator

    Publication Year: 2011 , Page(s): 91 - 96
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (324 KB) |  | HTML iconHTML  

    In this paper we propose a novel noise-resisting ciphering method resorting to a chaotic multi-stream pseudo-random number generator (denoted Cms-PRNG) detailed in the reference [13]. This Cms-PRNG co-generates an arbitrarily large number of uncorrelated chaotic sequences. These co-generated sequences are actually used in several steps of the ciphering process. Noisy transmission conditions are considered, with realistic assumptions. The efficiency of the proposed method for ciphering and deciphering is illustrated through numerical simulations based on a Cms-PRNG involving ten coupled chaotic sequences. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multicast security protocol over satellite DVB based on chaotic sequences

    Publication Year: 2011 , Page(s): 97 - 102
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (242 KB) |  | HTML iconHTML  

    The major problems of multicast satellite communications are the security and the scalability. The multicast protocols in digital video broadcasting via satellite (DVB-S) cause a massive load on the system resources, and create performance deterioration. In this paper, we propose a new encapsulation method derived from the unidirectional lightweight encapsulation (ULE) standard method, called enhanced ULE (EULE). The latter relies on the `spot beam' technology and the `label-switching' approach in order to ensure an efficient filtering and multicast forwarding. Additionally, we propose a new multicast security protocol in DVB-S which uses the EULE and provides all security services. The idea of our proposed protocol consists of using a 2-tiered architecture of independent logical key hierarchy (LKH), a satellite-layer and a terrestrial-layer. All the keys of both layers are obtained by chaotic generators. The chaos is also used to encrypt the keys and the transmitted multicast data in our system. The analysis of the proposed protocol shows that it can handle a very large multicast system securely and effectively. Simulated results reveal a low cost for data overhead and more than twofold reduction in bandwidth consumption for the key management data versus the best competitive method. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A secure public cloud storage system

    Publication Year: 2011 , Page(s): 103 - 109
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (367 KB) |  | HTML iconHTML  

    In this paper, we propose a new leakage-resilient authentication and data management system that can be regarded as a prominent solution for secure public cloud storage where a cloud service provider completely maintains/controls authentication servers as well as storages. This system not only guarantees a higher level of security against active attacks as well as leakage of stored secrets (i.e., credentials and keys) but also makes a user possible to securely store/retrieve data keys in a distributed manner. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamics of trust in Clouds — Challenges and research agenda

    Publication Year: 2011 , Page(s): 110 - 115
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (500 KB) |  | HTML iconHTML  

    This position paper focuses on deriving some of the challenges for trust establishment in Cloud Computing. We start by providing a conceptual model of Cloud infrastructure, and then discuss the dynamic nature of Cloud based on the provided model. We identify that the dynamic nature of a Cloud infrastructure is essential for its desirable properties (e.g. elasticity, resilience, availability, and reliability), but such dynamism results in novel challenges in Cloud context. Our contribution is identifying the effects of this dynamism on trust relationships, identifying the main challenges resulting from these effects and derive our research agenda. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Secured Virtual Diffused File System for the cloud

    Publication Year: 2011 , Page(s): 116 - 121
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (452 KB) |  | HTML iconHTML  

    One of the major concerns for users of public cloud storage is data confidentiality, integrity and availability. Secured Virtual Diffused File System (SVDFS) is a distributed file system which aims to address this concern by allowing users to transparently layer a secured virtual file system on top of existing public cloud infrastructure. SVDFS uses Information Dispersal Algorithm (IDA) to slice up data into multiple unrecognizable slices and “diffuse” them across multiple storage servers in one or more cloud providers. With IDA, the adversary is required to obtain a minimum number of slices as well as the information on the transform matrix to be able to reconstruct the information. IDA also provides availability of data without requiring full replication. This helps to mitigate the loss of information in case a storage server or a specific storage medium is corrupted or compromised. The proposed architecture supports a clear separation of storage owner and information owner. Unlike other IDA-based storage systems, SDVFS supports file system semantics by providing dynamic reading and writing of files which have been dispersed using IDA. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parameterized RBAC access control model for WS-BPEL orchestrated composite web services

    Publication Year: 2011 , Page(s): 122 - 127
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (167 KB) |  | HTML iconHTML  

    In complex environments multiple web services are needed to interoperate together. Web Services Business Process Execution Language (WS-BPEL) has become the de facto standard for orchestrating composite web services. Unfortunately, WS-BPEL bypasses some business mandatory security requirements such as authentication and authorization. However, there have been some initiatives to address the authorization-bypass security vulnerability in WS-BPEL through integration with access control models such as RBAC. However, the RBAC models used lack expressiveness in role definitions and in roles to permissions mappings. More so, the architectures proposed use sequential authorization that is inefficient for long running business processes. In this paper, we extend the parameterized RBAC model and integrate it with WS-BPEL. The new extended parameterized RBAC model for WS-BPEL provides restriction of access up to the level of the variables of the business process. We also provide a new algorithm for authorization enforcement that addresses limitations of exiting WS-BPEL authorization architectures. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research, design and development review of the Cloud Computing Management System (CCMS)

    Publication Year: 2011 , Page(s): 128 - 131
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (740 KB) |  | HTML iconHTML  

    Due to the vast scale of Cloud Computing systems, management of the numerous physical and virtual components may become unwieldy. Many software packages that have historically been installed on desktops / workstations for years are slowly but surely being converted to Cloud Computing solutions. The problems that are emerging today are only set to worsen as Cloud Computing becomes ever more pervasive. This paper synopsises previous investigatory research concerning these emerging problems. It then continues, to describe and review the structure and operation of the Cloud Computing Management System which utilizes an object mapping declarative language which in turn utilizes an object oriented system to support key operations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.