International Business Machines Corporation

Other

Motorola Corporation

Apple Inc.

Pradeep Kumar Dubey

Brett Olsson

Ronald Ray Hochsprung

Hunter Ledbetter Scales, Iii

Keith E Diefendorff

Ashutosh Kulshreshtha

Vijay A Kumar

Charanjit Singh Jutla

Gaurav Aggarwal

Chai Wah Wu

Charles Philippe Tresser

Sugata Ghosal

Marco Martens

Alok Aggarwal

James Allan Kahle

Harm Peter Hofstee

Charles P Roth

Marc Adam Kaplan

David John Craft

Saurabh Agarwal

Sanjay Mukund Joshi

Harpal Singh Bassali

Jatin Chhugani

Keith Everett Diefendorf

Robert J Von Gutfeld

Michael D Snyder

Krishna Kummamuru

Pankaj Rohatgi

Cathy May

Josyula R Rao

Edward John Silha

Raghuram Krishnapuram

Bradley Gene Burgess

Pooja Aggarwal

Sean William Smith

Parul Alok Mittal

Bruce A Scott

Steve Harris Weingart

Nabil M Amer

Michael I Shub

Abhinanda Sarkar

Vernon Ralph Austel

Atri Rudra

Sreerama Kolluru Venkata Murthy

Ashish Kumar Gupta

Nitin Punamkumar Garq

Deepavan Chakrabarti

Tumkur Venkatanarayana Rao Ravi

Bradford Byron Beavers

Ravindran Sai Anand

Prasanna Ganesan

Krishnendu Chatterjee

A secure communication methodology is presented. The client device is configured to download application code and/or content data from a server operated by a service provider. Embedded within the client is a client private key, a client serial number, and a copy of a server public key. The client forms a request, which includes the client serial number, encrypts the request with the server public key, and sends the download request to the server. The server decrypts the request with the server's private key and authenticates the client. The received client serial number is used to search for a client public key that corresponds to the embedded client private key. The server encrypts its response, which includes the requested information, with the client public key of the requesting client, and only the private key in the requesting client can be used to decrypt the information downloaded from the server.

Method and system for controlled distribution of application code and content data within a computer network

A method (and system) for guaranteeing authenticity of an object, includes providing a sample of material obtainable only by at least one of chemical and physical processes such that the sample is random and not reproducible, associating a number reproducibly to the sample by using a specific reader, and forming at least one coded version of the number, the at least one coded version being obtained by a key signature, and the version being recorded into an area of the object.

Method and apparatus for producing duplication- and imitation-resistant identifying marks on objects, and duplication- and duplication- and imitation-resistant objects

A system and associated protocols for communication between two entities across a computer network operate such that the identities of the two entities remain concealed from each other, while ensuring that no third party is able to trace the existence of a conversation between them. The two entities correspond to each other through pseudonyms. The protocols are designed with an object to distribute trust so that an identity is not revealed by the compromise of any one agent involved in the execution of the protocol. No one agent can establish a correlation between a pseudonym and a physical address.

Protocols for anonymous electronic communication and double-blind transactions

The present invention relates to a method, system and computer program product for clustering data points and its application to text summarization, customer profiling for web personalization and product cataloging. The method for clustering data points with defined quantified relationships between them comprises the steps of obtaining lead value for each data point either by deriving from said quantified relationships or as given input, ranking each data point in a lead value sequence list in descending order of lead value, assigning the first data point in said lead value sequence list as the leader of the first cluster, and considering each subsequent data point in said lead value sequence list as a leader of a new cluster if its relationship with the leaders of each of the previous clusters is less than a defined threshold value or as a member of one or more clusters where its relationship with the cluster leader is more than or equal to said threshold value. The said relationships between data points are symmetric or asymmetric. Similarly, system and computer program product have also been claimed.

Clustering data including those with asymmetric relationships

A method and system offer confidential purchase of electronic data which can be used without any need of knowledge in cryptography nor mastery of computer use beyond usual usage of the World Wide Web (WWW). The method and system which guarantee confidentiality as long as there is no collusion between agents working for a large number of reputable companies whose references can be easily checked on the Internet before proceeding to the order. In addition, the method and system allow for guaranteed payment and offer recourse in case of improper delivery.

Achieving buyer-seller anonymity for unsophisticated users under collusion amongst intermediaries

A method is presented for marking high-quality digital images with a robust and invisible watermark. It requires the mark to survive and remain detectable and authenticatable through all image manipulations that in themselves do not damage the image beyond useability. These manipulations include JPEG &ldquo;lossy&rdquo; compression and, in the extreme, the printing and rescanning of the image. The watermark also has the property that it can detect if the essential contents of the image has changed. The first phase of the method comprises extracting a digest or number N from the image so that N only (or mostly) depends on the essential information content, such that the same number N can be obtained from a scan of a high quality print of the image, from the compressed form of the image, or in general, from the image after minor modifications (introduced inadvertently by processing, noise etc.). The second phase comprises the marking. This can be done in form of an invisible robust watermark, or in form of some visible signature or watermark.

Semi-fragile watermarks

The present invention provides a method and system for providing improved understandability of received speech characterized in that it includes input interface adapted to capture received speech signals connected to a speech recognition means for identifying the contents of the received speech connected to one input of a data processor adapted to perform improvement in understandability, a user profile storage connected to another input of said data processor for providing user specific improvement data, and an output generator connected to the output of said data processor to produce personalized output based on an individual's needs. The instant invention also provides a configured computer program product for carrying out the above method.

Personalized system for providing improved understandability of received speech

The present invention relates to a method, system and computer program product for enabling the remote authentication of fingerprints over an insecure network using a client-server architecture by generation of a set of random queries relating to fingerprint patterns based on stored fingerprint data at the server, to which the client responds based on the observed fingerprint patterns, followed by the issuing of a randomly generates set of challenges pertaining to geometrical relationships between the fingerprint patterns for which confirm responses are received by their server, the final authentication being determined by the proportion of correct responses by the client to said challenges.

Remote authentication of fingerprints over an insecure network

Efficient parallel processing of algorithms involving Galois Field arithmetic use data slicing techniques to execute arithmetic operations on a computing hardware having SIMD (single-instruction, multiple-data) architectures. A W-bit wide word computer capable of operating on one or more sets of k-bit operands executes Galois Field arithmetic by mapping arithmetic operations of Galois Field GF(2 ) to corresponding operations in subfields lower order (m<n), which one selected on the basis of an appropriate cost function. These corresponding operations are able to be simultaneously executed on the W-bit wide computer such that the results of the arithmetic operations in Galois Field GF(2 ) are obtained in k/W as many cycles of the W-bit computer compared with execution of the corresponding operations on a k-bit computer.

Processing Galois Field arithmetic

A method of doing meaningful modifications on an image is presented. These modifications can then be used in variety of applications related to image shape manipulation and similar shape retrieval. The method extracts macrofeatures and microfeature from a given shape. Deformations are done on the macrofeatures only. These deformations are either predefined, or are taken from a deformation library, or are calculated from the shape itself, The microfeatures are then added to the deformed macrofeatures to get a deformed shape. The shape deformations then allow user's perception of shape similarity to be learned, which is reflected in the values of parameters in a parameterized shape similarity metric. The user can use one of the deformed shapes as the initial query point, instead of the shape he or she started with. The shape database compression is achieved by storing only the identification of a similar shape and value of global deformations which will generate this shape approximately, instead of storing every shape feature individually.

Method for controlled and meaningful shape modifications

A user at a client machine can customize components of a database search performed at a server. The user does this by sending executable code to the database server. Software code runs as middleware on the database server machine to communicate between the database server and the client and performs the functions of supplying the client with vital information required for generating code which will be used for customizing various processes of the database retrieval session. Typically, the server comprises a set of database servers and the middleware runs on each database server machine to communicate between the database servers and the client. The middleware provides a virtual machine on which the user-supplied code written in a virtual machine language is executed, giving a uniform interface across the set of database servers on which the same user-supplied code will be executed ensuring that the user-supplied code executes under database server specified access privileges.

Customization of information retrieval through user-supplied code

The present invention involves a method for generating a partial Cyclic Redundancy Checking (CRC) value of a first interval of data in a digital data stream. The method includes the step of loading a precomputed CRC value corresponding to a one bit followed by a predetermined number of zeros. The predetermined number of zeros correspond to the number of digits of a polynomial minus one. The first interval of data is partitioned into a plurality of bits. The precomputed CRC value corresponding to the one bit followed by the predetermined number of zeros is enabled, for each of the plurality of bits having a value of one. The enabled, precomputed CRC values are combined to generate the partial CRC value of the first interval of data. Advantageously, multiple copies of the process may be executed in parallel to achieve a large speed-up.

Parallel system and method for cyclic redundancy checking (CRC) generation

A methodology of highly interactive intra-object relevance feedback is used to retrieve multimedia data from a database. The query object could consist of one or more images, images derived from video, a video sequence, or an audio clip. The query is adjusted using the information fed-back by the user about the relevance of previously extracted part(s) from the object itself, such that the adjusted query is a better approximation to the user's perception. The information fed-back by the user during intra-query modification is used for intra-object learning of the user's perception. The refined query is subsequently used for inter-object relevance feedback where data is retrieved from the database based on parameters learnt by intra-query object feedback mechanism, and the user provides feedback by ranking the retrieved objects in order of their relevance to him or her. In the system according to the invention, inter-object learning of user's perception is expedited by utilizing the learnt parameters in the intra-object relevance feedback. Furthermore, the methodology of the invention allows for building refined queries based on part(s) or sub-sequence(s) of the query object rather than the entire object itself, thereby reducing the number of irrelevant objects, retrieved from the database. The methodology allows synthesis and modification of the input query object itself in the event a query object is not directly available, and, also to learn the user's perception.

Interactive framework for understanding user's perception of multimedia data

A method for data embedding in a digital image under the constraint of a pre-specified upper bound value on the amount of change in the value of a property associated with the image. For compression tolerant data hiding in digital images, a property is selected in which the required information can be embedded. The property should be such that the value obtained from the property before and after a lossy compression does not change by a significant amount, and the change should be bounded. The property should be such that a property value as obtained from the image will not vary due to compression, but only due to malicious tampering. The value obtained from the property is stored so that the image can be verified. The complete image is considered in deciding whether to increase or decrease the property value in a particular region. The method also takes into account the fact that blocks having values of 0 or L, corresponding to the minimum and maximum property values, respectively, are incapable of change in a particular region. The method also attempts to vary even the checksum (stored information), in addition to modifying the image so that the net resultant checksum and the modified image coincide with each other.

Data embedding scheme with error diffusion

Growing community of inventors

New Delhi, India

Pradeep Kumar Dubey