Authentication Codes from <em>ε</em>-ASU Hash Functions with Partially Secret Keys

LIU Shengli; TILBORG Henk van; WENG Jian; CHEN Kefei

Article Contents

Article Navigation > Chinese Journal of Electronics > 2014 > 23(4): 790-793

LIU Shengli, TILBORG Henk van, WENG Jian, et al., “Authentication Codes from ε-ASU Hash Functions with Partially Secret Keys,” Chinese Journal of Electronics, vol. 23, no. 4, pp. 790-793, 2014,

Citation:

LIU Shengli, TILBORG Henk van, WENG Jian, et al., “Authentication Codes from ε-ASU Hash Functions with Partially Secret Keys,” Chinese Journal of Electronics, vol. 23, no. 4, pp. 790-793, 2014,

LIU Shengli, TILBORG Henk van, WENG Jian, et al., “Authentication Codes from ε-ASU Hash Functions with Partially Secret Keys,” Chinese Journal of Electronics, vol. 23, no. 4, pp. 790-793, 2014,

Citation:

PDF( 272 KB)

Authentication Codes from ε-ASU Hash Functions with Partially Secret Keys

1.
Deptartment of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China;
2.
Deptartment of Mathematics and Computer Science, Eindhoven University of Technology, the Netherlands;
3.
Department of Computer Science, Jinan University, Guangzhou 510632, China;
4.
School of Science, Hangzhou Normal University, Hangzhou 310036, China

Funds: This work is supported by Natural Science Foundation of China (No.61170229, No.61133014, No.61272413, No.61373153), Innovation Project of Shanghai Municipal Education Commission (No.12ZZ021), Specialized Research Fund for the Doctoral Program of Higher Education (No.20110073110016, No.20134401110011), and the Open Project Program of the State Key Laboratory of MEAC (No.2013A01).

Received Date: 2012-07-01
Rev Recd Date: 2014-04-01
Publish Date: 2014-10-05

Abstract

Abstract

An authentication code can be constructed with a family of ε-Almost strong universal (ε-ASU) hash functions, with the index of hash functions as the authentication key. This paper considers the performance of authentication codes from ε-ASU, when the authentication key is only partially secret. We show how to apply the result to privacy amplification against active attacks in the scenario of two independent partially secret strings shared between a sender and a receiver.
- Information theory,
- Authentication code,
- Privacy amplification,
- Unconditional security

FullText(HTML)

References(11)

References

G.J. Simmons, Authentication theory/coding theory, G.R. Blakley and D. Chaum, eds., Advances in Cryptology, Proc. Crypto'84, New York, Vol.196, pp.411-431, 1985.

G.J. Simmons, A game theory model of digital message authentication, Congr. Numer., Vol.34, pp.413-424, 1992.

J.L. Carter and M.N. Wegman, Universal classes of hash functions, Journal of Computer and System Sciences, Vol.18, No.2, pp.143-154, 1979.

M.N. Wegman and J.L. Carter, New hash functions and their use in authentication and set equality, Journal of Computer and System Sciences, Vol.22, No.3, pp.265-279, 1981.

D.R. Stinson, Combinatorial techniques for universal hashing, Journal of Computer and System Sciences, Vol.48, No.2, pp.337-346, 1994.

D.R. Stinson, Universal hashing and authentication codes, Designs, Codes and Cryptography, Vol.4, No.4, pp.369-380, 1994.

B. den Boer, A simple and key-economical unconditional authentication scheme, Journal of Computer Security, Vol.2, No.1, pp.65-71, 1993.

D.R. Stinson, Universal hashing and auhtentication codes, Advances in Cryptology-CRYPTO'91, Vol.576, pp.74-85, 1992.

S. Wolf, Information-theoretically and Computationally Secure Key Agreement in Cryptography, ETH Dissertation, No.13138, ETH Zurich, 1999.

C.H. Bennett, G. Brassard, C. Crépeau, et al., Generalized privacy amplification, IEEE Trans. Inform. Theory, Vol.41, No.6, pp.1915-1923, 1995.

Y. Dodis, R. Ostrovsky, L. Reyzin, et al., Fuzzy extractors: How to generate strong keys from biometrics and other noisy data, SIAM Journal on Computing, Vol.38, No.1, pp.97-139, 2008.

Relative Articles

Supplements(0)

Cited By

Proportional views