Two efficient server-aided secret computation protocols based on the addition sequence

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

Volumn 739 LNCS, Issue , 1993, Pages 450-459

  Laih, Chi Sung ^a   Yen, Sung Ming ^a   Harn, Lein ^b  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

^b UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY; EFFICIENCY; SMART CARDS;

COMMUNICATION COST; COMMUNICATION TIME; COMPUTATION PROTOCOLS; HIGH-SPEED COMMUNICATION LINKS; LOW SPEED; RSA CRYPTOSYSTEMS; RSA SIGNATURES;

COMPUTATIONAL EFFICIENCY;

EID: 84955557761     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57332-1_38     Document Type: Conference Paper

References (11)

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. T. Matsumoto and H. Imai, “How to use servers without releasing Privacy-Making IC cards more powerful,” IEICE Technical Report, Rep. ISEC88-33. (May, 1988).
3. T. Matsumoto and H. Imai, “Speeding up secret computations with insecure auxiliary devices,” Proc. of CRYPTO'88, pp.497-506, 1988.
4. S. Kawamura and A. Shimbo, “Computation methods for RSA with the aid of powerful terminals,” 1989 Sym.on Cryptography & Inf. Security, Gotemba, Japan (Feb. 2-4 1989).
5. 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.
6. J.J. Quisquater and M. De Soete, “Speeding up smard card RSA computations with insecure coprocessors,” Proc. SMART CARD 2000. Amsterdam (Oct. 1989).
7. 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.
8. J.J. Quisquater and C. Couvreuer, “Fast decipherment algorithm for RSA public-key cryptosystem,” Electron. Lett. 18, 21. pp. 905-907 (Oct. 1982).
9. D.E. Knuth, The art of computer programming, Vol. II: Seminumerical algorithms. Reading, Addison Wesley, 1969.
10. P. Downey and B. Leony and R. Sethi, “Computing sequences with addition chains,” Siam Journ. Comput. 3 (1981) pp.638-696.
11. Andrew Yao, “On the evaluation of powers,” Siam. J. Comput. 5, (1976).