Special Hash Function Research Articles

Optimizing the Performance of Clouds Using Hash Codes in Apache Hadoop and Spark

Hash functions are an integral part of MapReduce software, both in Apache Hadoop and Spark. If the hash function performs badly, the load in the reduced part will not be balanced and access times will spike. To investigate this problem further, we ran the Wordcount program with numerous different hash functions on Amazon AWS. In particular, we will leverage the Amazon Elastic MapReduce framework. The paper investigates the general purpose, cryptographic, checksum, and special hash functions. Through the analysis, we present the corresponding runtime results.

Efficient Proxy Signature Scheme for Mobile Devices from Bilinear Pairings

A proxy signature scheme is useful and convenient because it allows a proxy signer to sign a message on behalf of an entity. This study proposes a novel efficient proxy signature scheme for mobile devices using bilinear pairings. The computational cost of the proposed signature scheme is extremely low, and the length of the proposed signature is limited. In addition, our scheme does not require a special hash function, namely the Map-To-Point hash function. We also show that the proposed scheme is secure against adaptive chosen message attacks under a random oracle. DOI: http://dx.doi.org/10.5755/j01.itc.42.4.1969

A Pairing-Based Blind Signature E-Voting Scheme

Nowadays, electoral processes can be automated, using electronic devices and communication networks. The electronic voting systems allow easy voter casting and fast vote counting for electoral entities. In this paper, an electronic voting scheme is proposed, it performs the communication among voters and electoral entities with a minimal number of phases and cryptographic operations. The scheme uses a combination of the blind signature scheme proposed by Boldyreva in 2003 and the short signature proposed by Boneh–Lynn–Shacham in 2001. Both signatures use pairing-based cryptography and a special hash function known as map-to-point. The scheme generates small ballots which consist of just two messages, one blind signature and one short signature. We present experimental data showing that our pairing-based scheme is considerably more efficient than other blind signature e-voting schemes recently proposed whose security is based on the integer factorization problem or on the discrete logarithm problem over prime fields.

A Novel Practical Certificate-Less Digital Signing System Based on Super-Elliptic Bilinear Map Parings

In this paper, we propose a novel practical Certificate-Less digital signing system based on bilinear map pairings defined on super elliptic curve, which is proved more efficiency than some similar systems pioneered heretofore as viewed from information security application widely applied in mobile-thin computation environment often with a narrow communication bandwidth concomitant. For a long span, the complex managing public key certificate job involved in crypto-system based on identity has been keeping from a more efficient digital signing and disturbing engineers engaging in designing secure mobile E-Commerce. By this scheme, signing subroutine can be in no need of pairscomputation, and verifying can be performed only at cost of 3 times pairs-computation while not introducing special hash function, a necessity in some similar schemes initiated in some references. With respect to security, the system manifests a satisfying immunity from Replacing Public Key Attack, Forging Signature Attack and some other typical attack methods from angle of computability of NP-problem and of provable security. By comparison and analysis in detail and in depth, it is made clear that the signing system can provide a favorable macro-availability and performance, and be fit to be promoted into the application of mobile ECommerce and some similar requirements.

A New Short Signature Scheme with Random Oracle from Bilinear Pairings

In this paper, we propose a new and efficient short signature scheme from the bilinear pairings. Our scheme is constructed by bilinear inverse-square Diffie-Hellman problem (BISDHP) and does not require any special hash function. The exact security proofs are also explained in the random Oracle model. We give the implementation and comparison results of our proposed signature scheme with the signature scheme proposed by Boneh, Lynn, Shacham (BLS) and Zhang, Safavi, Susilo (ZSS). Furthermore, we use this signature scheme to construct a ring signature scheme.

An Efficient Identity-based Signature Scheme and Its Applications

Mapping messages or user's identity into a point on elliptic curves is required in many pairing-based cryptographic schemes. In most of these pairing-based schemes, this requirement is realized by a special hash function called MapToPoint function. However, the efficiency of the MapToPoint function is much lower than the general hash functions. In this paper, we propose a new identity-based signature (IBS) scheme without MapToPoint function, which speeds up extracting the secret key and verifying the signatures. The security of the proposed scheme depends on a complex assumption similar to k-CAA. Another benefit of the proposed scheme is that it supports batch verifications such that multiple signatures of distinct messages for distinct users are verified simultaneously. The results show that batch verifications on the proposed IBS scheme is much faster than other IBS schemes. Furthermore, the proposed scheme is used to construct an efficient chameleon signature scheme by cooperating with an identity-based chameleon hash function.

On the Use of Hash Functions as Preprocessing Algorithms to Detect Defects on Repeating Definite Textures

Hash functions are one way functions and often used in cryptography to ensure the integrity of files by creating a binary signature specific to that file. In a similar way, a family of special hash functions can be developed and used to generate one dimensional signatures of an image. The resultant signatures can then be used to compare the image either to a golden template or, if the image consists of repeating definite patterns, then to the texture itself. While such hash functions are sensitive enough to detect small changes and defects in repeating texture, they are immune to changes in illumination and contrast. In this paper we discuss the generation of suitable hash functions for textured images, which are simple enough to fit into a very small FPGA, and provide several examples of their use.