Proposal of an Automatic Signature Scheme Using a Compiler (Special Section on Cryptography and Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• Computer viruses, hackers, intrusions and ther computer crimes have recently become a serious security problem in information systems. Digital signatures are useful to defend against these threats, especially against computer viruses. This is because a modification of a file can be detected by checking the consistency of the original file with its accompanying digital signature. But an executable program might have been infected with the viruses before the signature was created. In this case, the infection cannot be detected by signature verification and the origin of the infection cannot be specified either. In this paper, we propose a signature scheme in which one can sign right after the creation of an executable program. That is, when a user compiles a source program, the compiler automatically creates both the executable program and its signature. Thus viruses cannot infect the executable programs without detection. Moreover, we can specify the creator of contaminated executable programs. In our signature scheme, a signature is created from a set of secret integers stored in a compiler, which is calculated from a compiler-maker's secret key. Each compiler is possessed by only one user and it is used only when a secret value is fed into it. In this way a signature of an executable program and the compiler-owner are linked to each other. Despite these measures, an executable program could run abnormally because of an infection in preprocessing step, e.g. an infection of library files or included files. An infection of these files is detected by ordinary digital signatures. The proposed signature scheme together with digital signature against infection in the preprocessing step enables us to specify the origin of the infection. The name of the signature creator is not necessary for detecting an infection. So, an owner's public value is not searched in our scheme, and only a public value of a compiler-maker is required for signature verification. Furthermore, no one can use a compiler owned by another to create a proper signature.

• 社団法人電子情報通信学会の論文
• 1996-01-25

著者

• OKAMOTO Eiji

  School of Engineering, Hokkaido Tokai University

• Okamoto E

  Institute Of Information Sciences And Electronics University Of Tsukuba

• Mambo M

  Japan Advanced Inst. Sci. And Technol. Ishikawa‐ken Jpn

• Mambo Masahiro

  School Of Information Science Japan Advanced Institute Of Science And Technology

• Mambo Masahiro

  School Of Inform. Sci. Japan Advanced Institute Of Science And Technology

• Uyematsu T

  The Dept. Of Communications And Integrated Systems Tokyo Institute Of Technology

• Uyematsu T

  The Author Is With The Department Of Electrical And Electronic Engineering Tokyo Institute Of Techno

• UYEMATSU Tomohiko

  School of Information Science, Japan Advanced Institute of Science and Technology Ishikawa

• USUDA Keisuke

  School of Inform. Sci., Japan Advanced Institute of Science and Technology

• Usuda Keisuke

  School Of Inform. Sci. Japan Advanced Institute Of Science And Technology:ntt

• Usuda Kazuto

  Faculty Of Science And Technology Keio University:(present Address)ntt Communications Corporation

• Okamoto Eiji

  Department Of Computer Science And Engineering Nagoya Institute Of Technology

関連論文

• Numerical estimation of heat distribution from the implantable battery system of an undulation pump LVAD
• The Dynamic-Typed Access Matrix Model and Decidability of the Safety Problem (Applications) (Cryptography and Information Security)
• The Dynamic-Typed Access Matrix Model and Decidability of the Safety Problem
• Efficient Secret Sharing Schemes Based on Authorized Subsets(Cryptography and Information Security)
• Secret Key Capacity for Ergodic Correlated Sources(Information Theory)
• One-Point Algebraic Geometric Codes from Artin-Schreier Extensions of Hermitian Function Fields (Special Section on Information Theory and Its Applications)
• A Simple Parallel Algorithm for the Ziv-Lempel Encoding
• An Efficient Universal Coding Algorithm for Noiseless Channel with Symbols of Unequal Cost
• Proposal of an Automatic Signature Scheme Using a Compiler (Special Section on Cryptography and Information Security)
• Reliability Functions for Concatenated Codes Employing Modular Codes with Maximum Likelihood Decoding
• Permutation Cipher Scheme Using Polynomials over a Field
• A Secure Broadcast Communication Method with Short Messages (Special Section on Information Theory and Its Applications)
• Pre-Rake Scheme for UWB-IR System with Guard-Time in Multipath Fading Channel(Wide Band Systems)
• Proxy Signatures: Delegation of the Power to Sign Messages (Special Section on Information Theory and Its Applications)
• Constructing Identity-Based Key Distribution Systems over Elliptic Curves (Special Section on Information Theory and Its Applications)
• The Computational Difficulty of Solving Cryptographic Primitive Problems Related to the Discrete Logarithm Problem(Public Key Cryptography)(Cryptography and Information Security)
• Complexity Analysis of the Cryptographic Primitive Problems through Square-Root Exponent(Discrete Mathematics and Its Applications)
• Proposal for New E-cash System Using Message Recovery Signature (特集 情報セキュリティの理論と応用)
• Feasibility of a remote monitoring system for patients with an implantable left ventricular assist device using Personal Handy-Phone System telecommunication technology
• On the Security of the Okamoto-Tanaka ID-Based Key Exchange Scheme against Active Attacks : Special Section on Cryptography and Information Security
• On the Security of the Okamoto-Tanaka ID-Based Key Exchange Scheme against Active Attacks
• Proxy Cryptosystems: Delegation of the Power to Decrypt Ciphertexts (Special Section on Cryptography and Information Security)
• Factoring Hard Integers on a Parallel Machine (Special Section on Discrete Mathematics and Its Applications)
• Application of Wavelet Packet Modulation to Mobile Communication(Wide Band Systems)
• Faster Factoring of Integers of a Special Form (Special Section on Discrete Mathematics and Its Applications)
• Algebraic Properties of Permutation Polynomials (Special Section on Discrete Mathematics and Its Applications)

もっと見る 閉じる

スポンサーリンク