Security system, information processing system, control method of security system, control method of information processing system, program capable of implementation in system for performing control method and ticket system
    1.
    发明专利
    Security system, information processing system, control method of security system, control method of information processing system, program capable of implementation in system for performing control method and ticket system 有权
    安全系统,信息处理系统,安全系统的控制方法,信息处理系统的控制方法,执行控制方法和门票系统的系统中的执行程序

    公开(公告)号:JP2005260676A

    公开(公告)日:2005-09-22

    申请号:JP2004070798

    申请日:2004-03-12

    Abstract: PROBLEM TO BE SOLVED: To provide a security system, an information processing system, a control method of the security system, a control method of the information processing system, a program capable of implementation in system for performing the control method, and a ticket system. SOLUTION: The security system 12 includes: a non-volatile type storing unit 22 for storing correctness inspection unit including a counter, which is renewed every time a signature function means 30 is called; a non-volatile type storing unit 24 for reading a counter array from an outer non-volatile storing unit for storing the counter array, in which a hash value generated for each signature key and a number-of-signature counter for counting the number of signature formed with the signature key are arranged in pairs, and storing the counter array; and a hash function unit 28 for reading the counter array from the non-volatile storing unit 24, generating a hash value, and feeding the hash value to the correctness inspection unit for correctness checking. COPYRIGHT: (C)2005,JPO&NCIPI

    Abstract translation: 要解决的问题:提供安全系统,信息处理系统,安全系统的控制方法,信息处理系统的控制方法,能够在系统中执行用于执行控制方法的程序,以及 票系统。 安全系统12包括:非易失型存储单元22,用于存储包括计数器的正确性检查单元,每当调用签名功能装置30时更新该计数器; 用于从用于存储计数器阵列的外部非易失性存储单元读取计数器阵列的非易失性类型存储单元24,其中为每个签名密钥生成的哈希值和用于计数数字的数量的签名数量计数器 用签名密钥形成的签名成对布置,并存储计数器阵列; 以及用于从非易失性存储单元24读取计数器阵列的哈希函数单元28,产生哈希值,并将哈希值馈送到正确性检查单元以进行正确性检查。 版权所有(C)2005,JPO&NCIPI

    CRYPTOGRAPHIC KEY DISTRIBUTION SYSTEM

    公开(公告)号:JPH11187013A

    公开(公告)日:1999-07-09

    申请号:JP35440197

    申请日:1997-12-24

    Applicant: IBM JAPAN

    Abstract: PROBLEM TO BE SOLVED: To provide a method and a system for minimizing procedures required for updating a cryptographic key by structuring the cryptographic key into tree structure. SOLUTION: First of all, plural keys more than the number of recipients are generated 710, and the plural keys are hierarchically arranged 720 in the form of tree structure. Next, the plural recipients are made correspondent to the keys hierarchically arranged in the form of tree structure, and the cryptographic keys of the respective recipients are generated as a key stream having keys from the root of tree structure to positions corresponding to the said recipients in the tree structure. Thus, after the cryptographic key is generated 730, the generated cryptographic key is distributed 740 to the correspondent recipient.

    SYSTEM AND METHOD FOR INFORMATION RETRIEVAL

    公开(公告)号:JPH0844759A

    公开(公告)日:1996-02-16

    申请号:JP17639694

    申请日:1994-07-28

    Applicant: IBM JAPAN

    Abstract: PURPOSE:To navigate a user who is unfamiliar with data base retrieval to the retrieval result that the user desires by dynamically applying a prepared view for itemized number display. CONSTITUTION:A retrieval execution part retrieves a book information data base 2004 at a request to retrieve book information. A book information retrieval mechanism 2018 consists of a key word retrieval mechanism 2020 which retrieves not only a key word list 2008, but also a synonym dictionary 2006 and a key word document correspondence table 2010 at a request for key word retrieval and an entire-text retrieval mechanism 2022 which retrieves indexes 2012 for entire-text retrieval at a request for entire-text retrieval. Then plural views which classify stored information by individual fixed viewpoints and display the number of constituent elements by the viewpoints are prepared. The views dynamically change associatively with one another in a process of retrieval according to the number of corresponding retrieval results and user's view selection processing.

    METHOD AND DEVICE FOR MACHINE TRANSLATION

    公开(公告)号:JPH06251057A

    公开(公告)日:1994-09-09

    申请号:JP3322393

    申请日:1993-02-23

    Applicant: IBM JAPAN

    Abstract: PURPOSE:To convert an original sentence in a first language to a translated sentence in a second language with a high precision by flexibly selecting word meanings and translated words in the unit of word and phrase so that the original sentence and the translated sentence correspond to each other most suitably. CONSTITUTION:An input sentence in the first language is analyzed to a graph structure having nodal points and branches by an input analysis part 14. In a translated word selector 20, a variable introducing part 22 introduces variables in parts having ambiguity in the graph structure. Restrictions of these variables are propagated to the other parts by a restriction carcelling part 24 to obtain solutions of translated word determination in the other parts, and a contradictionless solution is locally obtained at every part. A variable materializing part 26 locally obtains a solution at every contradictionless part in accordance with the pattern of variables. An output sentence generating part 36 generates a sentence in the second language from a set of these solutions. Consequently, the combination explosion of original words and translate word which can occur at the time of analysis is avoided, and determination of words in the second language in ambiguous parts is delayed till the time just before sentence generation to utilize maximum information.

    System and method for optimizing number of transmission between plural servers
    5.
    发明专利
    System and method for optimizing number of transmission between plural servers 审中-公开
    用于优化多个服务器之间的传输数量的系统和方法

    公开(公告)号:JP2000076332A

    公开(公告)日:2000-03-14

    申请号:JP24155998

    申请日:1998-08-27

    Abstract: PROBLEM TO BE SOLVED: To reduce the communication number of a resource managing system by distributed servers by requesting the transmission of resources to at least, one servers among plural servers to gather the resources to transmit in the case that resources more than a requested one do not exist in a home server. SOLUTION: The system optimizes the number of transmission between the plural servers. Namely, it is first judged whether all the servers to which money has been transferred before are inspected or not (S420). In the case of judging that all of them are not inspected, increment is executed and a transmitting request is sent to a server of an i-numbered largest remainder in a remainder written estimate (S430, S440). Then, an answer from a server is waited (S450). When the answer comes from the server, the remainder of the i-numbered server of the remainder written estimate is updated to be a sent transmission amount (S460). The reason is that as the server sends a half of the possessed money of the server to a home server, the same amount is left on a sending side. Then, whether the money amount was sufficient is judged (S470) and when it is sufficient, the processing is finished.

    Abstract translation: 要解决的问题:为了减少分布式服务器的资源管理系统的通信号码,通过向多个服务器中的至少一个服务器请求资源传送,以便在超过所请求的资源的资源的情况下收集资源进行传输 不存在于家庭服务器中。 解决方案:系统优化多台服务器之间的传输次数。 即,首先判断是否检查了所有已转移货币的服务器(S420)。 在判断为全部未被检查的情况下,执行递增,并且将发送请求发送到剩余写入估计中的第i个最大余数的服务器(S430,S440)。 然后,等待服务器的答案(S450)。 当答案来自服务器时,其余写入估计的i编号服务器的其余部分被更新为发送传输量(S460)。 原因是当服务器将服务器的一半占有的服务器发送到家庭服务器时,发送方将保留相同的金额。 然后,判断金额是否足够(S470),如果满足,则处理结束。

    METHOD FOR TEMPORARY SIGNATURE AUTHENTICATION AND SYSTEM THEREFOR

    公开(公告)号:JPH11174956A

    公开(公告)日:1999-07-02

    申请号:JP30826297

    申请日:1997-11-11

    Applicant: IBM

    Abstract: PROBLEM TO BE SOLVED: To provide a mechanism which enables a digital ID to be used as a letter of attorney in a specific period for a specific purpose by using the temporary digital ID signed with an individual secret key. SOLUTION: A user (client 310) uses a temporary key generated temporarily by using his secret key for a signature requested by application on a server 320 instead of using his secret key (1). A temporary certificate of the temporary key is signed with the secret key of the user (2). Here, the temporary certificate contains information on a term of validity of use as the temporary certificate and information on the purpose of the use. When the application makes a request 330 to sign a document, the client 310 sends the document 340 signed with the temporary key, temporary certificate 40, and the certificate 360 of the user to the server 320. The server 320 confirms the signature first (3), confirm whether or not the temporary certificate is valid (whether the term of validity has expired and whether the certificate is for other applications) (4), and then confirms whether or not the temporary certificate has been signed by the correct user (5). Lastly, the validity of the certificate of the user is confirmed (6).

    7.
    发明专利
    失效

    公开(公告)号:JPH05290082A

    公开(公告)日:1993-11-05

    申请号:JP6455292

    申请日:1992-03-23

    Applicant: IBM

    Abstract: PURPOSE: To provide translation patterns for machine translation which a user can easily generate and efficiently retrieve. CONSTITUTION: A translation pattern 18 consists of an original language pattern 18A, a variable 18B obtained by substituting this original language pattern with one character, and an objective language pattern 18C as a translation corresponding to the original language pattern. The original language pattern includes a nest 19 where another original language pattern can be incorporated as a variable. A translation is generated based on the collation result between an input text and translation patterns. If there is no coincident translation patterns, the input text is translated by a general machine translation device based on grammar. Since the nest structure 19 is adopted, the user can easily generate many translation patterns based on a peculiar expression method, and customization is simplified. Further, indexes of a tree structure is generated to quickly perform the pattern collation.

    GRAPH MINIMUM LENGTH-PATH SEARCHING METHOD AND DEVICE FOR OBTAINING PLURALITY OF OPTIMUM SOLUTION

    公开(公告)号:JPH0546590A

    公开(公告)日:1993-02-26

    申请号:JP21129391

    申请日:1991-07-30

    Applicant: IBM

    Abstract: PURPOSE: To provide a graph search method for discovering plural pieces of solutions of which the optimum characteristic is warranted, at a high speed. CONSTITUTION: The shortest cost between the arbitrary vertexs of a directed graph attached with the costs of the real values on the side between the vertexes and an end point t is calculated. Route development is executed sequentially toward the end point t the like a, a+1, while the low order is pruned according to set analysis conditions in accordance with the sum f(Xi) of the cumulation g(Xi) of the costs from the beginning point s and the shortest cost h(Xi) of the remaining routes with the partial routes from the beginning point s of the directed graph G. The high-order N-pieces of the optimum routes held at the point of the time when the search ends, are outputted. The shortest cost of the remaining routes is previously calculated and the development is performed for the plural routes in accordance with the analysis conditions while the cumulation of the cost from the beginning point is added thereto and, therefore, the plural characteristic and optimum characteristic of the solution are assured. In addition, the development is sequentially executed while the routes of the low-order cost values are pruned and, therefore, the high-speed characteristic of the processing is assured as well.

Patent Agency Ranking