Collision Resistance of Hash Functions in a Weak Ideal Cipher Model
スポンサーリンク
概要
- 論文の詳細を見る
This article discusses the provable security of block-cipher-based hash functions. It introduces a new model called a weak ideal cipher model. In this model, an adversary is allowed to make key-disclosure queries to the oracle as well as encryption and decryption queries. A key-disclosure query is a pair of a plaintext and a ciphertext, and the reply is a corresponding key. Thus, in this model, a block cipher is random but completely insecure as a block cipher. It is shown that collision resistant hash functions can be constructed even in this weak model.
- The Institute of Electronics, Information and Communication Engineersの論文
- 2012-01-01
著者
-
Hirose Shoichi
Graduate School Of Engineering The Univ. Of Fukui
-
KUWAKADO Hidenori
Faculty of Engineering, Kobe University
-
Kuwakado Hidenori
Faculty Of Engineering Kobe University
関連論文
- Differentiability of four prefix-free PGV hash functions
- A note on practical key derivation functions (情報処理)
- A Note on the Strength of Weak Collision Resistance(Discrete Mathematics and Its Applications)
- An Approximate Scheme of Oblivious Transfer with Probabilistic Receipt (Information Security)
- An Approximate Scheme of Oblivious Transfer with Probabilistic Receipt
- A note on practical key derivation functions (情報セキュリティ)
- Cancellation Moderating Factor Control for DS-CDMA Non-linear Interference Canceller with Antenna Diversity Reception(Wireless Communication Technology, Multi-dimensional Mobile Information Networks)
- Multistage Interference Canceller Combined with Adaptive Array Antenna for DS-CDMA System(Special Section on Multi-dimensional Mobile Information Networks)
- Efficient Pseudorandom-Function Modes of a Block-Cipher-Based Hash Function
- Image Size Invariant Visual Cryptography (Special Section on Information Theory and Its Applications)
- Security of Modified Counter Modes(HISC2006)
- Sequential Bitwise Sanitizable Signature Schemes
- Size-Reduced Visual Secret Sharing Scheme(Discrete Mathematics and Its Applications)
- Transitive Signature Scheme for Directed Trees
- Polynomial Representation of a Visual Secret Sharing Scheme and Its Application
- A-7-1 Related-Key Cube Attack on KATAN48
- A Note on Practical Key Derivation Functions
- An AES Based 256-bit Hash Function for Lightweight Applications: Lesamnta-LW
- Collision Resistance of Hash Functions in a Weak Ideal Cipher Model
- An AES Based 256-bit Hash Function for Lightweight Applications : Lesamnta-LW
- 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
- Visual Commitment Using the Trusted Initializer
- Lightweight Hashing Mode Using Lesamnta-LW Compression Function and MDP Domain Extension
- Multilane Hashing Mode Suitable for Parallel Processing
- Lightweight Hashing Mode Using Lesamnta-LW Compression Function and MDP Domain Extension (ライフインテリジェンスとオフィス情報システム)
- On the Security of the ElGamal-Type Signature Scheme with Small Parameters (Special Section on Cryptography and Information Security)
- On the Security of the Improved Knapsack Cryptosystem (Special Section on Information Theory and Its Applications)