中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

8 records (took 0.019 seconds)

    METHOD AND SYSTEM FOR PROCESSING A REQUEST OF A CUSTOMER
    1.
    发明申请
    METHOD AND SYSTEM FOR PROCESSING A REQUEST OF A CUSTOMER 审中-公开
    处理客户要求的方法和系统

    公开(公告)号：WO0237242A3

    公开(公告)日：2003-10-16

    申请号：PCT/IB0101988

    申请日：2001-10-24

    Applicant: IBM ,  ALGESHEIMER-MUELLER JOY ,  CACHIN CHRISTIAN ,  CAMENISCH JAN ,  KARJOTH GUENTER

    Inventor： ALGESHEIMER-MUELLER JOY ,  CACHIN CHRISTIAN ,  CAMENISCH JAN ,  KARJOTH GUENTER

    IPC: G06F21/20 ,  G06F1/00 ,  G06F9/46 ,  G09C1/00 ,  H04L9/32 ,  G06F17/60

    CPC classification number: G06F9/465

    Abstract: The invention provides a method and system for processing securely an originator request of a customer. This originator request can be sent to at least one first entity. The method for processing the originator request comprises the steps of (a) sending from the customer the originator request to the or each first entity; (b) connecting the or each first entity to a computation entity; (c) adding by the or each first entity, information concerning the originator request; (d) sending at least part of the first modified request to at least the computation entity; (e) deriving a computation-entity result from the at least part of the first-modified request; (f) sending at least part of the computation-entity result to the or each first entity; (g) deriving therefrom a first-entity result and forwarding it at least in part; and (h) deriving therefrom a customer result.

    Abstract translation: 本发明提供了一种用于安全地处理客户的发起者请求的方法和系统。 该发起者请求可以被发送到至少一个第一实体。 用于处理发起者请求的方法包括以下步骤：（a）从客户发送发起者请求到或每个第一实体; （b）将所述或每个第一实体连接到计算实体; （c）由该或每个第一实体增加关于发起者请求的信息; （d）至少将所述第一修改请求的至少一部分发送给所述计算实体; （e）从所述第一修改请求的所述至少一部分导出计算实体结果; （f）将所述计算实体结果的至少一部分发送给所述或每个第一实体; （g）从其中得到第一实体结果并至少部分转发; 和（h）从中导出客户结果。

    3.
    发明专利
    未知

    公开(公告)号：DE69422935T2

    公开(公告)日：2000-08-17

    申请号：DE69422935

    申请日：1994-06-30

    Applicant: IBM

    Inventor： DOERINGER WILLIBALD ,  DYKEMAN DOUGLAS ,  KARJOTH GUENTER ,  NASSEHI MEHDI ,  SHARMA B

    IPC: G06F17/30 ,  H04L45/74

    Abstract: PCT No. PCT/EP94/02135 Sec. 371 Date Dec. 17, 1996 Sec. 102(e) Date Dec. 17, 1996 PCT Filed Jun. 30, 1994 PCT Pub. No. WO96/00945 PCT Pub. Date Jan. 11, 1996The building, maintenance, and use of a database is described having a trie-like structure for storing entries and retrieving an at least partial match, preferably the longest partial match, or all partial matches of a search argument (input key) from said entries, said database having nodes (20), with each node containing first link information (21) leading to at least one previous node (parent pointer) and second link information (25,26) leading to at least one following node (child pointer), at least a stored key (entry, 23, 24), or a combination, thereof. The particular structure of the nodes allows a two-step search process, in which segments of a search argument are firstly used to determine a search path through the trie-like database, said search path being backtracked in the second part of the search. During the second part of the search the entire search argument is compared to entries stored in the nodes until a match is found. The described database allows an efficient use of memories and is advantageously applied to fast data retrieval, in particular related to communication within computer networks. No recursive procedures are applied.

    4.
    发明专利
    未知

    公开(公告)号：DE60320818D1

    公开(公告)日：2008-06-19

    申请号：DE60320818

    申请日：2003-03-28

    Applicant: IBM

    Inventor： BINDING CARL ,  DOLIVO FRANCOIS ,  DYKEMAN DOUGLAS ,  HILD STEFAN G ,  KARJOTH GUENTER ,  RUETSCHE ERICH

    IPC: G06F17/30 ,  G01S5/02 ,  H04B1/16 ,  H04L12/28 ,  H04W24/00 ,  H04W28/18 ,  H04W64/00

    Abstract: Methods and devices for determining a geographic location of an electronic device are introduced. A range of radio frequencies at the electronic device's location is scanned by a radio receiver ( 11 ). Characteristics (CH) of a geographically bound transmission system ( 3 ) within said scanned frequencies are identified by a control unit ( 21 ). A matching unit ( 5 ) matches these characteristics (CH) with stored characteristics (SCH) of geographically bound transmission systems of different geographical areas. The geographic location (LD) of said electronic device ( 1 ) is dependent on a result of said matching process.

    Anonymously sharing resources based on social network user data
    5.
    发明专利
    Anonymously sharing resources based on social network user data 未知

    公开(公告)号：GB2519966A

    公开(公告)日：2015-05-13

    申请号：GB201319353

    申请日：2013-11-01

    Applicant: IBM

    Inventor： CAMENISCH JAN LEONHARD ,  KARJOTH GUENTER ,  NEVEN GREGORY ,  PREISS FRANZ-STEFAN

    IPC: H04L29/06 ,  G06F21/62 ,  G06Q50/00 ,  H04L9/32 ,  H04W12/02

    Abstract: A method for controlling access to a resource 308 owned by a resource owner 310 is provided. The owner may be a user of a resource computer system 204, which for example, stored the resource on behalf of the owner. The access control may be based on social network data of a social network system 202 with the social network acting as an authorisation server for the resource system for controlling access to the resource at the resource system from requesting users 312. The access control may be based on an owner token 314 relating to the owner, a requester token relating to a requester requesting access to the resource, and an access control policy. The owner token and the requester token may be received by the social networking system to determine 304 by the social networking system whether access to the resource is to be granted based on the content of the owner token, including owner identity and access control policy, and the requester token, including the requestors identity. A social network identity of the owner and a social network identity of the requester may only be determinable by the social network system preserving anonymity/privacy in the system, for example, the link/relationship between the owners 310s and requestors 312s profiles in the social network is not divulged externally from the social network. A group signature key arrangement may also be used.

    8.
    发明专利
    未知

    公开(公告)号：DE69422935D1

    公开(公告)日：2000-03-09

    申请号：DE69422935

    申请日：1994-06-30

    Applicant: IBM

    Inventor： DOERINGER WILLIBALD ,  DYKEMAN DOUGLAS ,  KARJOTH GUENTER ,  NASSEHI MEHDI ,  SHARMA B

    IPC: G06F17/30 ,  H04L45/74

    Abstract: PCT No. PCT/EP94/02135 Sec. 371 Date Dec. 17, 1996 Sec. 102(e) Date Dec. 17, 1996 PCT Filed Jun. 30, 1994 PCT Pub. No. WO96/00945 PCT Pub. Date Jan. 11, 1996The building, maintenance, and use of a database is described having a trie-like structure for storing entries and retrieving an at least partial match, preferably the longest partial match, or all partial matches of a search argument (input key) from said entries, said database having nodes (20), with each node containing first link information (21) leading to at least one previous node (parent pointer) and second link information (25,26) leading to at least one following node (child pointer), at least a stored key (entry, 23, 24), or a combination, thereof. The particular structure of the nodes allows a two-step search process, in which segments of a search argument are firstly used to determine a search path through the trie-like database, said search path being backtracked in the second part of the search. During the second part of the search the entire search argument is compared to entries stored in the nodes until a match is found. The described database allows an efficient use of memories and is advantageously applied to fast data retrieval, in particular related to communication within computer networks. No recursive procedures are applied.

Patent Agency Ranking