搜索结果: 16-30 共查到“军事学 indifferentiability”相关记录37条 . 查询时间(0.057 秒)
Indifferentiability of 8-Round Feistel Networks
Indifferentiability 8-Round Feistel Networks
2015/12/21
We prove that a balanced 8-round Feistel network is indifferentiable from a random permutation.
This result comes on the heels of (and is part of the same body of work as) a 10-round
indifferentiabi...
The indifferentiability framework by Maurer, Renner and Holenstein (MRH; TCC 2004) formalizes a sufficient condition to safely replace a random oracle by a construction based on a (hopefully) weaker a...
The equivalence of the random-oracle model and the ideal-cipher model has been studied in a long series of results. Holenstein, Künzler, and Tessaro (STOC, 2011) have recently completed the picture po...
On the Indifferentiability of Key-Alternating Ciphers
foundations / Even-Mansour ideal cipher key alternating cipher indifferentiability
2013/2/21
The Advanced Encryption Standard (AES) is the most widely used block cipher. The high level structure of AES can be viewed as a (10-round) key-alternating cipher, where a t-round key-alternating ciphe...
Indifferentiability Security of the Fast Widepipe Hash: Breaking the Birthday Barrier
secret-key cryptography / Hash Function Birthday Barrier Indifferentiability Framework
2012/6/14
A hash function secure in the indifferentiability framework (TCC 2004) is able to resist all (meaningful) generic attacks. Such hash functions also play a crucial role in establishing security of the ...
Indifferentiability Security of the Fast Widepipe Hash: Breaking the Birthday Barrier
secret-key cryptography / Hash Function Birthday Barrier Indifferentiability Framework
2012/3/22
The main result of the paper is the solution to a longstanding open problem in the hash function literature: to show that an n-bit iterative hash function can achieve both the rate 1 efficiency, and t...
Indifferentiability Security of the Fast Widepipe Hash: Breaking the Birthday Barrier
secret-key cryptography / Hash Function Birthday Barrier Indifferentiability Framework
2012/3/21
The main result of the paper is the solution to a longstanding open problem in the hash function literature: to show that an n-bit iterative hash function can achieve both the rate 1 efficiency, and t...
The hash algorithm BLAKE, one of the SHA-3 finalists, was designed by Aumasson, Henzen, Meier, and Phan. Unlike other SHA-3 finalists, there is no known indifferentiable security proof on BLAKE. In th...
The hash algorithm BLAKE, one of the SHA-3 finalists, was designed by Aumasson, Henzen, Meier, and Phan. Unlike other SHA-3 finalists, there is no known indifferentiable security proof on BLAKE. In th...
The hash algorithm BLAKE, one of the SHA-3 finalists, was designed by Aumasson, Henzen, Meier, and Phan. Unlike other SHA-3 finalists, there is no known indifferentiable security proof on BLAKE. In th...
On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction
foundations / indifferentiability correlation intractability Feistel construction
2012/3/26
We show that the Feistel construction with six rounds and random round functions is publicly indifferentiable from a random invertible permutation (a result that is not known to hold for full indiffer...
Careful with Composition: Limitations of Indifferentiability and Universal Composability
Limitations of Indifferentiability Universal Composability
2011/7/25
We exhibit a hash-based storage auditing scheme which is provably secure in the random-oracle model (ROM), but easily broken when one instead uses typical indifferentiable hash constructions.
Careful with Composition: Limitations of Indifferentiability and Universal Composability
Universal Composability Limitations of Indifferentiability
2012/3/27
We exhibit a hash-based storage auditing scheme which is provably secure in the random-oracle model (ROM), but easily broken when one instead uses typical indifferentiable hash constructions. This con...
On the Indifferentiability of the Gr{\o}stl Hash Function
secret-key cryptography hash functions indifferentiability SHA-3 Groestl
2010/7/13
The notion of indifferentiability, introduced by Maurer et al., is an important criterion for the security of hash functions. Concretely, it ensures that a hash function has no structural design flaws...
Revisiting the Indifferentiability of PGV Hash Functions
Indifferentiability PGV Hash Functions PGV
2009/6/15
In this paper, first we point out some flaws in the existing indifferentiability simulations of the pf-MD and
the NMAC constructions, and provide new differentiable attacks on the hash functions base...