In this paper we (1) argue the benefits of replacing the current MD transform with a multi-property-preserving domain extension transform that guarantees numerous properties of the hash function assuming they hold of the compression function; (2) provide a practical, proven-secure multi-domain extension transform suitable for use with the next generation of hash functions; (3) point to some sub...

This paper describes a simple candidate one-way hash function which satisfies a quasi-commutative property that allows it to be used aa an accumulator. This property allows protocols to be developed in which the need for a trusted central authority can be eliminated. Spaceefficient distributed protocols are given for document time stamping and for membership testing, and many other applications...

In this paper, we present improved preimage attacks on the reduced-round GOST hash function family, which serves as the new Russian hash standard, with the aid of techniques such as the rebound attack, the Meet-in-the-Middle preimage attack and the multicollisions. Firstly, the preimage attack on 5-round GOST-256 is proposed which is the first preimage attack for GOST-256 at the hash function l...

Random key pre-distribution schemes are vulnerable to collusion attacks. In this paper, we propose a new key management scheme for ubiquitous heterogeneous sensor networks consisting of a small number of powerful high-end H-sensors and a large number of ordinary low-end L-sensors. The collusion attack on key pre-distribution scheme mainly takes advantage of the globally applicable keys, which a...

This paper presents an efficient group key management protocol, CKCS (Code for Key Calculation in Simultaneous join/leave) for simultaneous join/leave in secure multicast. This protocol is based on logical key hierarchy. In this protocol, when new members join the group simultaneously, server sends only the group key for those new members. Then, current members and new members calculate the nec...

A random key pre-distribution scheme based on key updating (RKKU) was proposed, which is effective in wireless sensor networks. Firstly, the base station will randomly distribute some keys, a hash function and some code slices to each node. Furthermore, the RKKU scheme compares with the information of some random key to find the same key, and computes the communication key between two sensor no...

This paper describes a second preimage attack on the CubeHash cryptographic one-way hash function. The attack finds a second preimage in less time than brute force search for these CubeHash variants: CubeHash r/b-224 for b > 100; CubeHashr/b-256 for b > 96; CubeHashr/b-384 for b > 80; and CubeHashr/b-512 for b > 64. However, the attack does not break the CubeHash variants recommended for SHA-3....

Security algorithms or cryptography enables secure communication between two parties in the presence of a thirdparty or an eavesdropper. It assures the recipient of the message of the authenticity of the claimed source, protects the message against the unauthorized release of the message content by the adversaries, limits the access to authorized users, protects against sender/receiver denying ...

A fundamental result in cryptography is that a digital signature scheme can be constructed from an arbitrary one-way function. A proof of this somewhat surprising statement follows from two results: first, Naor and Yung defined the notion of universal one-way hash functions and showed that the existence of such hash functions implies the existence of secure digital signature schemes. Subsequent...

We outline constructions for both pseudo-random generators and one-way hash functions. These constructions are based on the exact TSP (XTSP), a special variant of the well known traveling salesperson problem. We prove that these constructions are secure if the XTSP is infeasible. Our constructions are easy to implement, appear to be fast, but require a large amount of memory.