On subliminal channels in deterministic signature schemes

Authors:
Jens-Matthias Bohli;Rainer Steinwandt
Affiliations:
IAKS, Arbeitsgruppe Systemsicherheit, Prof. Dr. Th. Beth, Fakultät für Informatik, Universität Karlsruhe, Karlsruhe, Germany;IAKS, Arbeitsgruppe Systemsicherheit, Prof. Dr. Th. Beth, Fakultät für Informatik, Universität Karlsruhe, Karlsruhe, Germany
Venue:
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Year:
2004

Citing 8
Cited 4

The subliminal channel and digital signatures

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Subliminal communication is easy using the DSA

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Computational Alternatives to Random Number Generators

SAC '98 Proceedings of the Selected Areas in Cryptography
The Dark Side of "Black-Box" Cryptography, or: Should We Trust Capstone?

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
The exact security of digital signatures-how to sign with RSA and Rabin

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Proving in zero-knowledge that a number is the product of two safe primes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
How to repair ESIGN

SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Results concerning the bandwidth of subliminal channels

IEEE Journal on Selected Areas in Communications

Reversible Watermarking with Subliminal Channel

Information Hiding
An elliptic curve backdoor algorithm for RSASSA

IH'06 Proceedings of the 8th international conference on Information hiding
A subliminal-free variant of ECDSA

IH'06 Proceedings of the 8th international conference on Information hiding
Two extensions of the ring signature scheme of Rivest-Shamir-Taumann

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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.