Search

This paper introduced a condition called R-condition under which (r, s, t)- inverse quasigroups are universal. Middle isotopic (r, s, t)-inverse loops, satisfying the R-condition and possessing a trivial set of r-weak inverse permutations were shown to be isomorphic; isotopy-isomorphy for (r, s, t)-inverse loops. Isotopy-isomorphy for (r, s, t)- inverse loops was generally characterized. With the R-condition, it was shown that for positive integers r, s and t, if there is a (r, s, t)-inverse quasigroup of order 3k with an inverse-cycle of length gcd(k, r+s+t) > 1, then there exists an (r, s, t)-inverse quasigroup of order 3k with an inverse-cycle of length gcd k(r + s + t),(r + s + t) ² ) . The procedure of application of such (r, s, t)-inverse quasigroups to cryptography was described and explained, while the feasibility of such (r, s, t)-inverse quasigroups was illustrated with sample values of k, r, s and t. [ABSTRACT FROM AUTHOR]

Leakage power analysis (LPA) attacks aim at finding the secret key of a cryptographic device from measurements of its static (leakage) power. This novel power analysis attacks take advantage of the dependence of the leakage power of complementary metal oxide semiconductor (CMOS) integrated circuits on the data they process. This paper proposes symmetric dual-rail logic (SDRL), a standard cell LPA attack countermeasure that theoretically resists the LPA attacks. The technique combines standard building blocks to make new compound standard cells, which are close to constant leakage power consumption. Experiment results show SDRL is a promising approach to implement an LPA-resistant crypto processor. [ABSTRACT FROM AUTHOR]

Abstract: A mixed scrambling operation is defined by the use of Arnold transform and Baker mapping. Following a designed sequence, the combined scrambling operation is utilized for changing the pixel position of secret image under the control of a random matrix. At the same time, the pixel value is altered by random bit shift for obtaining an encrypted image encoded in N-bit data. The operations mentioned above are employed for all pixels of original secret image. Finally an encrypted image is obtained and encoded into N-bit data being from the input image. Some numerical simulations have been achieved for checking the performance of the image hiding scheme. [Copyright &y& Elsevier]

The only known construction of identity-based blind signature schemes that are secure in the standard model is based on the generic approach of attaching certificates to ordinary (i.e. non-identity-based) blind signature schemes, and thus the identity-based blind signature schemes constructed using this method are somewhat inefficient and have long signature size. In this paper, we present the first direct construction of an identity-based blind signature scheme based on Waters' recently proposed identity-based encryption scheme and Paterson-Schuldt's ID-based signature. Our identity-based blind signature scheme is communicationally efficient and only needs two data exchanges between the signer and the user, and the signatures are short. We prove that our scheme is concurrently secure in the standard model assuming that the computational Diffie-Hellman problem is hard. [ABSTRACT FROM AUTHOR]

Abstract: In proxy signature schemes, original signers delegate proxy signers to sign messages on behalf of original signers. Currently, most proxy signature schemes are based on the difficulty of discrete logarithms over finite field or ellipse curve addition group. Based on the difficulty of factorings of large integers, one normal proxy signature scheme and one multi-proxy signature scheme are proposed. The security properties of strong unforgeability, verifiability, strong nonrepudiation, strong identifiability, distinguishability and prevention of misuse of proxy signing power can be fulfilled by the proposed schemes. In addition, the performance of the proposed schemes is analysed as well. [Copyright &y& Elsevier]

An authenticated multiple-key agreement protocol enables two entities to authenticate each other and establish multiple common keys in a two-pass interaction, and a protocol without using a conventional hash function simplifies its security assumption on only public hard problem. In 2001, Yen et al. proposed an improved multiple-key agreement protocol to overcome the attacks that break the previous variants. However, the authors show that an impersonator can easily forge message without being detected, and can establish common session keys with the communicating party. To overcome all the weakness, we propose an improved scheme that also achieves better key utilization, compared to the previous variants. [Copyright &y& Elsevier]

This paper presents a construction of 2-(2 n −1, n,λ) designs and gives the polynomial description of this class of designs. The construction applies to the cases of all integer n≥2. [ABSTRACT FROM AUTHOR]

In recent times, Internet connected technologies and applications have seen tremendous growth as everyone is inclined to enjoy the benefits offered by them. An upcoming technology called Internet of Things (IoT) has increased the capacity of internet to take in numerous computing devices. With respect to the prevailing IP-based Security Protocol (Sec P) suites, which rely on the conventions of Network Topology (NT) and device and network (n/w) abilities to decide on the designs of the employed Security Mechanisms (Sec M). In this work, we address by putting forth a unified IoT framework model dependent on the Mobile Security IP IoT Architecture (MSIP-IoT-A) which exclusively concentrates on supporting Sec for the IoT. The model suggested by us, brings together local IoT systems with the global Internet with no loss in its usage, ability of cross operation and protecting the Sec. An Internet of Things (IOT) – Name Determination Check (NDC) is proposed as the main part of the middleware layer by us in this article and we also generate a We propose an IoT-NDC as a core component of the, and develop a not so heavy but light keying protocol capable of establishing a trust amid an IoT device and the IoT-NDC. Moreover, we attempt of identify and fix this issue by suggesting a peer-to-peer SecP for fulfilling a range of environment. We have applied safe communication (comm.) upon an open sourced platform for the IoT. Ultimately, with assessment and studies with the help of models and data from the SecPlogic, we conclude that the suggested methodology is effective to fulfill the mentioned objective and can be used for the platform. [ABSTRACT FROM AUTHOR]