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: 20240396735Abstract: Conducting secure transfers between computing devices can pose a challenge. Therefore, an oblivious transfer can be used to conduct a secure transfer. The oblivious transfer (OT) is an interactive protocol between two parties: a sender computing device and a receiver computing device. An OT protocol involves the sender computing device holding two messages m0 and m1, and the receiver computing device holding a bit b? {0, 1}. At the end of the protocol, the receiver computing device should only learn the message mb and nothing about the other message m1?b, while the sender computing device should learn nothing about the bit b. With the steady progress in quantum computing, several post-quantum oblivious transfer protocols can be derived.Type: ApplicationFiled: September 16, 2022Publication date: November 28, 2024Applicant: VISA INTERNATIONAL SERVICE ASSOCIATIONInventors: Pratyay Mukherjee, Pratik Sarkar, Sikhar Patranabis, Srinivasan Raghuraman, Daniel Masny, Saikrishna Badrinarayanan
-
Publication number: 20240380585Abstract: 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: ApplicationFiled: August 20, 2021Publication date: November 14, 2024Applicant: Visa International Service AssociationInventors: Sunpreet Arora, Saikrishna Badrinarayanan, Srinivasan Raghuraman, Maliheh Shirvanian, Kim Wagner, Gaven Watson
-
Publication number: 20240340186Abstract: 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: ApplicationFiled: November 9, 2021Publication date: October 10, 2024Applicant: Visa International Service AssociationInventors: Gaven Watson, Kim Wagner, Maliheh Shirvanian, Saikrishna Badrinarayanan, Srinivasan Raghuraman, Sunpreet Arora
-
Publication number: 20240283659Abstract: 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: ApplicationFiled: May 3, 2024Publication date: August 22, 2024Applicant: Visa International Service AssociationInventors: Kim Wagner, Brian Sullivan, Dinah Sloan, Hao Ngo, Gaven James Watson, Sunpreet Singh Arora, Saikrishna Badrinarayanan, Srinivasan Raghuraman
-
Patent number: 9773045Abstract: 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: GrantFiled: September 17, 2013Date of Patent: September 26, 2017Assignee: Microsoft Technology Licensing, LLCInventors: Sandy Wong, Wei Mu, Jun Yin, Rahul Nair, Simon King, Srinivasan Badrinarayanan, Xavier Legros, Michael Ching, Kevin Haas, Shubha Nabar
-
Publication number: 20140181101Abstract: 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: ApplicationFiled: September 17, 2013Publication date: June 26, 2014Applicant: Microsoft CorporationInventors: Sandy Wong, Wei Mu, Jun Yin, Rahul Nair, Simon King, Srinivasan Badrinarayanan, Xavier Legros, Michael Ching, Kevin Haas, Shubha Nabar
-
Patent number: 8538960Abstract: 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: GrantFiled: August 5, 2011Date of Patent: September 17, 2013Assignee: Microsoft CorporationInventors: Sandy Wong, Wei Mu, Jun Yin, Rahul Nair, Simon King, Srinivasan Badrinarayanan, Xavier Legros, Michael Ching, Kevin Haas, Shubha Nabar
-
Publication number: 20130036114Abstract: 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: ApplicationFiled: August 5, 2011Publication date: February 7, 2013Applicant: MICROSOFT CORPORATIONInventors: Sandy Wong, Wei Mu, Jun Yin, Rahul Nair, Simon King, Srinivasan Badrinarayanan, Xavier Legros, Michael Ching, Kevin Haas, Shubha Nabar