Skip to main content
SpringerLink
Log in
Book cover

International Workshop on the Theory and Application of Cryptographic Techniques

AUSCRYPT 1992: Advances in Cryptology — AUSCRYPT '92 pp 296–307Cite as

On verifiable implicit asking protocols for RSA computation

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 718))

Abstract

The verifiable implicit asking is to speed up a certain feasible computation (e.g., y=x d mod n) based on a secret (d) stored in a relatively powerless device (called Client) with the help of powerful device(s) (called Server(s)) in such a way that Client can check the behavior of Server(s) and that the leakage of the secret to Server(s) should be suppressed as much as possible. Possible attacks to obtain Client's secret are classified into passive and active attacks. Passive attacks can be completely nullified by dividing the target computation into two parts so that one depends on d but the other does not and then by asking Server to do only the latter part. However since such a method brings relatively low speed-up performance, we discuss a method to obtain verifiable implicit asking protocols highly secure against passive attacks by modifying some base protocols which are fast enough but not completely free from passive attacks since sending to Server some information not independent from d.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Tsutomu Matsumoto, Koki Kato, Hideki Imai, “Smart cards can compute secret heavy functions with powerful terminals,” Proc. of the 10th Symposium on Information Theory and Its Applications, pp.17–22, (1987-11).

    Google Scholar 

  2. Tsutomu Matsumoto, Koki Kato, Hideki Imai, “Speeding up secret computation with insecure auxiliary devices,” Advances in Cryptology — CRYPTO'88, Santa Barbara (1988-08), Lecture Notes in Computer Science No.403, pp.497–506, Springer-Verlag, (1990).

    Google Scholar 

  3. Tsutomu Matsumoto, Hideki Imai, “How to ask and verify oracles for speeding up secret computations (Part 2),” IEICE Technical Report, IT89-24, (1989-07).

    Google Scholar 

  4. Shin-ichi Kawamura, Atsushi Shimbo, “A note on checking the faithfulness of the server in client-server systems (II),” IEICE Technical Report, ISEC89-17, (1989-09).

    Google Scholar 

  5. Jean-Jacques Quisquater, Marijk De Soete, “Speeding up smart card RSA computation with insecure coprocessors,” Smart Card 2000, Amsterdam (1989-10).

    Google Scholar 

  6. Shin-ichi Kawamura, Atsushi Shimbo, “Performance analysis of server-aided secret computation protocols,” Transactions of IEICE, Vol.E73, No.7, pp.1073–1080, (1990-17).

    Google Scholar 

  7. Atsushi Shimbo, Shin-ichi Kawamura, “Factorisation attack on certain server-aided secret computation protocols for the RSA secret transformation,” IEE Electronics Letters, Vol.26, No.17, pp.1387–1388, (1990-08).

    Google Scholar 

  8. Chi-Sung Laih, Sung-Ming Yen, Lein Harn, “Two efficient server-aided secret computation protocols based on addition chain sequence,” ASIACRYPT'91 — Abstracts, pp.270–274, (1991-11).

    Google Scholar 

  9. Shin-ichi Kawamura, Atsushi Shimbo, “A server-aided secret computation based on the addition chain,” Proc. 1992 Symp. on Cryptography and Information Security, SCIS92-12A, (1992-04).

    Google Scholar 

  10. Birgit Pfitzmann, Michael Waidner, “Attacks on protocols for server-aided RSA computation,” to appear in Advances in Cryptology — EUROCRYPT'92, Balatonfüred (1992-05), Lecture Notes in Computer Science, Springer-Verlag.

    Google Scholar 

  11. R. J. Anderson, “Attack on server assisted authentication protocols,” IEE Electronics Letters, Vol.28, No.15, p.1473, (1992-07).

    Google Scholar 

  12. Tsutomu Matsumoto, Hideki Imai, “On verifiable implicit asking — or serveraided secret computation,” IEICE Technical Report, ISEC92-15, (1992-08).

    Google Scholar 

  13. Chi-Sung Laih, Sung-Ming Yen, “Two phase server-aided secret computation for RSA,” Technical Report, E.E. Dept. of National Cheng Kung University, (1992).

    Google Scholar 

  14. Atsushi Shimbo, Shin-ichi Kawamura, “Efficient server-aided RSA computation protocols,” Proc. of the 15th Symposium on Information Theory and Its Applications, pp.269–272, (1992-09).

    Google Scholar 

  15. Sung-Ming Yen, Chi-Sung Laih, “More about the active attack on the server-aided secret computation protocol,” submitted to IEE Electronics Letters, (1992).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Electrical and Computer Engineering, Yokohama National University, 156 Tokiwadai, 240, Hodogaya, Yokohama, Japan

    Tsutomu Matsumoto

  2. Institute of Industrial Science, University of Tokyo, 7-22-1 Roppongi Minato-ku, 106, Tokyo, Japan

    Hideki Imai

  3. Department of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan 70101 Republic of China

    Chi-Sung Laih & Sung-Ming Yen

Authors
  1. Tsutomu Matsumoto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hideki Imai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chi-Sung Laih
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sung-Ming Yen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jennifer Seberry Yuliang Zheng

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Matsumoto, T., Imai, H., Laih, CS., Yen, SM. (1993). On verifiable implicit asking protocols for RSA computation. In: Seberry, J., Zheng, Y. (eds) Advances in Cryptology — AUSCRYPT '92. AUSCRYPT 1992. Lecture Notes in Computer Science, vol 718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57220-1_70

Download citation

  • DOI: https://doi.org/10.1007/3-540-57220-1_70

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57220-6

  • Online ISBN: 978-3-540-47976-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation