Abstract
Subliminal channels in randomized signature algorithms like the DSA are well-known. However, much less seems to be known about this issue when dealing with deterministic schemes. Using some known signature schemes like ESIGN-D and SFLASHv3 as example, we illustrate the problem of subliminal channels in non-interactive deterministic signature algorithms. Based on anappropriate formalization, a deterministic variant of RSA-PSS is shown to be subliminal free.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bellare, M., Rogaway, P.: The Exact Security of Digital Signatures – How to Sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 399–416. Springer, Heidelberg (1996)
Bao, F., Wang, X.: Steganography of Short Messages through Accessories. In: Pacific Rim Workshop on Digital Steganography, STEG 2002 (2002)
Courtois, N., Goubin, L., Patarin, J.: SFLASHv3, a fast asymmetric signature scheme. Cryptology ePrint Archive: Report 2003/211, 2003. Revised Specification of SFLASH, version 3.0., October 17th (2003), Published under the, http://eprint.iacr.org/2003/211/
Camenisch, J., Michels, M.: Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 107–122. Springer, Heidelberg (1999)
NESSIE consortium. NESSIE Portfolio of recommended cryptographic primitives (2003), At the time of writing available at https://www.cosic.esat.kuleuven.ac.be/nessie/deliverables/decision-final.pdf
Ding, J., Schmidt, D.: Cryptanalysis of SFlashv3. Cryptology ePrint Archive: Report 2004/103 (2004), At the time of writing available at the, http://eprint.iacr.org/2004/103/
Granboulan, L.: How to repair ESIGN. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol. 2576, pp. 234–240. Springer, Heidelberg (2003)
IEEE P1363 Working Group for Public-Key Cryptography Standards; Meeting Minutes (unapproved), May 22 (2001), At the time of writing available at http://grouper.ieee.org/groups/1363/WorkingGroup/minutes/010522.txt
Ko, K.H., Choi, K.H., Cho, M.S., Lee, J.W.: New Signature Scheme Using Conjugacy Problem. Cryptology ePrint Archive: Report 2002/168 (2002), At the time of writing available at http://eprint.iacr.org/2002/168/
Kuwakado, H., Tanaka, H.: New Subliminal Channel Embedded in the ESIGN. IEICE Trans. Fundamentals E82-A(10), 2167–2171 (1999)
RSA Laboratories. PKCS #1 v.2.1: RSA Cryptography Standard (June 2002), At the time of writing available at ftp://ftp.rsasecurity.com/pub/pkcs/pkcs-1/pkcs-1v2-1.pdf
M’Raïhi, D., Naccache, D., Pointcheval, D., Vaudenay, S.: Computational Alternatives to Random Number Generators. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol. 1556, pp. 72–80. Springer, Heidelberg (1999)
Simmons, G.J.: The Prisoners’ Problem and the Subliminal Channel. In: CRYPTO 1983, pp. 51–67. Plenum Press, New York (1984)
Simmons, G.J.: The subliminal channel and digital signatures. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 364–378. Springer, Heidelberg (1985)
Simmons, G.J.: Subliminal communication is easy using the DAS. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 218–232. Springer, Heidelberg (1994)
Simmons, G.J.: Results Concerning the Bandwidth of Subliminal Channels. IEEE Journal on Selected Areas in Communications 16(4), 463–473 (1998)
Young, A., Yung, M.: The Dark Side of “Black-Box” Cryptography or: Should We Trust Capstone. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 89–103. Springer, Heidelberg (1996)
Zhang, F., Lee, B., Kim, K.: Exploring Signature Schemes with Subliminal Channel. In: The 2003 Symposium on Cryptography and Information Security; SCIS 2003 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bohli, JM., Steinwandt, R. (2005). On Subliminal Channels in Deterministic Signature Schemes. In: Park, Cs., Chee, S. (eds) Information Security and Cryptology – ICISC 2004. ICISC 2004. Lecture Notes in Computer Science, vol 3506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496618_14
Download citation
DOI: https://doi.org/10.1007/11496618_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26226-8
Online ISBN: 978-3-540-32083-8
eBook Packages: Computer ScienceComputer Science (R0)