Gaëtan Leurent, Thomas Peyrin, Lei Wang (auth.), Kazue Sako,'s Advances in Cryptology - ASIACRYPT 2013: 19th International PDF

By Gaëtan Leurent, Thomas Peyrin, Lei Wang (auth.), Kazue Sako, Palash Sarkar (eds.)

ISBN-10: 3642420443

ISBN-13: 9783642420443

ISBN-10: 3642420451

ISBN-13: 9783642420450

The two-volume set LNCS 8269 and 8270 constitutes the refereed lawsuits of the nineteenth overseas convention at the thought and alertness of Cryptology and data, Asiacrypt 2013, held in Bengaluru, India, in December 2013. The fifty four revised complete papers offered have been conscientiously chosen from 269 submissions. they're geared up in topical sections named: zero-knowledge, algebraic cryptography, theoretical cryptography, protocols, symmetric key cryptanalysis, symmetric key cryptology: schemes and research, side-channel cryptanalysis, message authentication codes, signatures, cryptography dependent upon actual assumptions, multi-party computation, cryptographic primitives, research, cryptanalysis and passwords, leakage-resilient cryptography, two-party computation, hash functions.

Show description

Read Online or Download Advances in Cryptology - ASIACRYPT 2013: 19th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, December 1-5, 2013, Proceedings, Part II PDF

Similar international_1 books

Get Advances in Cryptology - ASIACRYPT 2013: 19th International PDF

The two-volume set LNCS 8269 and 8270 constitutes the refereed lawsuits of the nineteenth foreign convention at the concept and alertness of Cryptology and knowledge, Asiacrypt 2013, held in Bengaluru, India, in December 2013. The fifty four revised complete papers provided have been conscientiously chosen from 269 submissions.

Hans Georg Bock, Xuan Phu Hoang, Rolf Rannacher, Johannes P.'s Modeling, Simulation and Optimization of Complex Processes - PDF

This complaints quantity gathers a range of papers provided on the 5th foreign convention on excessive functionality medical Computing, which came about in Hanoi on March 5-9, 2012. The convention used to be geared up by way of the Institute of arithmetic of the Vietnam Academy of technology and expertise (VAST), the Interdisciplinary heart for clinical Computing (IWR) of Heidelberg collage, Ho Chi Minh urban collage of expertise, and the Vietnam Institute for complex research in arithmetic.

Extra info for Advances in Cryptology - ASIACRYPT 2013: 19th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, December 1-5, 2013, Proceedings, Part II

Example text

Otherwise, go back to the previous step. 3 13 Complexity and Success Probability Analysis Complexity. We would like to evaluate the complexity of the attack. The first step will require about 2l/2 offline computations to find the cycle. Again, it is important to note that we can run this first step several times in order to ensure that we are using the cycle from the biggest component of the functional graph of h[0] . 14, until it finds a succeeding message block m. Therefore, after trying a few m values, we have probability very close to 1 to find a valid one.

Instead of generating collisions as for recovering Kin , we will first recover the values of an intermediate chaining variable of the outer hash function, and then find a near collision on this intermediate chaining variable. The other attack is to recover the key of HMAC. Recall that Kin = F (IV, K ⊕ ipad), recovering K from Kin is similar to inverting F (IV, ·) to find a preimage of Kin . Thus we apply an attack similar with the splice-and-cut preimage attack to recover K from Kin . To our best knowledge, this is the first result of recovering the (original) key of HMAC, while previous results [11,22,23,29] only succeeded in recovering the equivalent keys.

One may doubt the large size of the key and the tag. We would like to point out that besides pure theoretical research interests, evaluating such an instance of HMAC-Whirlpool also has practical impacts. This is due to the fact that ever since HMAC was designed and standardized, it has been widely implemented beyond the mere MAC applications. For example, the above instance of HMAC-Whirlpool will be used in HMAC-based Extract-and-Expand Key Derivation Function (HKDF) [15] if one instantiates this protocol with Whirlpool hash function, providing that Whirlpool is a long-stand secure hash function and has been implemented in many cryptographic software library.

Download PDF sample

Advances in Cryptology - ASIACRYPT 2013: 19th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, December 1-5, 2013, Proceedings, Part II by Gaëtan Leurent, Thomas Peyrin, Lei Wang (auth.), Kazue Sako, Palash Sarkar (eds.)


by Paul
4.1

Rated 4.70 of 5 – based on 40 votes