Rocky Mountain Journal of Mathematics

A measure of dependence for cryptographic primitives relative to ideal functions

Daniel Smith-Tone and Cristina Tone

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


In this work, we present a modification of a well-established measure of dependence appropriate for the analysis of stopping times for adversarial processes on cryptographic primitives. We apply this measure to construct generic criteria for the ideal behavior of fixed functions in both the random oracle and ideal permutation setting. More significantly, we provide a nontrivial extension of the notion of hash function indifferentiability, transporting the theory from the status of providing security arguments for protocols utilizing ideal primitives into the more realistic setting of protocol assurance with fixed functions. The methodology this measure introduces to indifferentiability analysis connects the security of a hash function with an indifferentiable mode to the security of the underlying compression function in a quantitative way; thus, we prove that dependence results on cryptographic primitives provide a direct means of determining the practical resistance or vulnerability of protocols employing such primitives.

Article information

Rocky Mountain J. Math., Volume 45, Number 4 (2015), 1283-1309.

First available in Project Euclid: 2 November 2015

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 94A60: Cryptography [See also 11T71, 14G50, 68P25, 81P94]


Smith-Tone, Daniel; Tone, Cristina. A measure of dependence for cryptographic primitives relative to ideal functions. Rocky Mountain J. Math. 45 (2015), no. 4, 1283--1309. doi:10.1216/RMJ-2015-45-4-1283.

Export citation


  • M. Abramson and W.O.J. Moser, More birthday surprises, Amer. Math. Month. 77 (1970), 856-–858.
  • E. Andreeva, A. Luykx and B. Mennink, Provable security of Blake with non-ideal compression function, IACR Cryptology ePrint Archive 2011 (2011), 620.
  • G. Bertoni, J. Daemen, M. Peeters and G.V. Assche, Sponge functions, Ecrypt Hash Workshop 2007, May 2007.
  • ––––, On the indifferentiability of the sponge construction, in EUROCRYPT, N.P. Smart, ed., Lect. Notes Comp. Sci. 4965 (2008), 181-–197.
  • R.C. Bradley, Introduction to strong mixing conditions, Volumes 1, 2 and 3, Kendrick Press, Heber City, Utah, 2007.
  • R.C. Bradley and S.A. Utev, On second-order properties of mixing random sequences and random fields, B. Grigelionis, J. Kubilius, H. Pragarauskas and V. Statulevicius, eds., VSP Science Publishers, Utrecht, The Netherlands, and TEV Publishers Service Group, Vilnius, Lithuania, 1994.
  • D. Chang, M. Nandi and M. Yung, Indifferentiability of the hash algorithm blake, IACR Crypt. ePrint Archive 2011 (2011), 623.
  • R. Cogburn, Asymptotic properties of stationary sequences, Univ. Calif. Publ. Stat. 3 (1960), 99-–146.
  • J.-S. Coron, Y. Dodis, C. Malinaud and P. Puniya, Merkle-damg\oard revisited: How to construct a hash function, in CRYPTO, V. Shoup, ed., Lect. Notes Comp. Sci. 3621 (2005), 430-–448.
  • A.R. Dabrowski, D. McDonald and U. Rösler, Renewal theory properties of ion channels, Ann. Stat. 18 (1990), 1091-–1115.
  • Y.A. Davydov, Mixing conditions for Markov chains, Theor. Prob. Appl. 18 (1973), 312–-328.
  • I. Dinur, O. Dunkelman and A. Shamir, Self-differential cryptanalysis of up to $5$ rounds of sha-$3$, IACR Crypt. ePrint Arch. 2012 (2012), 672.
  • N. Ferguson, S. Lucks, B. Schneier, et al., The SKEIN hash function, The 1st SHA-3 Candidate Conference, Leuven, Belgium, 2009.
  • P. Gauravaram, L. Knudsen, K. Matusiewicz, et al., Groestl - A SHA-$3$ candidate, The 1st SHA-3 Candidate Conference, Leuven, Belgium, 2009.
  • D.R. Halverson and G.L. Wise, Approximately optimal memoryless detection of random signals in dependent noise, IEEE Trans. Inform. Theor. 424 (1984), 420–-424.
  • I.A. Ibragimov, Some limit theorems for stochastic processes stationary in the stricts sense, Dokl. Akad. Nauk. 125 (1959), 711-–714.
  • H. Kesten and G. Papanicolaou, A limit theorem for turbulent diffusion, Comm. Math. Phys. 65 (1979), 97-–128.
  • U.M. Maurer, R. Renner and C. Holenstein, Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology, in TCC, M. Naor, ed., Lect. Notes Comp. Sci. 2951 (2004), 21-–39.
  • S. Meyn and R. Tweedie, Markov chains and stochastic stability, Springer-Verlag, New York, 1995.
  • D. Moody, S. Paul and D. Smith-Tone, Indifferentiability security of the fast widepipe hash: Breaking the birthday barrier, IACR Crypt. ePrint Arch. 2011 (2011), 630.
  • D. Moody, S. Paul and D. Smith-Tone, Improved indifferentiability security bound for the jh mode, IACR Crypt. ePrint Arch. 2012 (2012), 278.
  • W. Phillip, Limit theorems for sums of partial quotients of continued fractions, Monats. Math. 105 (1998), 195-–206.
  • P.C. Phillips, Regression theory for near-integrated time series, Econometrica 56 (1988), 1021-–1043.
  • M. Rosenblatt, A central limit theorem and a strong mixing condition, Proc. Natl. Acad. Sci. 42 (1956), 43-–47.
  • ––––, Stationary sequences and random fields, Birkhauser, Boston, 1985.
  • I.G. Zhurbenko, The spectral analysis of time series, North-Holland, Amsterdam, 1986.