搜索结果: 1-6 共查到“密码学 preimage resistance”相关记录6条 . 查询时间(0.053 秒)
Decisional second-preimage resistance: When does SPR imply PRE?
cryptographic hash functions preimage resistance second-preimage resistance
2019/5/21
There is a well-known gap between second-preimage resistance and preimage resistance for length-preserving hash functions. This paper introduces a simple concept that fills this gap. One consequence o...
Characterizing Collision and Second-Preimage Resistance in Linicrypt
collision resistance second-preimage resistance
2018/5/22
Linicrypt (Carmer & Rosulek, Crypto 2016) refers to the class of algorithms that make calls to a random oracle and otherwise manipulate values via fixed linear operations. We give a characterization o...
Preimage Resistance Beyond the Birthday Barrier -- The Case of Blockcipher Based Hashing
Hash Function Preimage Resistance Block Cipher Beyond Birthday Bound Foundations
2010/10/14
We provide the first preimage resistance bounds for block cipher based double length, double call hash functions that go \emph{beyond} the birthday bound. More precisely, we consider hash functions us...
Adaptive Preimage Resistance and Permutation-based Hash Functions
hash function indifferentiability blockcipher provable security
2009/6/11
In this paper, we introduce a new notion of security, called adaptive preimage
resistance. We prove that a compression function that is collision resistant and adaptive
preimage resistant can be com...
Cryptographic Hash-Function Basics:Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance,and Collision Resistance
collision resistance cryptographic hash functions preimage resistance
2009/3/23
We consider basic notions of security for cryptographic hash functions: collision resistance,
preimage resistance, and second-preimage resistance. We give seven different definitions that
correspond...
Improved Collision and Preimage Resistance Bounds on PGV Schemes
Hash Function Block Cipher M-D Construction
2009/1/7
Preneel, Govaerts, and Vandewalle[14](PGV) considered 64
most basic ways to construct a hash function from a block cipher, and
regarded 12 of those 64 schemes as secure. Black, Pogaway and Shrimp-
...