Even, Goldreich and Micali showed at Crypto''89 that the existence of signature schemes secure against known message attacks implies the existence of schemes secure against adaptively chosen message attacks. Unfortunately, this transformation leads to a rather impractical scheme. We exhibit a similar security amplification, which takes the given scheme to a new signature scheme that is not even existentially forgeable under adaptively chosen message attacks. Additionally, however, our transformation will be practical: The complexity of the resulting scheme is twice that of the original scheme. The principles of both transformations carry over to block encryption systems. It is shown how they can be used to convert a block encryption system secure against known plaintext attacks to a system secure against chosen plaintext attacks. For both schemes it is shown that if the transformed scheme can be broken given a number, $T$, of encryptions of adaptively chosen plaintexts, then the original scheme can be broken given encryptions of $T$ uniformly chosen plaintexts. In this case, however, the application of the technique of Even, Goldreich and Micali leads to the more efficient scheme. The transformed scheme has the same key length as the original, and ciphertexts are doubled in length. As an example, when applied to DES the transformed scheme is secure against differential cryptanalysis, which relies on the ability to get encryptions of plaintext pairs with proper differences.
[1]
John Rompel,et al.
One-way functions are necessary and sufficient for secure signatures
,
1990,
STOC '90.
[2]
Eli Biham,et al.
Differential cryptanalysis of DES-like cryptosystems
,
1990,
Journal of Cryptology.
[3]
Ivan Damgård,et al.
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
,
1994,
CRYPTO.
[4]
Silvio Micali,et al.
How To Sign Given Any Trapdoor Function
,
1988,
CRYPTO.
[5]
Silvio Micali,et al.
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
,
1988,
SIAM J. Comput..
[6]
S. Goldwasser,et al.
A digital signature scheme against adaptive chosen message attack
,
1988
.
[7]
Moni Naor,et al.
An Efficient Existentially Unforgeable Signature Scheme and its Applications
,
1994,
CRYPTO.
[8]
Silvio Micali,et al.
On-Line/Off-Line Digital Schemes
,
1989,
CRYPTO.
[9]
Moni Naor,et al.
Universal one-way hash functions and their cryptographic applications
,
1989,
STOC '89.