نتایج جستجو برای: one way hash function

تعداد نتایج: 3241299  

2009
Rune Steinsmo Ødegård Danilo Gligoroski

EDON-R is one of the candidate hash functions for the ongoing NIST competition for the next cryptographic hash standard called SHA-3. Its construction is based on algebraic properties of non-commutative and non-associative quasigroups of orders 2 and 2. In this paper we are giving some of our results in investigation of the randomness and regularity of reduced EDON-R compression functions over ...

Journal: :Journal of Computer Security 1997
Jean-Jacques Quisquater Marc Joye

This paper presents an interesting application of the Tillich-Zémor function TZ . In particular, we emphasize the concatenation property of this one-way hash function, i.e. TZ(S | T ) = TZ(S) TZ(T ) where S and T are two binary strings. This property is combined with a multisignature scheme in a journalism context. The aim is to authenticate reports or interviews.

Journal: :IACR Cryptology ePrint Archive 2010
Iftach Haitner Thomas Holenstein Omer Reingold Salil P. Vadhan Hoeteck Wee

This paper revisits the construction of Universal One-Way Hash Functions (UOWHFs) from any one-way function due to Rompel (STOC 1990). We give a simpler construction of UOWHFs, which also obtains better efficiency and security. The construction exploits a strong connection to the recently introduced notion of inaccessible entropy (Haitner et al. STOC 2009). With this perspective, we observe tha...

Ali Saeidi Rashkolia Masoud Hadian Dehkordi Mohammad Mahdi Zahedi,

In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...

Journal: :International Journal of Future Computer and Communication 2014

2006
Ron Steinfeld Josef Pieprzyk Huaxiong Wang

Universal One-Way Hash Functions (UOWHFs) may be used in place of collision-resistant functions in many public-key cryptographic applications. At Asiacrypt 2004, Hong, Preneel and Lee introduced the stronger security notion of higher order UOWHFs to allow construction of long-input UOWHFs using the Merkle-Damg̊ard domain extender. However, they did not provide any provably secure constructions f...

Journal: :I. J. Network Security 2006
Min-Shiang Hwang Pei-Chen Sung

Electronic payment systems have gradually become an important issue nowadays because of the popularity and importance of electronic commerce on the Internet. Security and convenience related topics are the most important issues that concern people. The electronic micropayment is one of the most popular research topics on electronic commerce. Recently, many efficient micropayment schemes, based ...

Journal: :IACR Cryptology ePrint Archive 2004
Mridul Nandi

A double length hash function is a 2n-bit hash function based on an n-bit compression function. To increase the security level, designs of good double length hash functions are important. In this paper we construct a class of maximally secure double length hash functions in random oracle model based on some good permutations. This class contains recently proposed double length hash functions [1...

2007
Al-Sakib Khan Pathan Choong Seon Hong

The sensor reports from a wireless sensor network are often used extensively in the decision making process in many systems and applications. Hence, classifying real and false sensor reports is necessary to avoid unwanted results. In this paper, we propose a scheme for securing the sensor reports in a wireless sensor network. We use one-way hash chain and pre-stored shared secret keys to provid...

2009
Mario Lamberger Florian Mendel

The recently started SHA-3 competition in order to find a new secure hash standard and thus a replacement for SHA-1/SHA-2 has attracted a lot of interest in the academic world as well as in industry. There are 51 round one candidates building on sometimes very different principles. In this paper, we show how to attack two of the 51 round one hash functions. The attacks have in common that they ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید