Speeding Up Secret Computations with Insecure Auxiliary Devices

1. Svigals, J., Smart Cards: The Ultimate Personal Computer, Macmillan, 1985.

   Google Scholar 

2. Matsumoto, T., Kato, K. and Imai, H., “Smart cards can compute secret heavy functions with powerful terminals,” (written in Japanese with an English abstract) Proc. of 10 ^thSymposium on Information Theory and Its Applications, Enoshima-Island, Japan, pp.17–22, Nov.19–21, 1987.

   Google Scholar 

3. Rivest, R., Adleman, L. and Dertouzos, M., “On databanks and privacy homomorphisms,” Foundations of Secure Computation. Demillo, R.A. et al., editors, Academic Press, pp.168–177, 1978.

   Google Scholar 

4. Brickell, E.F. and Yacobi, Y., “On privacy homomorphisms,” Advances in Cryptology-EUROCRYPT’87, Chaum, D. and Price, W.L. editors, Springer-Verlag, pp.117–125, 1988.

   Google Scholar 

5. Ahituv, N., Lapid, Y. and Neumann, S., “Processing encrypted data,” Communications of the ACM, Vol.30, No.9, pp.777–780, Sep. 1987.

   Article  Google Scholar 

6. Matsumoto, T., Okada, T. and Imai, H., “Directly transformed link encryption,” (in Japanese) Trans. of IECE Japan, Vol.J65-D, No.11, pp.1443–1450, Nov. 1982.

   Google Scholar 

7. Feigenbaum, J., “Encrypting problem instances, or,..., Can you take advantage of someone without having to trust him?” Advances in Cryptology-CRYPTO’85, Williams, H.C. editor, Springer-Verlag, pp.477–488, 1986.

   Google Scholar 

8. Abadi, M., Feigenbaum, J. and Kilian, J., “On hiding information from an oracle,” to appear in Journal of Computer and System Sciences. An extended abstract appeared in Proc. of 19 ^thSymposium on Theory of Computation, pp.195–203, May, 1987.

   Google Scholar 

9. Matsumoto, T. and Imai, H., “How to use servers without releasing privacy — Making IC cards more powerful —,” (in Japanese) IEICE Technical Report (ISEC), Vol.88, No.33, pp.53–59, May 1988.

   Google Scholar 

10. Rabin, M.O., “Probabilistic algorithms in finite fields,” SIAM J. Comput., Vol.9, No.2, pp.273–280, May 1980.

    Article  MathSciNet  Google Scholar 

11. Rivest, R., Shamir, A. and Adleman, L., “A method of obtaining digital signatures and public key cryptosystems,” Comm. of ACM, Vol.21, No.2, pp.120–126, Feb. 1978.

    Article  MathSciNet  Google Scholar 

12. Quisquater, J.J. and Couvreuer, C, “Fast decipherment algorithm for RSA public-key cryptosystem,” Electron. Lett. Vol.18, No.21, pp.905–907, Oct. 1982.

    Article  Google Scholar 

13. Koyama, K., Table 1.(Developments of hardwares for the RSA cryptosystem), in “Information Security for Communications,” (in Japanese) to appear in Journal of the Institute of Television Engineers of Japan, Dec. 1988.

    Google Scholar 

Download references