Minimizing information leakage of tree-based RFID authentication protocols using alternate tree-walking

The privacy of efficient tree-based RFID authentication protocols is heavily dependent on the branching factor on the top layer. Indefinitely increasing the branching factor, however, is not a viable option. This paper proposes the alternate-tree walking scheme as well as two protocols to circumvent this problem. The privacy of the resulting protocols is shown to be comparable to that of linear-time protocols, where there is no leakage of information, whilst reducing the computational load of the database by one-third of what is required of tree-based protocols during authentication. We also identify and address a limitation in quantifying privacy in RFID protocols

Evaluation of melanin-targeted radiotherapy in combination with radiosensitizing drugs for the treatment of melanoma

The incidence of malignant melanoma is rising faster than that of any other cancer in the United States. An [131I]-labeled benzamide - [131I]MIP-1145 - selectively targets melanin, reduces melanoma tumor burden and increases survival in preclinical models. Our purpose was to determine the potential of radiosensitizers to enhance the anti-tumor efficacy of [131I]MIP-1145. Melanotic (A2058) and amelanotic (A375 and SK-N-BE(2c)) cells were treated with [131I]MIP-1145 as a single agent or in combination with drugs with radiosenitizing potential. Cellular uptake of [131I]MIP-1145 and toxicity were assessed in monolayer culture. The interaction between radiosensitizers and [131I]MIP-1145 was evaluated by combination index analysis in monolayer cultures and by delayed growth of multicellular tumor spheroids. [131I]MIP-1145 was taken up by and was toxic to melanotic cells but not amelanotic cells. Combination treatments comprising [131I]MIP-1145 with the topoisomerase inhibitor topotecan or the PARP-1 inhibitor AG014699 resulted in synergistic clonogenic cell kill and enhanced delay of the growth of spheroids derived from melanotic melanoma cells. The proteasome inhibitor bortezomib had no synergistic cytotoxic effect with [131I]MIP-1145 and failed to enhance the delay of spheroid growth. Following combination treatment of amelanotic cells, neither synergistic clonogenic cell kill nor enhanced growth delay of spheroids was observed

The role of copper in disulfiram-induced toxicity and radiosensitisation of cancer cells.

Abstract Disulfiram has been used for several decades in the treatment of alcoholism. It now shows promise as an anti-cancer drug and radiosensitizer. Proposed mechanisms of action include the induction of oxidative stress and inhibition of proteasome activity. Our purpose was to determine the potential of disulfiram to enhance the anti-tumor efficacy of external beam -irradiation and 131I-metaiodobenzylguanidine (131I-MIBG), a radiopharmaceutical used for the therapy of neuroendocrine tumors. Methods: The role of copper in disulfiram-induced toxicity was investigated by clonogenic assay after treatment of human SK-N-BE(2c) neuroblastoma and UVW/NAT glioma cells. Synergistic interaction between disulfiram and radiotherapy was evaluated by combination index analysis. Tumor growth delay was determined in vitro using multicellular tumor spheroids and in vivo using human tumor xenografts in athymic mice. Results: Escalating disulfiram dosage caused a biphasic reduction in the surviving fraction of clonogens. Clonogenic cell kill after treatment with disulfiram concentrations less than 4 M was copper-dependent, whereas cytotoxicity at concentrations greater than 10 M was caused by oxidative stress. The cytotoxic effect of disulfiram was maximal when administered with equimolar copper. Likewise, disulfiram’s radiosensitization of tumor cells was copper-dependent. Furthermore, disulfiram treatment enhanced the toxicity of 131I-MIBG to spheroids and xenografts expressing the noradrenaline transporter. Conclusions: The results demonstrate that (i) the cytotoxicity of disulfiram was copper-dependent; (ii) molar excess of disulfiram relative to copper resulted in attenuation of disulfiram-mediated cytotoxicity; (iii) copper was required for the radiosensitizing activity of disulfiram and (iv) copper-complexed disulfiram enhanced the efficacy not only of external beam radiation but also of targeted radionuclide therapy in the form of 131I-MIBG. Therefore disulfiram may have anti-cancer potential in combination with radiotherapy

Denial-of-Service Resistance in Key Establishment

Denial of Service (DoS) attacks are an increasing problem for network connected systems. Key establishment protocols are applications that are particularly vulnerable to DoS attack as they are typically required to perform computationally expensive cryptographic operations in order to authenticate the protocol initiator and to generate the cryptographic keying material that will subsequently be used to secure the communications between initiator and responder. The goal of DoS resistance in key establishment protocols is to ensure that attackers cannot prevent a legitimate initiator and responder deriving cryptographic keys without expending resources beyond a responder-determined threshold. In this work we review the strategies and techniques used to improve resistance to DoS attacks. Three key establishment protocols implementing DoS resistance techniques are critically reviewed and the impact of misapplication of the techniques on DoS resistance is discussed. Recommendations on effectively applying resistance techniques to key establishment protocols are made

Digital image watermarking: its formal model, fundamental properties and possible attacks

While formal definitions and security proofs are well established in some fields like cryptography and steganography, they are not as evident in digital watermarking research. A systematic development of watermarking schemes is desirable, but at present their development is usually informal, ad hoc, and omits the complete realization of application scenarios. This practice not only hinders the choice and use of a suitable scheme for a watermarking application, but also leads to debate about the state-of-the-art for different watermarking applications. With a view to the systematic development of watermarking schemes, we present a formal generic model for digital image watermarking. Considering possible inputs, outputs, and component functions, the initial construction of a basic watermarking model is developed further to incorporate the use of keys. On the basis of our proposed model, fundamental watermarking properties are defined and their importance exemplified for different image applications. We also define a set of possible attacks using our model showing different winning scenarios depending on the adversary capabilities. It is envisaged that with a proper consideration of watermarking properties and adversary actions in different image applications, use of the proposed model would allow a unified treatment of all practically meaningful variants of watermarking schemes

In Search of Homo Economicus: Behavioral Experiments in 15 Small-Scale Societies

We can summarize our results as follows. First, the canonical model is not supported in any society studied. Second, there is considerably more behavioral variability across groups than had been found in previous cross-cultural research, and the canonical model fails in a wider variety of ways than in previous experiments. Third, group-level differences in economic organization and the degree of market integration explain a substantial portion of the behavioral variation across societies: the higher the degree of market integration and the higher the payoffs to cooperation, the greater the level of cooperation in experimental games. Fourth, individual-level economic and demographic variables do not explain behavior either within or across groups. Fifth, behavior in the experiments is generally consistent with economic patterns of everyday life in these societies

Unification modulo a partial theory of exponentiation

Modular exponentiation is a common mathematical operation in modern cryptography. This, along with modular multiplication at the base and exponent levels (to different moduli) plays an important role in a large number of key agreement protocols. In our earlier work, we gave many decidability as well as undecidability results for multiple equational theories, involving various properties of modular exponentiation. Here, we consider a partial subtheory focussing only on exponentiation and multiplication operators. Two main results are proved. The first result is positive, namely, that the unification problem for the above theory (in which no additional property is assumed of the multiplication operators) is decidable. The second result is negative: if we assume that the two multiplication operators belong to two different abelian groups, then the unification problem becomes undecidable.Comment: In Proceedings UNIF 2010, arXiv:1012.455

Privacy Preserving Multi-Server k-means Computation over Horizontally Partitioned Data

The k-means clustering is one of the most popular clustering algorithms in data mining. Recently a lot of research has been concentrated on the algorithm when the dataset is divided into multiple parties or when the dataset is too large to be handled by the data owner. In the latter case, usually some servers are hired to perform the task of clustering. The dataset is divided by the data owner among the servers who together perform the k-means and return the cluster labels to the owner. The major challenge in this method is to prevent the servers from gaining substantial information about the actual data of the owner. Several algorithms have been designed in the past that provide cryptographic solutions to perform privacy preserving k-means. We provide a new method to perform k-means over a large set using multiple servers. Our technique avoids heavy cryptographic computations and instead we use a simple randomization technique to preserve the privacy of the data. The k-means computed has exactly the same efficiency and accuracy as the k-means computed over the original dataset without any randomization. We argue that our algorithm is secure against honest but curious and passive adversary.Comment: 19 pages, 4 tables. International Conference on Information Systems Security. Springer, Cham, 201