Visa International Service Association

Rohit Sinha

Sivanarayana Gaddam

Gaven James Watson

Srinivasan Raghuraman

Ranjit Kumar Kumaresan

Mihai Christodorescu

Pratyay Mukherjee

Atul Luykx

Shashwat Mishra

Described are a system and computer program product for secure n-party computation. The system includes a computing device programmed or configured to communicate an input to a trusted execution environment (TEE), and receive a first encrypted output. The computing device is also programmed or configured to post the first encrypted output on a blockchain and receive a first proof of publication. The computing device is further programmed or configured to communicate the first proof of publication to the TEE and receive the first function output of the n-party computation. The computing device is further programmed or configured to communicate a witness to the TEE and receive a second encrypted output. The computing device is further programmed or configured to post the second encrypted output on the blockchain, receive a second proof of publication, communicate the second proof of publication to the TEE, and receive the second function output.

System and computer program product for fair, secure n-party computation using at least one blockchain

A method, system, and computer program product generate, with a payment network, a first value (a) and a second value (g), the second value (g) based on the first value (a) and a generator value (g); generate, with the payment network, a plurality of random merchant numbers (m) for a respective plurality of merchant banks; determine, with the payment network, a merchant product (M) based on a product of the plurality of random merchant numbers (m); generate, with the payment network, a public key (pk) based on the second value (g), the merchant product (M), and the random merchant number (m) and a random key (rk) based on the merchant product (M) and the random merchant number (m) for each respective merchant bank; and communicate, with the payment network, the public key (pk) and the random key (rk) to at least one respective merchant bank.

Method, system, and computer program product for network bound proxy re-encryption and PIN translation

A method, system, and computer program product generate, with a payment network, a first value (a) and a second value (g), the second value (g) generated based on the first value (a) and a generator value (g); generate, with the payment network, a plurality of random merchant numbers (m) for a respective plurality of merchant banks; determine, with the payment network, a merchant product (M) based on a product of the plurality of random merchant numbers (m); generate, with the payment network, a public key (pk) based on the second value (g), the merchant product (M), and the random merchant number (m) and a random key (rk) based on the merchant product (M) and the random merchant number (m) for each respective merchant bank; and communicate, with the payment network, the public key (pk) and the random key (rk) to at least one respective merchant bank.

Described are a system, method, and computer program product for secure real-time n-party computation. The method includes receiving a first computation input and a first portion of a one-time key from a first computer device, and receiving a second computation input and a second portion of the one-time key from a second computer device. The method also includes generating the one-time key based on the first and second portion of the one-time key, and executing a computation based on the first and second computation input. The method further includes generating an encrypted output by encrypting the computation with the one-time key, and communicating the encrypted output to the first computer device. The method further includes receiving a proof of publication from the first computer device and, in response to receiving the proof of publication, communicating the one-time key to the first computer device.

System, method, and computer program product for secure real-time N-party computation

Systems, methods, and computer program products are provided for efficiently storing multi-threaded log data. A method includes receiving multi-threaded log data comprising logs, markers, and thread identifiers. For each respective log, the respective thread identifier is set as a most recently used item in a thread reference cache. A respective log cache in a map data structure is determined based on the respective thread identifier. The respective log is added to the respective log cache. Whether to communicate the respective log and/or the respective log cache to a first repository is determined based on the respective marker. The respective log is communicated to a second repository. Whether to remove an oldest log from the log cache is determined based on a log cache size limit and/or a time limit. Whether to remove a least recently used log cache is determined based on at least one map data structure size limit.

Growing community of inventors

Bokaro Steel, India

Rohit Sinha