Multi-round passive attacks on server-aided RSA protocols

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Multi-round passive attacks on server-aided RSA protocols

Full text

Pdf (366 KB)

Source

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

Athens, Greece

Pages: 102 - 107

Year of Publication: 2000

ISBN:1-58113-203-4

Author

Johannes Merkle

Secunet Security Networks AG, Mergenthalerallee 77, 65760 Eschborn, Germany

Sponsors

Greek Com Soc : Greek Computer Society
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
Athens U of Econ & Business : Athens University of Economics and Business

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 32, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/352600.352616 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	Miklós Ajtai, The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract), Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.10-19, May 24-26, 1998, Dallas, Texas, United States [doi>10.1145/276698.276705]
	2	R. J. Anderson. Attack onserver assisted authentication protocols. Electronics Letters, 28(15):1473, 1992.
	3	Philippe Bégiun , Jean-Jacques Quisquater, Fast Server-Aided RSA Signatures Secure Against Active Attacks, Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology, p.57-69, August 27-31, 1995
	4	J. Burns , C. J. Mitchell, Parameter Selection for Server-Aided RSA Computation Schemes, IEEE Transactions on Computers, v.43 n.2, p.163-174, February 1994 [doi>10.1109/12.262121]
	5	Matthijs J. Coster , Antoine Joux , Brian A. LaMacchia , Andrew M. Odlyzko , Claus-Peter Schnorr , Jacques Stern, Improved low-density subset sum algorithms, Computational Complexity, v.2 n.2, p.111-128, 1992 [doi>10.1007/BF01201999]
	6	S. Hong, J. Shin, H. Lee-Kwang, and H. Yoon. A new approach to server-aided secret computation. In Proceedings of the 1st International Conference on Information Security and Cryptology - ICISC'98, pages 33{45. DongKwang Publishing Company, 1998.
	7	Gwoboa Horng, An active attack on protocols for server-aided RSA signature computation, Information Processing Letters, v.65 n.2, p.71-73, Jan. 1998 [doi>10.1016/S0020-0190(97)00198-1]
	8	In~neon Technologies. Private Communication, 2000.
	9	A. Lenstra, H. Lenstra, Jr., and L. Lov~asz. Factoring polynomials with rational coe~cients. Math. Ann., 261:515{534, 1982.
	10	Chae Hoon Lim , Pil Joong Lee, Security and Performance of Server-Aided RSA Computation Protocols, Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology, p.70-83, August 27-31, 1995
	11	Tsutomu Matsumoto , Hideki Imai , Chi-Sung Laih , Sung-Ming Yen, On Verifiable Implicit Asking Protocols for RSA Computation, Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology, p.296-307, December 13-16, 1992
	12	T. Matsumoto , K. Kato , H. Imai, Speeding up secret computations with insecure auxiliary devices, Proceedings on Advances in cryptology, p.497-506, February 1990, Santa Barbara, California, United States
	13	J. Mazo and A. Odlyzko. Lattice points in high-dimensional spheres. Monatsh. Math., 110(1):47{61, 1990.
	14	Johannes Merkle , Ralph Werchner, On the Security of Server-Aided RSA Protocols, Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography, p.99-116, February 05-06, 1998
	15	B. P~tzmann and M. Waidner. Attacks on protocols for server-aided RSA computation. In Advances in Cryptology - Proceedings of Eurocrypt'92, volume 658 of LNCS, pages 153{162, Berlin, 1993. Springer Verlag.
	16	J. J. Quisquater and M. De Soete. Speeding up smart card RSA computation with insecure coprocessors. In Proceedings of Smart Card 2000, pages 191{197. North Holland, 1991.
	17	C. P. Schnorr , M. Euchner, Lattice basis reduction: improved practical algorithms and solving subset sum problems, Mathematical Programming: Series A and B, v.66 n.2, p.181-199, Sept. 7, 1994 [doi>10.1007/BF01581144]
	18	C. Schnorr and H. H?orner. Attacking the Chor-Rivest cryptosystem by improved lattice reduction. In Advances in Cryptology { Proceedings of Eurocrypt'95, volume 921 of LNCS, pages 1{12, Berlin, 1995. Springer Verlag.