On the importance of securing your bins

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

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

Full text

Pdf (813 KB)

Source

Conference on Computer and Communications Security archive
Proceedings of the 4th ACM conference on Computer and communications security table of contents

Zurich, Switzerland

Pages: 135 - 141

Year of Publication: 1997

ISBN:0-89791-912-2

Authors

Marc Joye	UCL Crypto Group, Dép. de Math., Université de Louvain, Belgium
Jean-Jacques Quisquater	UCL Crypto Group, Dép. d'Électricité, Université de Louvain, Belgium

Sponsor

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 25, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/266420.266449 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Daniel Bleichenbacher , Wieb Bosma , Arjen K. Lenstra, Some Remarks on Lucas-Based Cryptosystems, Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology, p.386-396, August 27-31, 1995
	2	BRESSOUO, D. M. Faetorization and primality testing. Undergraduate Texts in Mathematics. Springer-Verlag, 1989.
	3	Henri Cohen, A course in computational algebraic number theory, Springer-Verlag New York, Inc., New York, NY, 1995
	4	COPPERSMITH, D., :FRANKLIN, M., PATARIN, J., and REITER, M. Low exponent RSA with related messages. In Advance in Cryptology - Eurocrypt'96 (1996), U. Maurer, Ed., vol. 1070 of Lectures Notes in Computer Science, Springer-Verlag, pp. 1-9.
	5	DAVmA, G. Chosen signature cryptanalysis of the RSA (MIT) public key cryptosystem. Tech. Rep. TR-CS-82- 2, Dept. of Electrical Engineering and Computer Science, University of Wisconsin, Mihvaukee, USA, Oct. 1982.
	6	DELAURENTIS, J. M. A further weakness in the common modulus protocol for the RSA cryptoalgorithm. Gryptologia 8, 3 (July 1984), 253-259.
	7	Richard A. DeMillo , Nancy A. Lynch , Michael J. Merritt, Cryptographic protocols, Proceedings of the fourteenth annual ACM symposium on Theory of computing, p.383-400, May 05-07, 1982, San Francisco, California, United States [doi>10.1145/800070.802214]
	8	N. Demytko, A new elliptic curve based analogue of RSA, Workshop on the theory and application of cryptographic techniques on Advances in cryptology, p.40-49, January 1994, Lofthus, Norway
	9	Dorothy E. Denning, Digital signatures with RSA and other public-key cryptosystems, Communications of the ACM, v.27 n.4, p.388-392, April 1984 [doi>10.1145/358027.358052]
	10	Y Desmedt , A M Odlyzko, A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes, Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85, p.516-522, June 1986, Santa Barbara, California, United States
	11	DIFFm, W., and HELLMAN, M. E. New directions in cryptography. IEEE Transactions on Information Thecry IT-26, 6 (Nov. 1976), 644-654.
	12	ELGAMAL, T. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory IT-31, 4 (July 1985), 469-472.
	13	Johan Hastad, On using RSA with low exponent in a public key network, Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85, p.403-408, June 1986, Santa Barbara, California, United States
	14	HUSEMOLLER, D. Elliptic curves, vol. 111 of Graduate Texts in Mathematics. Springer-VeHag, 1987.
	15	Marc Joye , Jean-Jacques Quisquater, Protocol Failures for RSA-Like Functions Using Lucas Sequences and Elliptic Curves, Proceedings of the International Workshop on Security Protocols, p.93-100, April 10-12, 1996
	16	KALISKI JR, 13. S. A chosen message attack on Demytko's elliptic curve cryptosystem. To appear in Journal of Cryptology.
	17	KOBLITZ, N. Elliptic curve eryptosystems. Mathematics of Computation 48 (1987), 203-209.
	18	Neal Koblitz, A course in number theory and cryptography, Springer-Verlag New York, Inc., New York, NY, 1987
	19	Kenji Koyama , Ueli M. Maurer , Tatsuaki Okamoto , Scott A. Vanstone, New Public-Key Schemes Based on Elliptic Curves over the Ring Zn, Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology, p.252-266, August 11-15, 1991
	20	Alfred J. Menezes , Neal Koblitz, Elliptic Curve Public Key Cryptosystems, Kluwer Academic Publishers, Norwell, MA, 1994
	21	Victor S Miller, Use of elliptic curves in cryptography, Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85, p.417-426, June 1986, Santa Barbara, California, United States
	22	PATARIN, 3. Some serious protocol failures for RSA with exponent e of less than --- 32 bits. Presented at the conference of cryptography, CI~M Luminy, France, Sept. 1995.
	23	M. O. Rabin, DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION, Massachusetts Institute of Technology, Cambridge, MA, 1979
	24	R. L. Rivest , A. Shamir , L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, v.21 n.2, p.120-126, Feb. 1978 [doi>10.1145/359340.359342]
	25	SHAMIR, A. A fast signature scheme. Tech. Rep. MIT/LCS/TM-107, MIT Lab. for Computer Science, Cambridge, Mass., July 1978.
	26	SILVERMAN, J. The arithmetic of elliptic curves, vol. 106 of Graduate Texts in Mathematics. Springer- Verlag, 1986.
	27	Peter Smith, LUC public key encryption: a secure alternative to RSA, Dr. Dobb's Journal, v.18 n.1, p.44-49, Jan. 1993
	28	Peter Smith , Christopher Skinner, A Public-Key Cryptosystem and a Digital Signature System BAsed on the Lucas Function Analogue to Discrete Logarithms, Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology, p.357-364, November 28-December 01, 1994
	29	Peter J. Smith , Michael J. J. Lennon, LUC: A New Public Key System, Proceedings of the IFIP TC11, Ninth International Conference on Information Security: Computer Security, p.103-117, May 12-14, 1993
	30	WILLtAMS, H. C. A modification of the RSA public-key encryption procedure. IEEE Transactions on Information Theory IT-26, 6 (Nov. 1980), 726-729.