[Resource Topic] 2017/831: Security Proof of JAMBU under Nonce Respecting and Nonce Misuse Cases

Welcome to the resource topic for 2017/831

Title:
Security Proof of JAMBU under Nonce Respecting and Nonce Misuse Cases

Authors: Geng Wang, Haiyang Zhang, Fengmei Liu

Abstract:

JAMBU is an AEAD mode of operation which entered the third round of CAESAR competition. However, it does not have a security proof like other modes of operation do, and there was a cryptanalysis result that has overthrown the security claim under nonce misuse case by the designers. In this paper, we complement the shortage of the scheme by giving security proofs of JAMBU both under nonce respecting case and nonce misuse case. We prove that JAMBU under nonce respecting case has a slightly lower security than the birthday bound of n bits, and JAMBU under nonce misuse case has a tight security bound of n/2 bits.

ePrint: https://eprint.iacr.org/2017/831

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .