Abstract
In this paper we introduce a new tool that hides whether or not an “encryption” algorithm actually performs encryption or not. We call this a computational questionable encryption scheme and show how it can be used to devise mobile agents that conceal whether they encrypt or delete data prior to data transmission. Such agents may be useful in the honest-but-curious setting in which the author of the agent wishes to keep confidential whether or not the agent collects and transmits data while in transit. Informally, a questionable encryption scheme adds a “fake” key generation algorithm to a PKCS. The key generation algorithms of a computational questionable encryption scheme produce a “public key” y and a poly-sized witness x. Depending on which of the two key generation algorithms the user decides to use, y is real or fake. When the cipher is supplied with a real y then it produces decipherable ciphertexts and x proves this. When the cipher is supplied with a fake y then it produces computationally indecipherable ciphertexts (with respect to everyone) and x proves this. We call the former a witness of encryption and the latter a witness of non-encryption. We formally define the notion of a computational questionable encryption scheme and present a construction for it based on the ElGamal cryptosystem. We prove the security based on the Decision Diffie-Hellman problem and a reasonable new intractability assumption in the random oracle model. Finally, we show how a computational questionable encryption scheme is related yet different from all-or-nothing disclosure of secrets and related notions.
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
Brassard, G., Crépeau, C., Robert, J.M.: All-or-nothing disclosure of secrets. In: Advances in Cryptology—Crypto 1986, pp. 234–238 (1986)
Brassard, G., Crépeau, C., Robert, J.M.: Information Theoretic Reductions among Disclosure Problems. In: IEEE Symposium on Foundations of Computer Science, pp. 168–173 (1986)
Berger, R., Peralta, R., Tedrick, T.: A Provably Secure Oblivious Transfer Protocol. In: Advances in Cryptology—Eurocrypt 1984, pp. 379–386 (1985)
Blum, M.: Three applications of the oblivious transfer: Part I: Coin flipping by telephone; Part II: How to exchange secrets; Part III: How to send certified electronic mail. UC Berkeley (1981)
Boneh, D.: The Decision Diffie-Hellman Problem. In: Proceedings of the Third Algorithmic Number Theory Symposium—ANTS, pp. 48–63 (1998)
Canetti, R., Dwork, C., Naor, M., Ostrovsky, R.: Deniable Encryption. In: Advances in Cryptology—Crypto 1997, pp. 90–104 (1997)
Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Advances in Cryptology—Crypto 1998, pp. 13–25 (1998)
Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Trans. on Info. Theory IT-22(6), 644–654 (1976)
El Gamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Trans. Info. Theory 31(4), 469–472 (1985)
Goldwasser, S., Bellare, M.: Lecture Notes on Cryptography. Manuscript (July 10, 1996)
Goldreich, O.: Foundations of Cryptography Class Notes (1989), available at http://www.wisdom.weizmann.ac.il/people/homepages/oded/ln89.html
Goldreich, O.: A uniform-complexity treatment of encryption and zero-knowledge. Journal of Cryptology 6(1), 21–53 (1993)
Goldwasser, S., Micali, S.: Probabilistic Encryption. Journal of Computer and System Sciences—JCSS 28(2), 270–299 (1984)
Kilian, J.: Founding cryptography on oblivious transfer. In: ACM Symposium on Theory of Computing—STOC, pp. 20–31 (1988)
Kilian, J.: Uses of randomness in algorithms and protocols. MIT Press, Cambridge (1990)
Micali, S., Rackoff, C., Sloan, B.: The notion of security for probabilistic cryptosystems. SIAM J. on Comput. 17(2), 412–426 (1988)
Rabin, M.: How to exchange secrets by oblivious transfer. Harvard Aiken Comp. Lab, TR-81 (1981)
Tsiounis, Y., Yung, M.: On the security of ElGamal-based encryption. In: Proc. Public Key Cryptography—PKC 1998, pp. 117–134 (1998)
Young, A., Yung, M.: Deniable Password Snatching: On the Possibility of Evasive Electronic Espionage. IEEE Symp. on Sec. and Priv. 224–235 (1997)
Young, A., Yung, M.: Malicious Cryptography: Exposing Cryptovirology. John Wiley & Sons, Inc, England (2004)
Young, A., Yung, M.: Questionable Encryption and Its Applications. In: Proc. Int. Conf. on Cryptology in Malaysia—MyCrypt 2005, pp. 210–221 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Young, A., Yung, M. (2007). Hiding Information Hiding. In: Camenisch, J.L., Collberg, C.S., Johnson, N.F., Sallee, P. (eds) Information Hiding. IH 2006. Lecture Notes in Computer Science, vol 4437. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74124-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-74124-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74123-7
Online ISBN: 978-3-540-74124-4
eBook Packages: Computer ScienceComputer Science (R0)