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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 718 LNCS, Issue , 1993, Pages 219-230

  Laih, Chi Sung ^a   Yen, Sung Ming ^a  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; SMART CARDS;

AUXILIARY DEVICE; COMPUTATION PROTOCOLS; ITS APPLICATIONS; PROTOCOL CANS;

COMPUTATION THEORY;

EID: 79958247758     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57220-1_64     Document Type: Conference Paper

References (16)

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.
2. Diffie, W., and Hellman, M.E., "New directions in cryptography," IEEE Trans. On Inform. Theory, vol. IT-22, pp.644-654, 1976.
3. T. Matsumoto and H. Imai, "How to use servers without releasing Privacy-Making IC cards more powerful," IEICE Technical Report, Rep. ISEC88-33.
4. T. Matsumoto, K. Kato, and It. Imai, "Speeding up secret computations with insecure auxiliary devices," Proc. of CRYPTO'88, pp.497-506, 1988.
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).
6. S. Kawamura and A. Shimbo, "A method for computing an RSA signature with the aid of an auxiliaxy termima1," 1989 IEICE Autumn Natl. Cony. Rec. A-105.
7. J.J. Quisquater and M. Dc Soete, "Speeding up smart card RSA computations with insecure coprocessors," Proc. SMART CARD 2000. Amsterdam (Oct. 1989).
8. S. Kawamura and A. Shimbo, "Performance analysis of Server-Aided Secret Com- Putation protocols for the RSA cryptosystem," The Trans. of the IEICE, vol. E73, No. 7, pp. 1073-1080, Jul. 1990.
9. D.E. Knuth, The art of computer programming, Vol. 2: Seminumerical algorithms. Reading, Addison Wesley, 1969.
10. J. Bos, M. Coster, "Addition Chain Heuristics," Proceedings CRYPTO'89, Springer-Verlag Lecture Notes in Computer Science, pp. 400-407.
11. P. Downey and B. Leony and R. Sethi, "Computing sequences with addition chains," Siam Journal Comput. 3 (1981) pp.638-696.
12. Andrew Yao, "On the evaluation of powers," Siam. J. Comput. 5, (1976).
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.
14. B. Pfitzmann and M. Waidner, "Attacks on Protocols for Server-Aided RSA Computation," Proc. Of the EUROCRYPT'92.
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.
16. T. Matsumoto, If. Imai, C. S. Laih, and S. M. Yen, "On Verifiable Implicit Asking Protocais for RSA Computation, "Proc. of the AUSCRYPT'92.