Abstract
The Wire-Tap Channel II introduced by L. H. Ozarow, A.D. Wyner was the first instance of a Partial Exposure Problem. General Exposure-Resilient Functions (ℓ-ERF) are known to be appropriate to provide a solution to the Partial Exposure Problem as long as random secret chains are to be protected. It is known that a perfect ℓ-ERF is nothing but a t-resilient function for t = n − ℓ, where n is the length of the exposed symbol-chain and t the largest number of symbols that an adversary is able to observe. We here manage to adapt the use of t-resilient functions for protecting messages against partial exposure. A solution to that problem had been given by the perfect local pseudo-random generator introduced by Maurer and Massey which is based upon a t-resilient function, but its use needs a secret key shared by the sender and the receiver. We are able to provide solutions to protect messages against Partial Exposure without using secret keys, for various ranges of parameters. Moreover low complexity algorithms are devised to that end.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bennett, C., Brassard, G., Robert, J.: Privacy amplification by public discussion. SIAM. J. Comput. 17(2), 210–229 (1988)
Bierbauer, J., Gopalakrishna, K., Stinson, D.: Orthogonal Arrays, resilient functions, error-correcting codes and linear programming bounds. SIAM. J. Discr. Math. 9, 424–452 (1996)
Camion, P., Carlet, C., Charpin, P., Sendrier, N.: On correlation-immune functions. In: Feigenbaum, J. (ed.) Advances in Cryptology—CRYPTO’91. Lecture Notes in Computer Science, N 576, pp. 86–100. Springer, Heidelberg (1992)
Camion, P., Canteaut, A.: Construction of t-Resilient Functions over a Finite Alphabet. In: Ueli Maurer (ed.) Advances in Cryptology—EUROCRYPT’96, N 1070. Lecture Notes in Computer Science, pp. 283–293. Springer, Heidelberg (1996)
Camion, P., Canteaut, A.: Generalization of Siegenthaler inequality and Schnorr-Vaudenay multipermutations, In: Koblitz, N. (ed.) Advances in Cryptology—CRYPTO’96. Lecture Notes in Computer Science, N 1109, Springer, Heidelberg (1996)
Camion, P.: Codes and association schemes. Handbook of Coding Theory, Chap. 18, pp. 1441–1556, North Holland (1998)
Camion, P., Canteaut, A.: Correlation-immune and resilient functions over a finite alphabet and their applications in cryptography. Designs Codes Cryptography 16(2), 121– (1999)
Camion, P.: Codes over \({{\mathbb Z}_{p^n}}\) and association schemes. In: Barg, A. Litsyn, S. (eds.) Codes and Association Schemes AMS—DIMACS, 2001, 303 pages, ISBN 0-8218-2074-5. DIMACS/56, American Mathematical Society, Providence, pp. 59–86 (2001)
Chor, B., Friedman, J., Golreich, O., Hȧstad, J., Rudich, S., Smolensky, R.: The bit extraction problem or t-resilient Functions. Proceedings of FOCS, pp. 396–407 (1985)
Delsarte, P.: An algebraic approach to association schemes of coding theory Thesis, Université catholique de Louvain, June 1973
Dodis, Y.: Exposure-Resilient Cryptography PHD Thesis, Massachusetts Institute of Technology, August 2000. http://theory.lcs.mit.edu/yevgen/ps/phd-thesis.ps
Friedman, J.: On the bit extraction Problem. Proceedings of FOCS, pp. 314–319 (1992)
Gopalakrishnan, K., Stinson, D.R.: Three characterizations of non-binary correlation-immune and resilient functions. Designs Codes Cryptography. 5, 241–251 (1995)
Roger Hammons, A., Vijay Kumar, P., Calderbank, A.R., Sloane, N.J.A., Solé, P.: The \({{\mathbb Z}_{4}}\) -Linearity of Kerdock, Preparata, Goethals and Related Codes. IEEE. Trans. Inf. Theory 40, 301–319 (1994)
Hedayat, A.S., Sloane, N.J.A., Stufken, J.: Orthogonal arrays: theory and applications. Springer, New York (1999)
Lidl, R., Niederreiter, H.: Finite fields, encyclopedia of mathematics and its applications, vol. 20, Cambridge University Press, Cambridge, London (1987)
MacWilliams, F.J., Sloane, N.J.: The theory of error correcting codes. North-Holland (1977)
Maurer, U.M., Massey, J.L.: Perfect local randomness in pseudo-random sequences. In: Brassard, G. (ed.) Advances in Cryptology—CRYPTO’89, N 435 in Lecture Notes in Computer Science, pp. 100–112. Springer, Heidelberg (1990)
Ozarow, L.H., Wyner, A.D.: Wire-tap Channel II. In: Beth, T., Cot, N., Ingemarson, I. (eds.) Advances in Cryptology—Proceedings of Eurocrypt 84, Lecture Notes in Computer Science, No. 209, pp. 33–50 Springer, Berlin (1985)
Rao, C.R.: Factorial experiments derivable from combinatorial arrangements of arrays. J. R. Statist. 9, 128–139 (1947)
Schnorr, C.P.: On the construction of random number generators and random function generators. In: Christof G. Gnther (ed.) Advances in Cryptology—Proceedings of EUROCRYPT’88, Lecture Notes in Computer Science, N. 330, pp. 225–232, Springer, Berlin (1988)
Siegenthaler, T.: Correlation-immunity of nonlinear combining functions for cryptographic applications, IEEE Inf. Theory, vol. IT-30, N 5, Sept. 84
Stinson, D.R., Massey, J.L.: An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions. J. Cryptology. 8(3), 157–166 (1995)
Xiao, G., Massey, J.L.: A spectral characterization of correlation-immune combining functions. IEEE Trans. Inform. Theory IT-34(3), 569–571 (1988)
Zhang, X., Zheng, U.: On nonlinear resilient functions. In: Guillou, L., Quisquater, J.J. (eds.) Advances in Cryptology—EUROCRYPT’95, N 921 in Lecture Notes in Computer Science, pp. 274–288. Springer Heidelberg (1995)
Wan, Z.-X.: Quaternary Codes. World Scientific (1997)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Camion, P., Patarin, J. t-resilient functions and the partial exposure problem. AAECC 19, 99–133 (2008). https://doi.org/10.1007/s00200-008-0061-5
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-008-0061-5