Compression Functions Suitable for the Multi-Property-Preserving Transform
スポンサーリンク
概要
- 論文の詳細を見る
Since Bellare and Ristenpart showed a multi-property preserving domain extension transform, the problem of the construction for multi-property hash functions has been reduced to that of the construction for multi-property compression functions. However, the Davies-Meyer compression function that is commonly used for standard hash functions is not a multi-property compression function. That is, in the ideal cipher model, the Davies-Meyer compression function is collision resistant, but it is not indifferentiable from a random oracle. In this paper, we show that the compression function proposed by Lai and Massey is a multi-property compression function. In addition, we show that the simplified version of the Lai-Massey compression function is also a multi-property compression function. The use of these compression functions enables us to construct multi-property hash functions by the multi-property preserving domain extension transform.
- 社団法人電子情報通信学会の論文
- 2008-10-01
著者
-
KUWAKADO Hidenori
Graduate School of Engineering, Kobe University
-
MORII Masakatu
Graduate School of Engineering, Kobe University
-
Morii Masakatu
Graduate School Of Engineering Kobe University
-
Kuwakado Hidenori
Graduate School Of Engineering Kobe University
関連論文
- Differentiability of four prefix-free PGV hash functions
- A Chosen-IV Key Recovery Attack on Py and Pypy
- A Chosen-IV Key Recovery Attack on Py and Pypy
- Efficient Pseudorandom-Function Modes of a Block-Cipher-Based Hash Function
- A-6-8 Improved Bitslice Network for Computing the TIB3 S-Box
- Fast WEP-Key Recovery Attack Using Only Encrypted IP Packets
- Reversible Watermark with Large Capacity Based on the Prediction Error Expansion
- Fingerprinting Protocol Based on Distributed Providers Using Oblivious Transfer(Cryptography,Information Theory and Its Applications)
- Reversible Watermark with Large Capacity Based on the Prediction Error
- Reversible Watermark with Large Capacity Using the Predictive Coding
- S-Box Bitslice Networks as Network Computing
- New Weakness in the Key-Scheduling Algorithm of RC4
- Internal-State Reconstruction of a Stream Cipher RC4(Information Security)(Information Theory and Its Applications)
- Compression Functions Suitable for the Multi-Property-Preserving Transform
- Systematic Generation of Tardos's Fingerprint Codes
- A Probabilistic Algorithm for Computing the Weight Distribution of LDPC Codes
- On the Condition for Detecting (t+μ)-error by Reed-Solomon Decoder Based on the Welch-Berlekamp Algorithm
- Generalized Classes of Weak Keys on RC4 Using Predictive State
- Irreducible m-Term Polynomial and Its Application to Multiplication over GF(2^m)
- A-7-1 Related-Key Cube Attack on KATAN48
- Cryptanalysis for RC4 and Breaking WEP/WPA-TKIP
- Falsification Attacks against WPA-TKIP in a Realistic Environment
- An AES Based 256-bit Hash Function for Lightweight Applications: Lesamnta-LW
- An AES Based 256-bit Hash Function for Lightweight Applications : Lesamnta-LW
- On the Probabilistic Computation Method with Reliability for the Weight Distribution of LDPC Codes
- A Block-Cipher-Based Hash Function Using an MMO-Type Double-Block Compression Function
- A Block-Cipher-Based Hash Function Using an MMO-Type Double-Block Compression Function
- A Block-Cipher-Based Hash Function Using an MMO-Type Double-Block Compression Function
- Secure Regenerating Codes Based on Rashmi-Shah-Kumar MBR Codes
- Comprehensive Analysis of Initial Keystream Biases of RC4
- Anonymous Authentication Scheme without Verification Table for Wireless Environments