Patents by Inventor Sanguthevar Rajasekaran
Sanguthevar Rajasekaran has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20200404744Abstract: The present disclosure is directed to a system and method for handling data in an underwater acoustic sensors network, the system comprises a low power computing system configured to function underwater, the computing system including a processor and a memory in communication with the processor, wherein the memory stores a set of instructions executable by the processor, the set of instructions when executed by the processor, cause the processor to receive a primary data from a plurality of master nodes; process the primary data using one or more data reduction algorithms to obtain a resultant data, wherein the resultant data is of a reduced size than the primary data; perform some generic computations on the resultant data, and transmit the resultant data to a gateway.Type: ApplicationFiled: June 20, 2020Publication date: December 24, 2020Applicant: University of ConnecticutInventors: Reda Ammar, Hussain Albarakati, Sanguthevar Rajasekaran, Raafat Elfouly
-
Patent number: 8429720Abstract: A computer-representable object (including, without limitation, a cryptographic key, or a graph or a Boolean description of a system) is secured using a generalized camouflaging technique. The secured object need not be stored in the system, not even in encrypted form. Instead, the technique employs a composition function that regenerates the secured object when one inputs a valid password (which may be any computer-representable information held by a user). By regenerating the secured object each time a valid password is entered, there is no need to store the secured object. If one inputs an invalid password, the technique may generate an incorrect object, such that the user is unable to distinguish this incorrect object from the secured object. If the user tries to use the incorrect object, the user can be exposed as unauthorized, without the user's knowledge that he has been exposed.Type: GrantFiled: November 3, 2008Date of Patent: April 23, 2013Assignee: CA, Inc.Inventors: Sanguthevar Rajasekaran, Geoffrey R. Hird, Balas Natarajan Kausik
-
Patent number: 7634470Abstract: The present invention describes techniques for performing searches in an efficient manner while minimizing the memory resources required to perform the searches. According to the techniques of the present invention, the number of comparisons needed to determine if a query element is in included in a set of elements is proportional to the length of the query element and independent of the number of elements in the set of elements.Type: GrantFiled: July 25, 2005Date of Patent: December 15, 2009Assignee: Arcot Systems, Inc.Inventors: Sanguthevar Rajasekaran, Rajendra A. Gopalakrishna
-
Publication number: 20090138944Abstract: A computer-representable object (including, without limitation, a cryptographic key, or a graph or a Boolean description of a system) is secured using a generalized camouflaging technique. The secured object need not be stored in the system, not even in encrypted form. Instead, the technique employs a composition function that regenerates the secured object when one inputs a valid password (which may be any computer-representable information held by a user). By regenerating the secured object each time a valid password is entered, there is no need to store the secured object. If one inputs an invalid password, the technique may generate an incorrect object, such that the user is unable to distinguish this incorrect object from the secured object. If the user tries to use the incorrect object, the user can be exposed as unauthorized, without the user's knowledge that he has been exposed.Type: ApplicationFiled: November 3, 2008Publication date: May 28, 2009Applicant: Arcot Systems, Inc.Inventors: Sanguthevar Rajasekaran, Geoffrey R. Hird, Balas Natarajan Kausik
-
Publication number: 20090138706Abstract: Techniques for efficiently searching encrypted searchable spaces. For example, embodiments of the present invention provide techniques for searching a plurality of files that are stored in encrypted (or ciphertext) form. According to embodiments of the present invention, the search can usually be performed by decrypting only a portion of the encrypted searchable space. According to an embodiment of the present invention, the search techniques determine a set of files comprising one or more files from the plurality of encrypted files that contain a user-specified query element. The set of files is usually determined by decrypting only a subset of the plurality of encrypted files.Type: ApplicationFiled: December 7, 2008Publication date: May 28, 2009Applicant: Arcot Systems, Inc.Inventors: Sanguthevar Rajasekaran, Rammohan Varadarajan
-
Patent number: 7484092Abstract: Techniques for efficiently searching encrypted searchable spaces. For example, embodiments of the present invention provide techniques for searching a plurality of files that are stored in encrypted (or ciphertext) form. According to embodiments of the present invention, the search can usually be performed by decrypting only a portion of the encrypted searchable space. According to an embodiment of the present invention, the search techniques determine a set of files comprising one or more files from the plurality of encrypted files that contain a user-specified query element. The set of files is usually determined by decrypting only a subset of the plurality of encrypted files.Type: GrantFiled: March 11, 2002Date of Patent: January 27, 2009Assignee: Arcot Systems, Inc.Inventors: Sanguthevar Rajasekaran, Rammohan Varadarajan
-
Patent number: 7454782Abstract: A computer-representable object (including, without limitation, a cryptographic key, or a graph or a Boolean description of a system) is secured using a generalized camouflaging technique. The secured object need not be stored in the system, not even in encrypted form. Instead, the technique employs a composition function that regenerates the secured object when one inputs a valid password (which may be any computer-representable information held by a user). By regenerating the secured object each time a valid password is entered, there is no need to store the secured object. If one inputs an invalid password, the technique may generate an incorrect object, such that the user is unable to distinguish this incorrect object from the secured object. If the user tries to use the incorrect object, the user can be exposed as unauthorized, without the user's knowledge that he has been exposed.Type: GrantFiled: October 30, 2001Date of Patent: November 18, 2008Assignee: Arcot Systems, Inc.Inventors: Sanguthevar Rajasekaran, Geoffrey R. Hird, Balas Natarajan Kausik
-
Patent number: 7167565Abstract: An n person secret sharing solution computes n unique keys to be distributed to the secret owners along with an exponentiated version of the secret. The custodian performs an exponent/modulo operation each time one of the keys is received from one of the secret owners. Alternatively, n+1 keys are created by the custodian, and the custodian retains one key after distributing the remaining n keys to the secret owners. After the custodian has received and processed the n keys from the secret owners, he performs an exponent/modulo operation using his own retained key. According to another aspect, a k out of n secret sharing solution involves computing and storing a database having an entry for each unique combination of k keys that could be returned from among the n keys. After k keys have been received, the custodian looks up in the database the entry corresponding to the particular unique combination of secret owners who returned keys.Type: GrantFiled: May 11, 2001Date of Patent: January 23, 2007Assignee: Arcot Systems, Inc.Inventor: Sanguthevar Rajasekaran
-
Patent number: 7111789Abstract: Techniques are disclosed to increase the efficiency of multi-party authentication communications protocols. One technique includes a four party authentication method utilizing a general authenticator to store and provide a credit card authentication password and other payment information to an issuing bank and/or other parties involved in the transaction. Other techniques include the use of skeleton messages to minimize the forwarding of information through a forwarding party, the elimination of redundant communications exchanges, the use of a merchant appliance hardware solution to minimize system integration difficulties, and/or the imposition of credit card constraints. The techniques may be used singly or in combination.Type: GrantFiled: August 22, 2002Date of Patent: September 26, 2006Assignee: Arcot Systems, Inc.Inventors: Sanguthevar Rajasekaran, James Reno, Rammohan Varadarajan, Sanjay Vyas, Do-Pil Park, Robert Jerdonek
-
Patent number: 7020782Abstract: Searching is an important problem that arises in a variety of applications, particularly for computerized databases. Further, many such applications involve searching set of (possible very large) integers (e.g., credit card numbers, employee identifiers, customer identifiers, dates, parts numbers, etc.). We present techniques for integer searching in a computer database based on a improved form of hashing which we shall refer to as “size-dependent hashing.” This technique can be used to strike a balance between the available memory in the computer system and the required search time.Type: GrantFiled: March 8, 2002Date of Patent: March 28, 2006Assignee: Arcot Systems, Inc.Inventors: Sanguthevar Rajasekaran, James Reno
-
Publication number: 20050256890Abstract: The present invention describes techniques for performing searches in an efficient manner while minimizing the memory resources required to perform the searches. According to the techniques of the present invention, the number of comparisons needed to determine if a query element is in included in a set of elements is proportional to the length of the query element and independent of the number of elements in the set of elements.Type: ApplicationFiled: July 25, 2005Publication date: November 17, 2005Applicant: Arcot Systems, Inc.Inventors: Sanguthevar Rajasekaran, Rajendra Gopalakrishna
-
Patent number: 6959303Abstract: The present invention describes techniques for performing searches in an efficient manner while minimizing the memory resources required to perform the searches. According to the techniques of the present invention, the number of comparisons needed to determine if a query element is in included in a set of elements is proportional to the length of the query element and independent of the number of elements in the set of elements.Type: GrantFiled: December 4, 2001Date of Patent: October 25, 2005Assignee: Arcot Systems, Inc.Inventors: Sanguthevar Rajasekaran, Rajendra A. Gopalakrishna
-
Patent number: 6928427Abstract: In an authorization system, access is defined by rules, roles and active rules. These definitions are preprocessed to form a bit array for each of a plurality of roles representing the rules that apply to that role. Once a bit array is calculated or generated for a given user based on that user's roles, the user bit array can be cached so that it need not be regenerated for each time the user requests access to resources. The rules used can either be role-based rules or active rules.Type: GrantFiled: March 8, 2002Date of Patent: August 9, 2005Assignee: Arcot Systems, Inc.Inventors: Sanguthevar Rajasekaran, Rajendra A. Gopalakrishna
-
Patent number: 6908030Abstract: An online transaction is effected between a user system, a merchant system and an issuer system. The user system generates a one-time number (OTN) to use as a card number for a transaction with the merchant. The user system generates the OTN as a function of various parameters and sends the OTN to the issuer and to the merchant. With the issuer communication, the user is first authenticated, so the issuer can associate the received OTN with the user even if the user's identity cannot be fully discerned from the OTN alone. In authenticating the user with the issuer, and possibly other authentications, the user sends the issuer a signed challenge where the challenge is a sequential challenge or a function of a prior challenge provided by the issuer. The issuer responds with an approval/denial message and, in the latter case, includes the next challenge to be used.Type: GrantFiled: October 31, 2001Date of Patent: June 21, 2005Assignee: Arcot Systems, Inc.Inventors: Sanguthevar Rajasekaran, Rammohan Varadarajan
-
Publication number: 20030172085Abstract: Searching is an important problem that arises in a variety of applications, particularly for computerized databases. Further, many such applications involve searching set of (possible very large) integers (e.g., credit card numbers, employee identifiers, customer identifiers, dates, parts numbers, etc.). We present techniques for integer searching in a computer database based on a improved form of hashing which we shall refer to as “size-dependent hashing.” This technique can be used to strike a balance between the available memory in the computer system and the required search time.Type: ApplicationFiled: March 8, 2002Publication date: September 11, 2003Inventors: Sanguthevar Rajasekaran, James Reno
-
Publication number: 20030080183Abstract: An online transaction is effected between a user system, a merchant system and an issuer system. The user system generates a one-time number (OTN) to use as a card number for a transaction with the merchant. The user system generates the OTN as a function of various parameters and sends the OTN to the issuer and to the merchant. With the issuer communication, the user is first authenticated, so the issuer can associate the received OTN with the user even if the user's identity cannot be fully discerned from the OTN alone. In authenticating the user with the issuer, and possibly other authentications, the user sends the issuer a signed challenge where the challenge is a sequential challenge or a function of a prior challenge provided by the issuer. The issuer responds with an approval/denial message and, in the latter case, includes the next challenge to be used.Type: ApplicationFiled: October 31, 2001Publication date: May 1, 2003Inventors: Sanguthevar Rajasekaran, Rammohan Varadarajan
-
Publication number: 20030042301Abstract: Techniques are disclosed to increase the efficiency of multi-party authentication communications protocols. One technique includes a four party authentication method utilizing a general authenticator to store and provide a credit card authentication password and other payment information to an issuing bank and/or other parties involved in the transaction. Other techniques include the use of skeleton messages to minimize the forwarding of information through a forwarding party, the elimination of redundant communications exchanges, the use of a merchant appliance hardware solution to minimize system integration difficulties, and/or the imposition of credit card constraints. The techniques may be used singly or in combination.Type: ApplicationFiled: August 22, 2002Publication date: March 6, 2003Inventors: Sanguthevar Rajasekaran, James Reno, Rammohan Varadarajan, Sanjay Vyas, Do-Pil Park, Robert Jerdonek
-
Publication number: 20020174355Abstract: Techniques for efficiently searching encrypted searchable spaces. For example, embodiments of the present invention provide techniques for searching a plurality of files that are stored in encrypted (or ciphertext) form. According to embodiments of the present invention, the search can usually be performed by decrypting only a portion of the encrypted searchable space. According to an embodiment of the present invention, the search techniques determine a set of files comprising one or more files from the plurality of encrypted files that contain a user-specified query element. The set of files is usually determined by decrypting only a subset of the plurality of encrypted files.Type: ApplicationFiled: March 11, 2002Publication date: November 21, 2002Applicant: Arcot Systems, Inc.Inventors: Sanguthevar Rajasekaran, Rammohan Varadarajan
-
Publication number: 20020164033Abstract: An n person secret sharing solution computes n unique keys to be distributed to the secret owners along with an exponentiated version of the secret. The custodian performs an exponent/modulo operation each time one of the keys is received from one of the secret owners. Alternatively, n+1 keys are created by the custodian, and the custodian retains one key after distributing the remaining n keys to the secret owners. After the custodian has received and processed the n keys from the secret owners, he performs an exponent/modulo operation using his own retained key. According to another aspect, a k out of n secret sharing solution involves computing and storing a database having an entry for each unique combination of k keys that could be returned from among the n keys. After k keys have been received, the custodian looks up in the database the entry corresponding to the particular unique combination of secret owners who returned keys.Type: ApplicationFiled: May 11, 2001Publication date: November 7, 2002Inventor: Sanguthevar Rajasekaran
-
Publication number: 20020143766Abstract: In an authorization system, access is defined by rules, roles and active rules. These definitions are preprocessed to form a bit array for each of a plurality of roles representing the rules that apply to that role. Once a bit array is calculated or generated for a given user based on that user's roles, the user bit array can be cached so that it need not be regenerated for each time the user requests access to resources. The rules used can either be role-based rules or active rules.Type: ApplicationFiled: March 8, 2002Publication date: October 3, 2002Applicant: Arcot Systems, Inc.Inventors: Sanguthevar Rajasekaran, Rajendra A. Gopalakrishna