A new proof for the security of the keyed Sponge construction in the ideal compression function model

Anh Tuan Nguyen, Cuong Bui Nguyen

Abstract


 Abstract— In this paper, we present a new proof for the security of keyed Sponge. Our method is built on the previous result about the indistinguishability of the Sponge construction. Following this approach, we can see the strong relationship between the security of keyed Sponge and its original version.

Tóm tắt— Trong bài báo này, chúng tôi đưa ra một chứng minh mới cho độ an toàn của cấu trúc Sponge có khóa. Phương pháp của chúng tôi sử dụng kết quả trước đó về tính không phân biệt được của cấu trúc Sponge. Theo cách tiếp cận này, chúng ta có thể thấy mối liên hệ chặt chẽ về độ an toàn của cấu trúc Sponge có khóa và phiên bản nguyên thủy của nó.


 


Keywords


Sponge construction, keyed Sponge construction, ideal compression function model, PRF security.

Full Text:

PDF

References


[1]. Bertoni, G., et al. Sponge functions. in ECRYPT hash workshop. 2007. Citeseer.

[2]. Bertoni, G., et al., Keccak specifications. Submission to NIST (round 2), 2009: p. 320-337.

[3]. Maurer, U., R. Renner, and C. Holenstein. Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. in Theory of cryptography conference. 2004. Springer.

[4]. Bertoni, G., et al. On the indifferentiability of the sponge construction. in Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2008. Springer.

[5]. Bertoni, G., et al. Sponge-based pseudo-random number generators. in International Workshop on Cryptographic Hardware and Embedded Systems. 2010. Springer.

[6]. Bertoni, G., et al. On the security of the keyed sponge construction. in Symmetric Key Encryption Workshop. 2011.

[7]. Bertoni, G., et al., Permutation-based encryption, authentication and authenticated encryption. Directions in Authenticated Ciphers, 2012.

[8]. Dworkin, M.J., SHA-3 standard: Permutation-based hash and extendable-output functions. 2015.

[9]. Bertoni, G., et al. Duplexing the sponge: single-pass authenticated encryption and other applications. in International Workshop on Selected Areas in Cryptography. 2011. Springer.

[10]. Andreeva, E., et al. Security of keyed sponge constructions using a modular proof approach. in International Workshop on Fast Software Encryption. 2015. Springer.

[11]. Gaži, P., K. Pietrzak, and S. Tessaro. The exact PRF security of truncation: tight bounds for keyed sponges and truncated CBC. in Annual Cryptology Conference. 2015. Springer.

[12]. Guido, B., et al., Cryptographic sponge functions. 2011


Refbacks

  • There are currently no refbacks.