Towards working with small atomic functions

Authors:
Alec Yasinsac;J. Todd McDonald
Affiliations:
Department of Computer Science, Florida State University, Tallahassee, FL;Department of Electrical and Computer Engineering, Air Force Institute of Technology
Venue:
Proceedings of the 15th international conference on Security protocols
Year:
2007

Citing 4
Cited 0

How to construct random functions

Journal of the ACM (JACM)
Reflections on trusting trust

Communications of the ACM
On the (Im)possibility of Obfuscating Programs

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Logic and Over-Simplification

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

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 plaintextciphertext 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.