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

Posted by

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

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 data, Asiacrypt 2013, held in Bengaluru, India, in December 2013. The fifty four revised complete papers provided have been conscientiously chosen from 269 submissions. they're prepared 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 established 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

Best international_1 books

Smart Graphics: 10th International Symposium, SG 2009, Salamanca, Spain, May 28-30, 2009. Proceedings

This booklet constitutes the refereed complaints of the tenth overseas Symposium on shrewdpermanent snap shots, SG 2009, held in Salamanca, Spain in may well 2009. The 15 revised complete papers including eight brief papers and a couple of demonstrations awarded have been conscientiously reviewed and chosen. The papers are prepared in topical sections on visible analytics, consumer stories, human machine interplay, special effects and synthetic intelligence, in addition to digital and combined fact.

Personal Wireless Communications: The 12th IFIP International Conference on Personal Wireless Communications (PWC 2007), Prague, Czech Republic, September 2007

Overseas Federation for info ProcessingThe IFIP sequence publishes state of the art leads to the sciences and applied sciences of knowledge and communique. The scope of the sequence contains: foundations of desktop technology; software program conception and perform; schooling; machine functions in expertise; communique platforms; platforms modeling and optimization; details structures; desktops and society; computers expertise; defense and safety in info processing platforms; synthetic intelligence; and human-computer interplay.

E-Business and Telecommunications: International Joint Conference, ICETE 2012, Rome, Italy, July 24--27, 2012, Revised Selected Papers

This e-book constitutes the refereed lawsuits of the ninth foreign Joint convention on E-Business and Telecommunications, ICETE 2012, held in Rome, Italy, in July 2012. ICETE is a joint foreign convention integrating 4 significant components of data which are divided into six corresponding meetings: foreign convention on facts verbal exchange Networking, DCNET; foreign convention on E-Business, ICE-B; foreign convention on Optical conversation platforms, OPTICS; overseas convention on protection and Cryptography, SECRYPT; foreign convention on instant info platforms, WINSYS; and foreign convention on sign Processing and Multimedia, SIGMAP.

Additional resources 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

Sample text

F (C, M ) = EC (M ) ⊕ C ⊕ M . Starting from a constant initial value C0 = IV , the chaining value is updated for each of the message block Ci+1 = F (Ci , Mi ). After all message blocks are processed, the final chaining value is used as the hash value. The underlying block cipher uses an AES-like structure with an 8 × 8 byte matrix. , Ki+1 = AC ◦ MR ◦ SC ◦ SB(Ki ), for i ∈ {0, 1, . . , 9}. • • • • SubBytes(SB): apply an Sbox to each byte. ShiftColumns(SC): cyclically rotate the j-th column downwards by j bytes.

The [1] message block is used to quit the cycle and randomize the entry point to return again in the giant component. We give below a detailed attack procedure and complexity analysis. Fig. 2. Distinguishing-H attack This attack is very interesting as the first generic distinguishing-H attack on HMAC and NMAC with a complexity lower than 2l . However, we note that the very long message length might be a limitation. In theory this is of no importance and our attack is indeed valid, but in practice some hash functions forbid message inputs longer than a certain length.

References 1. : New Proofs for NMAC and HMAC: Security Without CollisionResistance. In: Dwork, C. ) CRYPTO 2006. LNCS, vol. 4117, pp. 602–619. Springer, Heidelberg (2006) 2. : Keying Hash Functions for Message Authentication. In: Koblitz, N. ) CRYPTO 1996. LNCS, vol. 1109, pp. 1–15. Springer, Heidelberg (1996) 3. Brassard, G. ): CRYPTO 1989. LNCS, vol. 435. Springer, Heidelberg (1990) 4. : A Design Principle for Hash Functions. In: [3], pp. 416–427 5. 11-94: Hash Function Algorithm. RFC 5831 (Informational) (March 2010) 6.

Download PDF sample

Rated 4.38 of 5 – based on 41 votes