Titlebook: Information Security and Privacy; 13th Australasian Co Yi Mu,Willy Susilo,Jennifer Seberry Conference proceedings 2008 Springer-Verlag Berl

真實(shí)的你

Fully-Simulatable Oblivious Set Transfer,f the notions of oblivious bit transfer and oblivious string transfer protocols. The security of oblivious set transfer protocols is defined in the real/ideal world simulation paradigm. We show that oblivious set transfer protocols that are provably secure in the full simulation model can be efficie

驚奇

Carcinoma

幻影

Methods for Linear and Differential Cryptanalysis of Elastic Block Ciphers,to construct a family of ciphers in a uniform manner. The family is parameterized by block size, for any size between . and 2.. The design assures that the overall workload for encryption is proportional to the block size. When considering the approach taken in elastic block ciphers, the question ar

aspect

Multidimensional Linear Cryptanalysis of Reduced Round Serpent,paper we present a new truly multidimensional approach to generalise Matsui’s Algorithm 1. We derive the statistical framework for it and show how to calculate multidimensional probability distributions based on correlations of one-dimensional linear approximations. The main advantage is that the as

NOT

Cryptanalysis of Reduced-Round SMS4 Block Cipher, SMS4 was not released until January 2006, there have been only a few papers analyzing this cipher. In this paper, firstly we present a kind of 5-round iterative differential characteristic of SMS4 whose probability is about 2.. Then based on this kind of iterative differential characteristic, we pr

intuition

On the Unprovable Security of 2-Key XCBC,. After Black and Rogaway’s XCBC, Moriai and Imai proposed 2-Key XCBC, which replaced the third key of XCBC with its first key. Moriai and Imai “proved” that 2-Key XCBC is secure if the underling blockcipher is a pseudorandom permutation (PRP). Our research shows that it is not the case. The securit

歌劇等

Looking Back at a New Hash Function, process. We explore the computational trade-off between the key schedule and encryption in a block cipher-based hash function and we illustrate our approach with a 256-bit hash function that has a hashing rate equivalent to the encryption rate of AES-128. The design extends naturally to a 512-bit h

Reverie

Non-linear Reduced Round Attacks against SHA-2 Hash Family,ions. Recently, at FSE ’08, an attack against reduced round SHA-256 was presented by Nikoli? and Biryukov which used a local collision which is valid for the actual SHA-256 function. It is a 9-step local collision which starts by introducing a modular difference of 1 in the two messages. It succeeds

evince

978-3-540-69971-2Springer-Verlag Berlin Heidelberg 2008