Fast Server-Aided Secret Computation Protocols for Modular Exponentiation

IEEE Journal on Selected Areas in Communications

Volumn 11, Issue 5, 1993, Pages 778-784

  Kawamura, Shin Ichi ^a   Shimo, Atsushi ^a  

^a TOSHIBA CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

HIDING PROTOCOLS; MODULAR EXPONENTIAL OPERATION; SECRET INFORMATION;

NETWORK PROTOCOLS;

EID: 0027617773     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.223880     Document Type: Article

References (19)

1. T. Matsumoto, K. Kato, and H. Iami, “Smart cards can compute secret heavy functions with powerful terminals” (In Japanese), in Proc. 10th Symp. Inform. Theory Appl., Enoshima-Island, Japan, Nov. 1987, pp. 17–22.
2. T. Matsumoto, K. Kato, and H. Iami, “Speeding up secret computations with insecure auxiliary devices,” in Advances in Cryptology—CRYPTO '88, Lecture Notes in Computer Science, 403. New York: Springer-Verlag, 1990, pp. 497–506.
3. J. Feigenbaum, “Encrypting problem instances, or …, Can you take advantage of someone without having to trust him?” in Advances in Cryptology—CRYPTO’85, Lecture Notes in Computer Science, 219. New York: Springer-Verlag, 1986, 477–488.
4. M. Abadi, J. Feigenbaum, and J. Kilian, “On hiding information from an oracle,” J. Comput. Syst. Sci., no. 39, 21–50, 1989.
5. D. Beaver and J. Feigenbaum, “Hiding instances in multioracle queries,” in Proc. 7th STACS, Lecture Note in Computer Science, 415. New York: Springer-Verlag, 1990, pp. 37-48.
6. J. Feigenbaum and R. Ostrovsky, “A note on one-prover, instancehiding zero-knowledge proof systems” in ASIACRYPT’ 91 Abstract, Fujiyoshida, Japan; to appear in Lecture Notes in Computer Science. New York: Springer-Verlag, Nov. 1991.
7. C. Laih, S. Yen, and L. Ham, “Two efficient server-aided secret computation protocols based on the addition sequence,” in ASIACRYPT 91 Abstract, Fujiyoshida, Japan; to appear in Lecture Notes in Computer Science. New York: Springer-Verlag, Nov. 1991.
8. J.J. Quisquater and M. De Soete, “Speeding up smart card RSA computation with insure coprocessors,” in Proc. SMART CARD 2000, Amsterdam, North-Holland, Oct. 1989, pp. 191–197.
9. A. C. Yao, “On the evaluation of powers,” SIAM J. Comput., vol. 5, no. 1, pp. 100–103, 1976.
10. M. Coster, “Some algorithms on addition chains and their complexity,” Rep. CS-R9024, Center Math. Comput. Sci. (CWI), Amsterdam, 1990.
11. S. Goldwasser, S. Micali, and C. Rackoff, “The knowledge complexity of interactive proof systems,” in Proc. 17th Annu. ACM Symp. Theory Comput., May 1985, pp. 291–304.
12. R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public key cryptosystems,” Commun. ACM, pp. 120–126, 1978.
13. W. Diffie and M. E. Hellman, “New directions in cryptography,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 644–645, 1976.
14. D. E. Knuth, The Art of Computer Programming, Vol. 2, Seminumerical Algorithms, 2nd ed. Reading, MA, 1981, 451.
15. A. Fiat and A. Shamir, “How to prove yourself: Practical solutions to identification and signature problems,” in Advances in Cryptology—CRYPTO’86, Lecture Notes in Computer Science, vol. 263. New York: 1987, 186–194.
16. S. Kawamura and A. Shimbo, “Performance analysis of server-aided secret computation protocols for the RSA cryptosystem,” Trans. IEICE Japan, vol. E73, no. 7, pp. 1073–1080, 1990.
17. A. Shimbo and S. Kawamura, “A factorization attack on certain server-aided computation protocols for the RSA secret transformation,” Electron. Len., vol. 26, no. 17, pp. 1387-1388, Aug. 1990.
18. B. Pfitzmann and M. Waidner, “Attacks on protocols for server-aided RSA computation,” in EUROCRYPT92 Abstract, Balatonfured, Hungary; to appear in Lecture Notes in Computer Science. New York: Springer-Verlag, Jan. 1992.
19. J.J. Quisquater and C. Couvreuer, “Fast decipherment algorithm for RSA public-key cryptosystem,” Electron. Lett., vol. 18, no. 21, pp. 905–907, Oct. 1982.