Results 11 to 20 of about 95,918 (238)
FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR [PDF]
Most implementations of Yao’s garbled circuit approach for 2-party secure computation use the free-XOR optimization of Kolesnikov & Schneider (ICALP 2008). We introduce an alternative technique called flexible-XOR (fleXOR) that generalizes free-XOR and offers several advantages.
Vladimir Kolesnikov +2 more
openaire +4 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuliang Zheng 0001, Xian-Mo Zhang
openaire +3 more sources
XOR Multiplexing Technique for Nanocomputers [PDF]
In emerging nanotechnologies, due to the manufacturing process, a significant percentage of components may be faulty. In order to make systems based on unreliable nano-scale components reliable, it is necessary to design fault-tolerant architectures.
Lianhua Yu +3 more
core +6 more sources
Multipartite entanglement in XOR games [PDF]
We study multipartite entanglement in the context of XOR games. In particular, we study the ratio of the entangled and classical \emph{biases}, which measure the maximum advantage of a quantum or classical strategy over a uniformly random strategy. For the case of two-player XOR games, Tsirelson proved that this ratio is upper bounded by the celebrated
J. Briët (Jop) +3 more
core +8 more sources
XOR-Based Compact Triangulations
Media, image processing, and geometric-based systems and applications need data structures to model and represent different geometric entities and objects. These data structures have to be time efficient and compact in term of space. Many structures in use are proposed to satisfy those constraints.
Mebarki, Abdelkrim
openaire +4 more sources
A note on the relation between XOR and Selective XOR lemmas [PDF]
Given an unpredictable Boolean function $f: \{0, 1\}^n \rightarrow \{0, 1\}$, the standard Yao's XOR lemma is a statement about the unpredictability of computing $\oplus_{i \in [k]}f(x_i)$ given $x_1, ..., x_k \in \{0, 1\}^n$, whereas the Selective XOR lemma is a statement about the unpredictability of computing $\oplus_{i \in S}f(x_i)$ given $x_1, ...,
openaire +3 more sources
On the Lower Bound of Cost of MDS Matrices
Ever since lightweight cryptography emerged as one of the trending topics in symmetric key cryptography, optimizing the implementation cost of MDS matrices has been in the center of attention.
Ayineedi Venkateswarlu +2 more
doaj +1 more source
Pathologic calcification of cartilage consists of the formation of basic calcium phosphate (BCP) and/or calcium pyrophosphate dihydrate (CPPD) containing calcium crystals in mature hyaline or articular cartilage and is associated with aging, cartilage ...
Sonia Nasi +9 more
doaj +1 more source
XOR and Non-XOR Differential Probabilities [PDF]
Differential cryptanalysis is a well-known attack on iterated ciphers whose success is determined by the probability of predicting sequences of differences from one round of the cipher to the next. The notion of difference is typically defined with respect to the group operation (s) used to combine the subkey in the round function F.
Hawkes, Philip, O'Connor, Luke
openaire +2 more sources
Cyclin-dependent kinase five mediates activation of lung xanthine oxidoreductase in response to hypoxia. [PDF]
Xanthine oxidoreductase (XOR) is involved in oxidative metabolism of purines and is a source of reactive oxygen species (ROS). As such, XOR has been implicated in oxidant-mediated injury in multiple cardiopulmonary diseases.
Bo S Kim +9 more
doaj +1 more source

