Patents by Inventor Srinivasan Badrinarayanan

Srinivasan Badrinarayanan 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: 20240380585
    Abstract: A method for performing a key recovery process is disclosed. The method comprises entering, in a user device, a user identifier unique to a user. The user device may then obscure the user identifier to form an obscured user identifier. The user device may then transmit the obscured user identifier to a first and second entity computer. The method may then include the first entity computer generating a first output using the obscured user identifier and a first share, and the second entity computer generates a second output using the obscured user identifier and a second share. As a response to transmitting the obscured identifier, the user device may receive the first output from the first entity computer and the second output from the second entity computer. The user device may then generate a secret key after processing the first output and the second output, completing the key recovery process.
    Type: Application
    Filed: August 20, 2021
    Publication date: November 14, 2024
    Applicant: Visa International Service Association
    Inventors: Sunpreet Arora, Saikrishna Badrinarayanan, Srinivasan Raghuraman, Maliheh Shirvanian, Kim Wagner, Gaven Watson
  • Publication number: 20240340186
    Abstract: A method is disclosed. The method includes generating, by a first user device in association with a second user device, a second secret key on the second user device. The second secret key is derived from a first secret held by the first user device. The method includes generating a first commitment, transmitting., to the second user device, the first commitment, receiving, from the second user device, a second commitment, receiving, from the second user device, a random value and a ciphertext. The ciphertext is generated using the first commitment, the second commitment, and the random value. The method also includes verifying the ciphertext, and in response to verifying the ciphertext, modifying a group to include the second user device.
    Type: Application
    Filed: November 9, 2021
    Publication date: October 10, 2024
    Applicant: Visa International Service Association
    Inventors: Gaven Watson, Kim Wagner, Maliheh Shirvanian, Saikrishna Badrinarayanan, Srinivasan Raghuraman, Sunpreet Arora
  • Publication number: 20240283659
    Abstract: A method is disclosed. The method comprises receiving, by a user device from an identity network computer, a query set comprising a plurality of test identity attributes; encrypting, by the user device, the query set to form an obscured query set; computing, by the user device, a zero-knowledge proof using the obscured query set and an encrypted identity attribute associated with a user operating the user device; and transmitting, by the user device to the identity network computer, the obscured query set and the zero-knowledge proof, wherein the identity network computer verifies the zero-knowledge proof, retrieves an encrypted identity attribute associated with the user, evaluates the obscured query set with respect to the encrypted identity attribute, and transmits a result of the evaluation to a relying party computer.
    Type: Application
    Filed: May 3, 2024
    Publication date: August 22, 2024
    Applicant: Visa International Service Association
    Inventors: Kim Wagner, Brian Sullivan, Dinah Sloan, Hao Ngo, Gaven James Watson, Sunpreet Singh Arora, Saikrishna Badrinarayanan, Srinivasan Raghuraman
  • Patent number: 9773045
    Abstract: Search results may include both objective results and person results. In one example, a search query is evaluated to determine whether it is the type of query that a user might want to ask to a friend. If the query is of such a type, then the search engine may examine a social graph to determine which friends of the user who entered the query may have information that is relevant to answering the query. If such friends exist, then the friends may be displayed along with objective search results, along with an explanation of each friend's relevance to the query. Clicking on a person in the results may cause a conversation to be initiated with that person, thereby allowing the user who entered the query to ask his or her friend about the subject of the query.
    Type: Grant
    Filed: September 17, 2013
    Date of Patent: September 26, 2017
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Sandy Wong, Wei Mu, Jun Yin, Rahul Nair, Simon King, Srinivasan Badrinarayanan, Xavier Legros, Michael Ching, Kevin Haas, Shubha Nabar
  • Publication number: 20140181101
    Abstract: Search results may include both objective results and person results. In one example, a search query is evaluated to determine whether it is the type of query that a user might want to ask to a friend. If the query is of such a type, then the search engine may examine a social graph to determine which friends of the user who entered the query may have information that is relevant to answering the query. If such friends exist, then the friends may be displayed along with objective search results, along with an explanation of each friend's relevance to the query. Clicking on a person in the results may cause a conversation to be initiated with that person, thereby allowing the user who entered the query to ask his or her friend about the subject of the query.
    Type: Application
    Filed: September 17, 2013
    Publication date: June 26, 2014
    Applicant: Microsoft Corporation
    Inventors: Sandy Wong, Wei Mu, Jun Yin, Rahul Nair, Simon King, Srinivasan Badrinarayanan, Xavier Legros, Michael Ching, Kevin Haas, Shubha Nabar
  • Patent number: 8538960
    Abstract: Search results may include both objective results and person results. In one example, a search query is evaluated to determine whether it is the type of query that a user might want to ask to a friend. If the query is of such a type, then the search engine may examine a social graph to determine which friends of the user who entered the query may have information that is relevant to answering the query. If such friends exist, then the friends may be displayed along with objective search results, along with an explanation of each friend's relevance to the query. Clicking on a person in the results may cause a conversation to be initiated with that person, thereby allowing the user who entered the query to ask his or her friend about the subject of the query.
    Type: Grant
    Filed: August 5, 2011
    Date of Patent: September 17, 2013
    Assignee: Microsoft Corporation
    Inventors: Sandy Wong, Wei Mu, Jun Yin, Rahul Nair, Simon King, Srinivasan Badrinarayanan, Xavier Legros, Michael Ching, Kevin Haas, Shubha Nabar
  • Publication number: 20130036114
    Abstract: Search results may include both objective results and person results. In one example, a search query is evaluated to determine whether it is the type of query that a user might want to ask to a friend. If the query is of such a type, then the search engine may examine a social graph to determine which friends of the user who entered the query may have information that is relevant to answering the query. If such friends exist, then the friends may be displayed along with objective search results, along with an explanation of each friend's relevance to the query. Clicking on a person in the results may cause a conversation to be initiated with that person, thereby allowing the user who entered the query to ask his or her friend about the subject of the query.
    Type: Application
    Filed: August 5, 2011
    Publication date: February 7, 2013
    Applicant: MICROSOFT CORPORATION
    Inventors: Sandy Wong, Wei Mu, Jun Yin, Rahul Nair, Simon King, Srinivasan Badrinarayanan, Xavier Legros, Michael Ching, Kevin Haas, Shubha Nabar