International Business Machines Corporation

Other

Marcus B Oestreicher

Michael Baentsch

Peter Buhler

Thomas Eirich

Frank Hoering

Alexandru Caracas

Michael Charles Osborne

Thomas D Weigold

Anja Lehmann

Anton Beitler

Michael Kuyper

Thorsten Kramp

Stefan Georg Hild

Joerg Bischof

Frank Höring

Eirich Thomas

Frank Horing

A data-source computer provides message data, having associated id data, to be sent to a data-collection computer; produces a blinded id by blinding the id data using a nonce; sends the blinded id to a tokenization computer; and sends the nonce and the message data via a network for receipt by the data-collection computer. In response, the tokenization computer produces a blinded token comprising a function, blinded with the nonce, of the id data and a secret key of the tokenization computer, and sends the blinded token to the data-collection computer. The data-collection computer, in response, uses the nonce to unblind the blinded token to obtain an id token which comprises a deterministic function of the id data and the secret key. The data-collection computer then stores the id token and the message data in storage operatively coupled to the data-collection computer.

Data tokenization

A software-defined radio system has a plurality of fixed radio receivers each operable to receive radio signals in a receiving band, to sample a received radio signal to produce a sample stream, and to send the sample stream over a network. The radio system includes at least one fixed sync signal transmitter operable to transmit predetermined sync signals in said receiving band to receivers of the aforementioned plurality. The radio system further comprises a data processing system which is connected to the network for receiving sample streams from the receivers. The data processing system is operable to align samples of a data signal contained in sample streams from different receivers by: detecting a sync signal in those sample streams; determining a timing offset between samples of the sync signal in those sample streams in dependence on predetermined locations of the different receivers and the transmitter of that sync signal; and aligning the samples of the data signal in dependence on the timing offset.

Synchronization in software-defined radio systems

Embodiments of the present invention may provide the capability to personalize end devices over-the-air (OTA) without the involvement of device manufacturers, for example, in a federated large scale wireless IoT network, such as LoRaWAN. Preset with factory settings, end devices may securely connect to the network before they are finally personalized for their target service. Security sensitive personalization information may only be exchanged between device and service provider. The process may require relatively little effort by the network operator and end customers, may lower personalization costs, and may provide a security model that is attractive for a wide range of IoT applications.

Over-the-air personalization of network devices

Method for managing power consumption in tree-based, Time-Division Multiple Access (TDMA), multi-hop wireless networks. The method includes at each node set the steps of: relinquishing its initial role in the network if a condition related to the power consumption of the node is not met; and adopting a new role in the network according to a TDMA protocol of said network; wherein the node stops emitting beacons to a child node thereof and/or stops acknowledging beacons from a parent node, and wherein each node has a lower power consumption in this new role than it had in its initial role.

Managing power consumption in tree-based TDMA multi-hop wireless networks

A method for providing a user device with a set of access codes comprises, in the user device, storing an encryption key a an identification code, and sending a message containing the identification code to a server via a communications network. In the server, an encryption key is stored corresponding to the key stored in the user device, allocating the set of access codes on receipt of the identification code from the user device. A look up function is performed based on the identification code received in the message to retrieve the key from storage. The set of access codes is encrypted using the retrieved key to produce an encrypted set. A message containing the encrypted set is sent to the user device via the network. In the user device, the encrypted set received from the server is decrypted using the key in storage, and storing the decrypted set of access codes for use by a user of the user device.

Providing a user device with a set of access codes

Provides a data processing system comprising a processor and encrypted information in a first persistent memory whose level of information leakage is higher than that of a second persistent memory. The second persistent memory stores a cryptographic key for decrypting the encrypted information, generating therefrom unencrypted information that is usable by the processor for executing an operation. The cryptographic key may be used for encrypting the unencrypted information, generating the encrypted information. Also provided is a method of processing such a data-processing system with an operating system, comprising writing unencrypted information into the first persistent memory, encrypting the unencrypted information under use of the first cryptographic key, creating therefrom encrypted information in the first persistent memory, and setting the data-processing system to a state in which writing into the first persistent memory is controlled by the operating system.

Device and method with reduced information leakage

A technique for language verification of a Java&#xae; card CAP file is provided. The Java&#xae; card CAP file is converted from an original Java&#xae; code file while conserving its original Java&#xae; semantics. The Java&#xae; card CAP file is converted into a corresponding converted Java&#xae; code file that is semantically identical to the Java&#xae; card CAP file. In a language-verification step, the converted Java&#xae; code file is then verified if it has been found to comply with a predetermined language specification.

File language verification

The invention is directed to a method for distinguishing reachable objects and non-reachable objects in an object-based application in a system with a volatile memory and a non-volatile memory. The object-based application operates in the non-volatile memory on the objects, whereof at least one is a root object. Each root object is processed by writing for each object that is reachable from the root object, a positive reachability information into the volatile memory and marking those objects in the non-volatile memory as reusable memory, for which no positive reachability information is present in the volatile memory.

Method and apparatus for distinguishing reachable objects and non-reachable objects in an object-based application

A Java runtime system is proposed which comprises a stack-based interpreter executing a program that comprises bytecodes and class structures. The system further comprises a modified constant pool with internal information of use only during linking and with external information to be preserved for late code binding. The internal information is removed from the modified constant pool after linking.

Java runtime system with modified constant pool

A method for creating an object in a non-persistent memory is proposed. From an instruction code sequence, a first instruction code is read out which effects the execution of a first function which effects the choice of a non-persistent memory as the location for the next object to be created. This object creation is effected by the execution of a second function which is effected by reading out a second instruction code. Furthermore it is proposed to store a pointer to a transient object in the stack memory and to provide a mechanism for writing this pointer to and reading it from a persistent memory.

Method and device for creating an object in a non-persistent memory and/or keeping accessibility to said object

A computerized method and a system for implementing in a network distributed applications, comprising instructions for a computer process which are executable on different locations in the network, is proposed. The instructions include an assert-command and/or a release-command.

Computerized method and system for implementing distributed applications

A method for loading instruction codes to a first memory and linking said instruction codes is proposed, whereby at least one instruction code has as parameter an address which during a loading step is not determined. This address-parametered instruction code has assigned thereto an address place. A relocation information is loaded which during a linking step effects that the address becomes determined using a starting address and a relative address offset. The then determined address is put at the address place. During the loading step, directly after loading each address-parametered instruction code with its address place, the relocation information is loaded and the address is determined in the linking step.

Method and device for loading instruction codes to a memory and linking said instruction codes

A space-efficient and flexible mechanism for implementing a virtual machine in a resource-constrained environment such as a smartcard is proposed. The virtual machine is designed for interpreting or carrying out instructions which are identified by an instruction code, also called opcode. Both, the addresses, respectively identifiers, of the functions implementing the instruction codes, respectively opcodes, which the virtual machine interprets, as well as parameters to those functions are kept within lookup tables.

Growing community of inventors

Zurich, Switzerland

Marcus B Oestreicher