OBJECTIVE Arthritis is associated with increased articular formation of nitrotyrosine, which may contribute to injury. Nitrotyrosine is formed by nitration of tyrosine by reactive nitrogen species such as peroxynitrite, the formation of which may be enhanced by xanthine oxidoreductase (XOR), since it can generate nitric oxide from nitrite/nitrate, and superoxide during xanthine metabolism. We h...

We initiate a study of random instances of nonlocal games. We show that quantum strategies are better than classical for almost any 2-player XOR game. More precisely, for large n, the entangled value of a random 2-player XOR game with n questions to every player is at least 1.21... times the classical value, for 1− o(1) fraction of all 2-player XOR games.

The k-XOR problem can be generically formulated as the following: given many n-bit strings generated uniformly at random, find k distinct of them which XOR to zero. This generalizes collision search (two equal elements) a k-tuple inputs. has become ubiquitous in cryptanalytic algorithms, including variants operation is replaced by modular addition (k-SUM) or other non-commutative operations (e....

We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the two bits received. Such proof systems, called XOR proof systems, have previously been shown to characterize MIP (= NEXP) in the case of classical provers but to reside in EXP in the case of quantum provers (who are allowed ...

We study the classical and quantumvalues of a class of oneand two-party unique games, that generalizes thewell-knownXORgames to the case of non-binary outcomes. In the bipartite case the generalizedXOR (XOR-d) gameswe study are a subclass of thewell-known linear games.We introduce a ‘constraint graph’ associated to such a game, with the constraints defining the game represented by an edge-color...

The Lightweight Secure Physically Unclonable Function (LSPUF) was proposed as a secure composition of Arbiter PUFs with additional XOR based input and output networks. But later, researchers proposed a Machine Learning (ML) based modeling attack on x-XOR LSPUF, and they also empirically showed that pure ML based modeling is not computationally scalable if the parameter x of x-XOR LSPUF is large...

Yao’s garbled-circuit approach enables constant-round secure two-party computation for any boolean circuit. In Yao’s original construction, each gate in the circuit requires the parties to perform a constant number of encryptions/decryptions, and to send/receive a constant number of ciphertexts. Kolesnikov and Schneider (ICALP 2008) proposed an improvement that allows XOR gates in the circuit t...

XOR-based Visual Cryptography Scheme (XOR-based VCS) is a method of secret image sharing. The principle VCS to encrypt into several encrypted images, called shares. No information about the can be obtained from any shares, and after applying logical XOR operation stack these original recovered. In this paper, we present new for grayscale or color image. This scheme encrypts (or color) n meaning...