22.
    发明专利
    未知

    公开(公告)号:AT342539T

    公开(公告)日:2006-11-15

    申请号:AT00989414

    申请日:2000-12-21

    Applicant: QUALCOMM INC

    Abstract: A method of authenticating anonymous users while reducing potential for "middleman" fraud includes the step of constructing a puzzle in response to information received from a software user. The puzzle includes the received information. The puzzle is sent to the user by a software provider. The user solves the puzzle and returns the solution to the provider. The puzzle includes a portion of a value derived from an encrypted "cookie" and an exponentiation of the derived value. The cookie includes information about the user.

    25.
    发明专利
    未知

    公开(公告)号:BR0016507A

    公开(公告)日:2002-12-24

    申请号:BR0016507

    申请日:2000-12-21

    Applicant: QUALCOMM INC

    Abstract: A method of authenticating anonymous users while reducing potential for "middleman" fraud includes the step of constructing a puzzle in response to information received from a software user. The puzzle includes the received information. The puzzle is sent to the user by a software provider. The user solves the puzzle and returns the solution to the provider. The puzzle includes a portion of a value derived from an encrypted "cookie" and an exponentiation of the derived value. The cookie includes information about the user.

    Generation of keyed integer permutations for message authentication codes

    公开(公告)号:AU5748901A

    公开(公告)日:2001-11-12

    申请号:AU5748901

    申请日:2001-05-01

    Applicant: QUALCOMM INC

    Abstract: A method for constructing keyed integer permutations over the set Z N . where N can be factored into p and q, or N can be prime. N bits are permuted by deriving a keyed permutation of representative indices. When N is factorable into p and q, the set of indices are divided into two portions. The portions undergo iterative processing called "rounds," and in each round, a first half-round function operates on the first portion to form a first half-round value; the first half-round value and the second portion are added together by a modulo-p adder to form a first output value; a second half-round function operates on the second portion to form a second half-round value; and the second half-round value and the first portion are added together by a modulo-q adder to form a second output value. In this manner, outputs of the rounds are reordered. If N is prime and not less than 13, then N is separated into composite values s and t, and two sets are formed with s and t elements, respectively. Each set is then permuted using the method for when N is not prime. At the end of each round, the two blocks are combined using a mixing operation.

    "> METHOD OF AUTHENTICATING ANONYMOUS USERS WHILE REDUCING POTENTIAL FOR
    30.
    发明申请
    METHOD OF AUTHENTICATING ANONYMOUS USERS WHILE REDUCING POTENTIAL FOR "MIDDLEMAN" FRAUD 审中-公开
    在“MIDDLEMAN”FRAUD减少潜力的情况下使用匿名用户的方法

    公开(公告)号:WO0146787A2

    公开(公告)日:2001-06-28

    申请号:PCT/US0034981

    申请日:2000-12-21

    Applicant: QUALCOMM INC

    Abstract: A method of authenticating anonymous users while reducing potential for "middleman" fraud includes the step of constructing a puzzle in response to information received from a software user. The puzzle includes the received information. The puzzle is sent to the user by a software provider. The user solves the puzzle and returns the solution to the provider. The puzzle includes a portion of a value derived from an encrypted "cookie" and an exponentiation of the derived value. The cookie includes information about the user.

    Abstract translation: 匿名用户认证方法,同时减少“中间人”欺诈的潜力,包括响应于从软件用户收到的信息构建难题的步骤。 拼图包括收到的信息。 这个难题由软件提供商发送给用户。 用户解决难题,并将解决方案返回给提供商。 拼图包括从加密的“cookie”导出的值的一部分和派生值的乘积。 Cookie包含有关用户的信息。

Patent Agency Ranking