• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

1993 Fiscal Year Final Research Report Summary

Practical Protocols to Verifiably and Implicitly Ask Hidden Problems to Powerful Computing Servers

Research Project

Project/Area Number 04402033
Research Category

Grant-in-Aid for General Scientific Research (A)

Allocation TypeSingle-year Grants
Research Field 電子通信系統工学
Research InstitutionUniversity Scientific Research (A)

Principal Investigator

IMAI Hideki  Univ. of Tokyo. Inst. of Industrial Sci., Professor, 生産技術研究所, 教授 (70017987)

Co-Investigator(Kenkyū-buntansha) MATSUMOTO Tsutomu  Yokohama Nat. Univ., Faculty of Eng., Associate Professor, 工学部, 助教授 (40183107)
Project Period (FY) 1992 – 1993
KeywordsAsking / IC Card / Distributed Computing / P-complete Problem / Linear Programming / Convex Programming / Information Security / Client-Server Computing
Research Abstract

A class of interactive computation techniques called iraikeisan, or verifiable implicit asking to relatively powerful servers, is very useful to speed up solving secret computational problems owned by relatively powerless clients. In this project we introduced an approach for general purpose iraikeisan which will give methodology of readily constructing verifiable P-complete problems with respect to NC-reduction (or, log-space reduction), such as Linear programming problems, with special-purpose computing facility for them.
Principal results include :
A theory of general purpose verifiable implicit asking,
A protocol for asking Linear Programming Problems,
ImPlementation based on (1) and (2).
Through this project we reached the conclusion that if the expansion of sizes when transforming the original problem to be solved could be not severe the proposed approach would be very effective and practical.

  • Research Products

    (8 results)

All Other

All Publications (8 results)

  • [Publications] Manuel Cerecedo: "Efficient and secure multiparty generation of digital signatures based on discrete logarithms" IEICE Trans.Fundamentals.E76-A. 532-545 (1993)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Tsutomu Matsumoto: "On verifiable implicit asking protocols for RSA computation" Advances in Cryptology,LNCS 718,Springer-Verlag. 296-307 (1993)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Satoshi Ozaki: "A holder verification protocol using fingerprints" Proceedings of 1993 Korea-Japan Workshop on Information Security and Cryptology,Seoul. (1993)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 松本 勉: "依頼計算" 計算理論・情報認識理解の研究動向と将来展望,電子情報通信学会情報システムグループ運営委員会. (1994)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Manuel Cerecedo: "Efficient and secure multiparty generation of digital signatures based on discrete logarithms" IEICE Trans. Fundamentals. E76-A. 532-545 (1993)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Matsumoto, Tsutomu: "On verifiable implicit asking protocols for RSA computation" Advances in Cryptology. LNCS 718. 296-307 (1993)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Ozaki, Satoshi: "A holder verification protocol using fingerprints" Proceedings of 1993 Korea-Japan Workshop on Information Security and Cryptology. 24-36 (1993)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Matsumoto, Tsutomu: "Research Trends and Perspectives in Theories of Computation, Recognition, and Understandign, IEICE Information Systems Study Group, Sendai" (1994)

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 1995-03-27  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi