Search

Lok M Leung

from Newark, CA
Age ~44
Get Report
Also known as:
Man Leung Lok, Lokman Leung, Lok Man Leunglok, Lokyan Leung, Lok Man, Leung Lok, Leung Lokman
Related to:
Anthony H Leung, 46Philip Shiu, 64Julia Leung, 70Yuk L Lau, 95Chu Lau, 97Roderick Leung, 75
Connected to:
Agnes Y Leung, 67Anne L Leung, 63Bethany A Leung, 75Bounpanh Leung, 68Cam Leung, 61Carly Leung, 28Carol S Leung, 47Cecelia C Leung, 59Chai C Leung, 84Choho Leung, 67

Lok Leung Phones & Addresses

  • Newark, CA
  • Fremont, CA
  • Ithaca, NY
  • 1020 45Th St, Austin, TX 78751 (512) 458-4284
  • Waco, TX

Publications

Us Patents

Method And Apparatus For Dual Hardware And Software Cryptography

View page
US Patent:
7120799, Oct 10, 2006
Filed:
Dec 15, 2000
Appl. No.:
09/738243
Inventors:
Lok Yan Leung - Austin TX, US
Anthony Joseph Nadalin - Austin TX, US
Bruce Arland Rich - Round Rock TX, US
Theodore Jack London Shrader - Austin TX, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
H04L 9/00
US Classification:
713189, 380 30, 713172, 713194
Abstract:
The present invention provides a method, apparatus, and computer implemented instructions for executing cryptographic operations. Responsive to a request to perform a cryptographic operation, one (or more) of a software process and a hardware process is selected for performing the cryptographic operation based on a policy which process results with available resources to perform the cryptographic operation to form a selected process. The cryptographic operation is performed using the selected process. Necessary object conversions, which is transparent to the application, is carried out in order to convert objects to usable forms of the selected process(es).

Method, System And Computer Program Product For Parsing An Encoding

View page
US Patent:
7596630, Sep 29, 2009
Filed:
Sep 30, 2002
Appl. No.:
10/262054
Inventors:
Lok Yan Leung - Austin TX, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 15/16
G06F 9/45
US Classification:
709246, 717136
Abstract:
According to a method, system and computer program product for parsing an encoding, a computing device receives an encoding that includes a first level of indefinite length. The first level includes a second level of indefinite length. In response to instructions of a first instance of a parser, the computing device parses the first level. In response to instructions of a second instance of the parser, the computing device parses the second level. The second instance is invoked by the first instance.

Architecture For Anonymous Electronic Voting Using Public Key Technologies

View page
US Patent:
20020077887, Jun 20, 2002
Filed:
Dec 15, 2000
Appl. No.:
09/738248
Inventors:
Theodore London Shrader - Austin TX, US
Lok Leung - Austin TX, US
Anthony Nadalin - Austin TX, US
Bruce Rich - Round Rock TX, US
Assignee:
IBM Corporation
International Classification:
G06F017/60
US Classification:
705/012000
Abstract:
The present invention discloses an architecture that enables anonymous electronic voting over the Internet using public key technologies. This invention provides a simple yet robust architecture for electronic voting over the unsecured network that is the Internet, using the public and private key pair belonging to the voting entity, not a separate userid and password for each election. In the voting method of the present invention, a voting entity requests a ballot using a public key and a private key belonging to the voting entity. The request is made to a voting mediator. Using a separate public key/private key pair, the voting mediator validates the voting ballot request. After validation of the request, the voting mediator generates an election ballot. The voting mediator sends this ballot to the voting entity. The voting entity casts a vote and sends the ballot to the voting tabulator. The voting tabulator authenticates the ballot and counts the vote.

Dynamic Modular Pki Architecture

View page
US Patent:
20020116609, Aug 22, 2002
Filed:
Dec 15, 2000
Appl. No.:
09/738239
Inventors:
Krishna Yellepeddy - Austin TX, US
Lok Leung - Austin TX, US
Anthony Nadalin - Austin TX, US
Assignee:
International Business Machines Corporation
International Classification:
H04L009/00
US Classification:
713/156000
Abstract:
A architecture for implementing PKI technology is described. Individual processing modules responsive to events are initiated. These individual software module building blocks, or “beans” are placed and linked together in an assembly line-like manner. Each bean is responsive to particular events and does one particular action in the scheme. For example, individual beans are responsive to different format PKI requests from a network, and in turn generate an event corresponding to that request. The event is broadcast to other beans that take the event and perform some other operation in the defined process. Other beans include certificate generators, publishers, manipulators, broadcasters to output streams, and also beans that can act as boolean branches. When strung together, the beans form a cohesive PKI schema. The ability to place beans in the flow and remove them allows great flexibility in developing PKI implementations. Typically, the beans are written in a environment and platform neutral manner, such as the Java programming language. Not only may the beans be used to build both defined and customized PKI schemas easily, but the schemas may be spread out among many computing devices. Additionally, the use of Java allows for fast implementation of additions to PKI schemas. Therefore, as new certificate standards, new formats, or new dissemination methods are developed, appropriate beans may be written to implement these and dropped into place seamlessly.

Configurable Pki Architecture

View page
US Patent:
20020120840, Aug 29, 2002
Filed:
Dec 15, 2000
Appl. No.:
09/738240
Inventors:
Krishna Yellepeddy - Austin TX, US
Lok Leung - Austin TX, US
Anthony Nadalin - Austin TX, US
Assignee:
International Business Machines Corporation
International Classification:
G06F015/16
H04L009/00
US Classification:
713/156000
Abstract:
A architecture for implementing PKI technology is described. Individual processing modules responsive to events are initiated. These individual software module building blocks, or “beans” are placed and linked together in an assembly line-like manner. Each bean is responsive to particular events and does one particular action in the scheme. For example, individual beans are responsive to different format PKI requests from a network, and in turn generate an event corresponding to that request. The event is broadcast to other beans that take the event and perform some other operation in the defined process. Other beans include certificate generators, publishers, manipulators, broadcasters to output streams, and also beans that can act as boolean branches. When strung together, the beans form a cohesive PKI schema. The ability to place beans in the flow and remove them allows great flexibility in developing PKI implementations. Typically, the beans are written in a environment and platform neutral manner, such as the Java programming language. Not only may the beans be used to build both defined and customized PKI schemas easily, but the schemas may be spread out among many computing devices. Additionally, the use of Java allows for fast implementation of additions to PKI schemas. Therefore, as new certificate standards, new formats, or new dissemination methods are developed, appropriate beans may be written to implement these and dropped into place seamlessly.

Dynamic Pki Architecture

View page
US Patent:
20020120841, Aug 29, 2002
Filed:
Dec 15, 2000
Appl. No.:
09/738247
Inventors:
Krishna Yellepeddy - Austin TX, US
Lok Leung - Austin TX, US
Anthony Nadalin - Austin TX, US
Assignee:
International Business Machines Corporation
International Classification:
H04L009/00
US Classification:
713/156000, 713/168000
Abstract:
A architecture for implementing PKI technology is described. Individual processing modules responsive to events are initiated. These individual software module building blocks, or “beans” are placed and linked together in an assembly line-like manner. Each bean is responsive to particular events and does one particular action in the scheme. For example, individual beans are responsive to different format PKI requests from a network, and in turn generate an event corresponding to that request. The event is broadcast to other beans that take the event and perform some other operation in the defined process. Other beans include certificate generators, publishers, manipulators, broadcasters to output streams, and also beans that can act as boolean branches. When strung together, the beans form a cohesive PKI schema. The ability to place beans in the flow and remove them allows great flexibility in developing PKI implementations. Typically, the beans are written in a environment and platform neutral manner, such as the Java programming language. Not only may the beans be used to build both defined and customized PKI schemas easily, but the schemas may be spread out among many computing devices. Additionally, the use of Java allows for fast implementation of additions to PKI schemas. Therefore, as new certificate standards, new formats, or new dissemination methods are developed, appropriate beans may be written to implement these and dropped into place seamlessly.

Method And Apparatus In A Data Processing System For A Keystore

View page
US Patent:
20020138434, Sep 26, 2002
Filed:
Dec 29, 2000
Appl. No.:
09/751576
Inventors:
Lok Leung - Austin TX, US
Anthony Nadalin - Austin TX, US
Bruce Rich - Round Rock TX, US
Theodore Shrader - Austin TX, US
Assignee:
IBM Corporation
International Classification:
G06F017/60
US Classification:
705/051000
Abstract:
A method, apparatus, and computer implemented instructions for managing access to data in a keystore in a data processing system. A request for access to an item of data is received from a requestor, wherein the item of data is encrypted using a key. A determination of whether the requestor is a trusted requestor is made. The key and the item of data are sent to the requestor in response to a determination that the requestor is a trusted requestor.

Method And Apparatus To Mutually Authentication Software Modules

View page
US Patent:
20030037239, Feb 20, 2003
Filed:
Dec 19, 2000
Appl. No.:
09/740600
Inventors:
Lok Leung - Austin TX, US
Anthony Nadalin - Austin TX, US
Bruce Rich - Round Rock TX, US
Thoedore Shrader - Austin TX, US
Assignee:
INTERNATIONAL BUSINESS MACHINES CORPORATION - ARMONK NY
International Classification:
H04L009/00
US Classification:
713/169000
Abstract:
Various aspects of the invention may be found in software that performs mutual authentication between a plurality of interconnected software module. The modules contain security tools that allow for the verifying, authenticating, and/or authorizing of a caller module and an invoked module. Before a caller module invokes another module, the caller performs functions that verify, authenticate, and/or authorize the invoked module. Upon success, the module is invoked. However, upon failure, the module is not invoked. In one case, the calling class uses embedded certificates or keys relating to the invoked class. Upon a possibility of invoking the class, the calling module obtains a digitally signed codebase of the invoked class, and verifies, authenticates, and/or authorizes the code based upon the signature and/or the characteristics of the certificate. Conversely, the invoked class performs similar functionality upon being invoked. When the calling class invokes the second class through a constructor, the steps that verify, authenticate, and/or authorize the calling class are implemented in the constructor. These steps are aided by digital signatures of the calling class codebase, and certificates and/or keys relating to the calling class that are embedded in the invoked class. If these steps fail, the constructor fails and the invoked class is not implemented. If the steps succeed, the calling class and the invoked class may interact normally.
Control profile
Lok M Leung from Newark, CA, age ~44 Get Report