Abstract
Shannon’s notion of entropy remains a benchmark reference for understanding information and data content of cryptosystems. Ideally, secure ciphers maintain high entropy between possible plaintext-ciphertext pairs. The one time pad, though perfectly secure in terms of entropy, remains impractical in most general cases due to key management issues. We discuss in this paper the similar notion of function entropy and examine its use on a small scale to provide perfect functional secrecy. We illustrate how such small units of composition can form the basis for obfuscating software transformations in a general, but highly constrained sense.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Needham, R.M.: Logic and Over-Simplification. In: Proc. of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, June 21-24, pp. 2–3 (1998)
Goldreich, O., Goldwasser, S., Micali, S.: How to Construct Random Functions. Journal of the ACM (JACM) 33-4, 792–807 (1986)
Shannon, C.E.: Communication Theory of Secrecy Systems. Bell System Technical Journal 28-4, 656–715 (1949)
Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S., Yang, K.: On the (Im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 1–18. Springer, Heidelberg (2001)
Thompson, K.: Reflections on trusting trust. Communications of the ACM 27-8, 761–763 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yasinsac, A., McDonald, J.T. (2010). Towards Working with Small Atomic Functions. In: Christianson, B., Crispo, B., Malcolm, J.A., Roe, M. (eds) Security Protocols. Security Protocols 2007. Lecture Notes in Computer Science, vol 5964. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17773-6_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-17773-6_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17772-9
Online ISBN: 978-3-642-17773-6
eBook Packages: Computer ScienceComputer Science (R0)