A decision table method for randomness measurement

Data quality has become a major concern for organisations. The rapid growth in the size and technology of a databases and data warehouses has brought significant advantages in accessing, storing, and retrieving information. At the same time, great challenges arise with rapid data throughput and heterogeneous accesses in terms of maintaining high data quality. Yet, despite the importance of data quality, literature has usually condensed data quality into detecting and correcting poor data such as outliers, incomplete or inaccurate values. As a result, organisations are unable to efficiently and effectively assess data quality. Having an accurate and proper data quality assessment method will enable users to benchmark their systems and monitor their improvement. This paper introduces a granules mining for measuring the random degree of error data which will enable decision makers to conduct accurate quality assessment and allocate the most severe data, thereby providing an accurate estimation of human and financial resources for conducting quality improvement tasks.

Effort-release public-key encryption from cryptographic puzzles

Timed-release cryptography addresses the problem of “sending messages into the future”: information is encrypted so that it can only be decrypted after a certain amount of time, either (a) with the help of a trusted third party time server, or (b) after a party performs the required number of sequential operations. We generalise the latter case to what we call effort-release public key encryption (ER-PKE), where only the party holding the private key corresponding to the public key can decrypt, and only after performing a certain amount of computation which may or may not be parallelisable. Effort-release PKE generalises both the sequential-operation-based timed-release encryption of Rivest, Shamir, and Wagner, and also the encapsulated key escrow techniques of Bellare and Goldwasser. We give a generic construction for ER-PKE based on the use of moderately hard computational problems called puzzles. Our approach extends the KEM/DEM framework for public key encryption by introducing a difficulty notion for KEMs which results in effort-release PKE. When the puzzle used in our generic construction is non-parallelisable, we recover timed-release cryptography, with the addition that only the designated receiver (in the public key setting) can decrypt.

Quantum key distribution in the classical authenticated key exchange framework

Key establishment is a crucial primitive for building secure channels in a multi-party setting. Without quantum mechanics, key establishment can only be done under the assumption that some computational problem is hard. Since digital communication can be easily eavesdropped and recorded, it is important to consider the secrecy of information anticipating future algorithmic and computational discoveries which could break the secrecy of past keys, violating the secrecy of the confidential channel. Quantum key distribution (QKD) can be used generate secret keys that are secure against any future algorithmic or computational improvements. QKD protocols still require authentication of classical communication, although existing security proofs of QKD typically assume idealized authentication. It is generally considered folklore that QKD when used with computationally secure authentication is still secure against an unbounded adversary, provided the adversary did not break the authentication during the run of the protocol. We describe a security model for quantum key distribution extending classical authenticated key exchange (AKE) security models. Using our model, we characterize the long-term security of the BB84 QKD protocol with computationally secure authentication against an eventually unbounded adversary. By basing our model on traditional AKE models, we can more readily compare the relative merits of various forms of QKD and existing classical AKE protocols. This comparison illustrates in which types of adversarial environments different quantum and classical key agreement protocols can be secure.

FGFR2 point mutations in 466 Endometrioid Endometrial Tumors : relationship with MSI, KRAS, PIK3CA, CTNNB1 mutations and Clinicopathological features

Mutations in multiple oncogenes including KRAS, CTNNB1, PIK3CA and FGFR2 have been identified in endometrial cancer. The aim of this study was to provide insight into the clinicopathological features associated with patterns of mutation in these genes, a necessary step in planning targeted therapies for endometrial cancer. 466 endometrioid endometrial tumors were tested for mutations in FGFR2, KRAS, CTNNB1, and PIK3CA. The relationships between mutation status, tumor microsatellite instability (MSI) and clinicopathological features including overall survival (OS) and disease-free survival (DFS) were evaluated using Kaplan-Meier survival analysis and Cox proportional hazard models. Mutations were identified in FGFR2 (48/466); KRAS (87/464); CTNNB1 (88/454) and PIK3CA (104/464). KRAS and FGFR2 mutations were significantly more common, and CTNNB1 mutations less common, in MSI positive tumors. KRAS and FGFR2 occurred in a near mutually exclusive pattern (p = 0.05) and, surprisingly, mutations in KRAS and CTNNB1 also occurred in a near mutually exclusive pattern (p = 0.0002). Multivariate analysis revealed that mutation in KRAS and FGFR2 showed a trend (p = 0.06) towards longer and shorter DFS, respectively. In the 386 patients with early stage disease (stage I and II), FGFR2 mutation was significantly associated with shorter DFS (HR = 3.24; 95% confidence interval, CI, 1.35-7.77; p = 0.008) and OS (HR = 2.00; 95% CI 1.09-3.65; p = 0.025) and KRAS was associated with longer DFS (HR = 0.23; 95% CI 0.05-0.97; p = 0.045). In conclusion, although KRAS and FGFR2 mutations share similar activation of the MAPK pathway, our data suggest very different roles in tumor biology. This has implications for the implementation of anti-FGFR or anti-MEK biologic therapies.

Fully private revocable predicate encryption

We introduce the concept of Revocable Predicate Encryption (RPE), which extends current predicate encryption setting with revocation support: private keys can be used to decrypt an RPE ciphertext only if they match the decryption policy (defined via attributes encoded into the ciphertext and predicates associated with private keys) and were not revoked by the time the ciphertext was created. We formalize the notion of attribute hiding in the presence of revocation and propose an RPE scheme, called AH-RPE, which achieves attribute-hiding under the Decision Linear assumption in the standard model. We then present a stronger privacy notion, termed full hiding, which further cares about privacy of revoked users. We propose another RPE scheme, called FH-RPE, that adopts the Subset Cover Framework and offers full hiding under the Decision Linear assumption in the standard model. The scheme offers very flexible privacy-preserving access control to encrypted data and can be used in sender-local revocation scenarios.

A parallel cooperative co-evolutionary genetic algorithm for the composite SaaS placement problem in Cloud computing

A composite SaaS (Software as a Service) is a software that is comprised of several software components and data components. The composite SaaS placement problem is to determine where each of the components should be deployed in a cloud computing environment such that the performance of the composite SaaS is optimal. From the computational point of view, the composite SaaS placement problem is a large-scale combinatorial optimization problem. Thus, an Iterative Cooperative Co-evolutionary Genetic Algorithm (ICCGA) was proposed. The ICCGA can find reasonable quality of solutions. However, its computation time is noticeably slow. Aiming at improving the computation time, we propose an unsynchronized Parallel Cooperative Co-evolutionary Genetic Algorithm (PCCGA) in this paper. Experimental results have shown that the PCCGA not only has quicker computation time, but also generates better quality of solutions than the ICCGA.

Privacy by design : Does it matter for social networks?

Privacy is an important component of freedom and plays a key role in protecting fundamental human rights. It is becoming increasingly difficult to ignore the fact that without appropriate levels of privacy, a person’s rights are diminished. Users want to protect their privacy - particularly in “privacy invasive” areas such as social networks. However, Social Network users seldom know how to protect their own privacy through online mechanisms. What is required is an emerging concept that provides users legitimate control over their own personal information, whilst preserving and maintaining the advantages of engaging with online services such as Social Networks. This paper reviews “Privacy by Design (PbD)” and shows how it applies to diverse privacy areas. Such an approach will move towards mitigating many of the privacy issues in online information systems and can be a potential pathway for protecting users’ personal information. The research has also posed many questions in need of further investigation for different open source distributed Social Networks. Findings from this research will lead to a novel distributed architecture that provides more transparent and accountable privacy for the users of online information systems.

Living and Working on the Cusp of Contradictions

In this article Jo Phoenix argues that the struggles practitioners face to have the complex welfare needs of sexually exploited young people recognised are likely to continue into the future. The argument is made by examining three profound tensions shaping the context which both young people and practitioners inhabit. These tensions are between the, broadly, protectionist agenda of policy development on sexual exploitation and: firstly, socio-cultural changes in respect of consumption, sex and identities; secondly political changes and punitive youth justice system expansionism; and, finally, the closed and moralist rhetoric justifying recent policy changes. In the final analysis, young people and practitioners get caught in these contradictions in ways that foreclose critical examination of policy development and recognition of the complexities of the issues involved.