Secure addition sequence and its applications on the server-aided secret computation protocols

1. R.L. Rivest, A. Shamir, and L. Adleman, ”A method for obtaining digital signatures and public-key cryptosystem,” Commun. ACM, Vol. 21, pp.120–126, Feb. 1978.

   Google Scholar 

2. Diffie, W., and Hellman, M.E., ”New directions in cryptography,” IEEE Trans. on Inform. Theory, vol.IT-22, pp.644–654, 1976.

   Google Scholar 

3. T.Matsumoto and H. Imai, ”How to use servers without releasing Privacy-Making IC cards more powerful,” IEICE Technical Report, Rep. ISEC88-33.

   Google Scholar 

4. T.Matsumoto, K. Kato, and H. Imai, ”Speeding up secret computations with insecure auxiliary devices,” Proc. of CRYPTO'88, pp.497–506, 1988.

   Google Scholar 

5. S. Kawamura and A. Shimbo, ”Computation methods for RSA with the aid of powerful terminals,” 1989 Sym.on Cryptography and Inf. Security, Gotemba, Japan (Feb. 2–4 1989).

   Google Scholar 

6. S. Kawamura and A. Shimbo, ”A method for computing an RSA signature with the aid of an auxiliary termimal,” 1989 IEICE Autumn Natl. Conv. Rec. A-105.

   Google Scholar 

7. J.J. Quisquater and M. De Soete, ”Speeding up smart card RSA computations with insecure coprocessors,” Proc. SMART CARD 2000. Amsterdam (Oct. 1989).

   Google Scholar 

8. S. Kawamura and A. Shimbo, ”Performance analysis of Server-Aided Secret Computation protocols for the RSA cryptosystem,” The Trans. of the IEICE, vol. E73, No. 7, pp. 1073–1080, Jul. 1990.

   Google Scholar 

9. D.E. Knuth, The art of computer programming, Vol. II: Seminumerical algorithms. Reading, Addison Wesley, 1969.

   Google Scholar 

10. J. Bos, M. Coster, ”Addition Chain Heuristics,” Proceedings CRYPTO'89, Springer-Verlag Lecture Notes in Computer Science, pp.400–407.

    Google Scholar 

11. P. Downey B. Leony and R. Sethi, ”Computing sequences with addition chains,” Siam Journal Comput. 3 (1981) pp.638–696.

    Google Scholar 

12. Andrew Yao, ”On the evaluation of powers,” Siam. J. Comput. 5, (1976).

    Google Scholar 

13. C.S. Laih, S.M. Yen and L. Harn, ”Two Efficient Server-Aided Secret Computation Protocols Based on the Addition Sequence,” Proc. of the ASIACRYPT'91 and to be appeared in The Lecture Notes in Computer Science by Springer-Verlag.

    Google Scholar 

14. B. Pfitzmann and M. Waidner, ”Attacks on Protocols for Server-Aided RSA Computation,” Proc. of the EUROCRYPT'92.

    Google Scholar 

15. A. Shimbo and S. Kawamura, ”Factorization Attack on Certain Server-Aided Computation Protocols for the RSA Secret Transformation,” Electronics Letters, Vol. 26, No. 17, pp. 1387–1388, 1990.

    Google Scholar 

16. T. Matsumoto, H. Imai, C. S. Laih, and S. M. Yen, ”On Verifiable Implicit Asking Protocals for RSA Computation,” Proc. of the AUSCRYPT'92.

    Google Scholar 

Download references