Fast Server-Aided Secret Computation Protocols for Modular Exponentiation

@article{Kawamura1993FastSS,
  title={Fast Server-Aided Secret Computation Protocols for Modular Exponentiation},
  author={Shin-ichi Kawamura and Ashushi Shimbo},
  journal={IEEE Journal on Selected Areas in Communications},
  year={1993},
  volume={11},
  pages={778-784}
}
Four efficient server-aided computation protocols for the modular exponentiation operation are proposed. The serveraided computation protocol is a two-party protocol between the client and the server. This protocol has two objectives. The first is to allow the client to borrow the computational power from the server to reduce the computation time. Note that the server is powerful, but restricted to polynomial time. The second objective is to keep the client’s exponent secret from the server… CONTINUE READING
Highly Cited
This paper has 62 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 37 extracted citations

62 Citations

0510'94'99'05'11'17
Citations per Year
Semantic Scholar estimates that this publication has 62 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

A method for obtaining digital signatures and public key cryptosystems

  • C. Rackoff, L. Adleman
  • 1990

On biding information from an oracle

  • J. Feigenbaum Abadi
  • J . Comput . Syst . Sci .
  • 1989

Couvreuer, “Fast decipherment algorithm for RSA public-key cryptosystem,

  • C.J.-J. Quisquater
  • Electron. Lett., vol. 18,
  • 1982

He received the B.E. and M.E. degrees in electrical engineering from the University of Tokyo, Tokyo, Japan

  • Shin-ichi Kawamura
  • Shizuoka, Japan, on April
  • 1960

Similar Papers

Loading similar papers…