On the importance of securing your bins: The garbage-man-in-the-middle attack

On the importance of securing your bins: The garbage-man-in-the-middle attack (1997)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Marc Joye , Jean-Jacques Quisquater

Citations:

9 - 2 self

BibTeX

@MISC{Joye97onthe,
    author = {Marc Joye and Jean-Jacques Quisquater},
    title = {On the importance of securing your bins: The garbage-man-in-the-middle attack},
    year = {1997}
}

Bookmark

OpenURL

Abstract

In this paper, we address the following problem: " Is it possible to weaken/attack a scheme when a (provably) secure cryptosystem is used? ". The answer is yes. We exploit weak error-handling methods. Our attack relies on the cryptanalyst being able to modify some ciphertext and then getting access to the decryption of this modified ciphertext. Moreover, it applies on many cryptosystems, including RSA, Rabin, LUC, KMOV, Demytko, ElGamal and its analogues, 3-pass system, knapsack scheme, etc. . .

Citations

2507	A method for obtaining digital signatures and public-key cryptosystems - Rivest, Shamir, et al.
2292	New Directions in Cryptography - Diffie, Hellman - 1976
961	A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithm - ElGamal - 1985
759	A course in computational algebraic number theory, volume 138 of Graduate Texts in Mathematics - Cohen - 1993
687	The arithmetic of elliptic curves - Silverman - 1985
559	Elliptic curve cryptosystems - Koblitz - 1987
419	Use of elliptic curves in cryptography - Miller - 1986
160	A Course in Number Theory and Cryptography - Koblitz - 1994
66	Low-exponent RSA with Related Messages - Coppersmith, Franklin, et al. - 1996
65	A modification of the RSA public-key encryption procedure - Williams - 1980
55	Elliptic curves - Husemöller - 1987
51	Cryptographic protocols - DeMillo, Lynch, et al. - 1982
38	New public-key schemes based on elliptic curves over the ring zn - Koyama, Maurer, et al.
35	A public-key cryptosystem and a digital signature system based on the Lucas function analogue to discrete logarithms - Smith, Skinner - 1994
34	On using RSA with low exponent in a public key network - Hastad - 1985
33	A new elliptic curve based analogue of RSA - Demytko - 1994
29	A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes - Desmedt, Odlyzko - 1985
28	Digital signatures with RSA and other public-key cryptosystems - Denning - 1984
27	Chosen signature cryptanalysis of the RSA (MIT) public key cryptosystem - Davida - 1982
26	A new public key system - Smith, Lennon, et al. - 1993
17	A further weakness in the common modulus protocol for the RSA cryptoalgorithm - DeLaurentis - 1984
14	Some remarks on lucas-based cryptosystems - Bleichenbacher, Bosma, et al. - 1995
11	Factorization and primality testing. Undergraduate Texts in Mathematics - Bressoud - 1989
7	Elliptic curves - oller, D - 1987
4	Some serious protocol failures for RSA with exponenteof less than'32 bits, Presented at the conference of cryptography, CIRM Luminy - Patarin - 1995
3	Protocol failures for RSA-like functions using Lucas sequences and elliptic curves over a ring - Joye, Quisquater - 1996
1	On using RSA with low exponent in a public key network - astad, J - 1986
1	public-key encryption - Smith - 1993