Quantum direct secret sharing with efficient eavesdropping-check and authentication based on distributed fountain codes

We propose to use a simple and effective way to achieve secure quantum direct secret sharing. The proposed scheme uses the properties of fountain codes to allow a realization of the physical conditions necessary for the implementation of no-cloning principle for eavesdropping-check and authentication. In our scheme, to achieve a variety of security purposes, nonorthogonal state particles are inserted in the transmitted sequence carrying the secret shares to disorder it. However, the positions of the inserted nonorthogonal state particles are not announced directly, but are obtained by sending degrees and positions of a sequence that are pre-shared between Alice and each Bob. Moreover, they can confirm that whether there exists an eavesdropper without exchanging classical messages. Most importantly, without knowing the positions of the inserted nonorthogonal state particles and the sequence constituted by the first particles from every EPR pair, the proposed scheme is shown to be secure.

Poly(2-oxazoline) hydrogels as next generation three dimensional cell supports

Synthetic hydrogels selectively decorated with cell adhesion motifs are rapidly emerging as promising substrates for 3D cell culture. When cells are grown in 3D they experience potentially more physiologically relevant cell-cell interactions and physical cues compared with traditional 2D cell culture on stiff surfaces. A newly developed polymer based on poly(2-oxazoline)s has been used for the first time to control attachment of fibroblast cells and is discussed here for its potential use in 3D cell culture with particular focus on cancer cells towards the ultimate aim of high throughput screening of anti-cancer therapies. Advantages and limitations of using poly(2-oxazoline) hydrogels are discussed and compared with more established polymers, especially polyethylene glycol (PEG).

Does counting still count? Revisiting the security of counting based user authentication protocols against statistical attacks

At NDSS 2012, Yan et al. analyzed the security of several challenge-response type user authentication protocols against passive observers, and proposed a generic counting based statistical attack to recover the secret of some counting based protocols given a number of observed authentication sessions. Roughly speaking, the attack is based on the fact that secret (pass) objects appear in challenges with a different probability from non-secret (decoy) objects when the responses are taken into account. Although they mentioned that a protocol susceptible to this attack should minimize this difference, they did not give details as to how this can be achieved barring a few suggestions. In this paper, we attempt to fill this gap by generalizing the attack with a much more comprehensive theoretical analysis. Our treatment is more quantitative which enables us to describe a method to theoretically estimate a lower bound on the number of sessions a protocol can be safely used against the attack. Our results include 1) two proposed fixes to make counting protocols practically safe against the attack at the cost of usability, 2) the observation that the attack can be used on non-counting based protocols too as long as challenge generation is contrived, 3) and two main design principles for user authentication protocols which can be considered as extensions of the principles from Yan et al. This detailed theoretical treatment can be used as a guideline during the design of counting based protocols to determine their susceptibility to this attack. The Foxtail protocol, one of the protocols analyzed by Yan et al., is used as a representative to illustrate our theoretical and experimental results.

Designing awareness support for distributed cooperative design teams

Motivation Awareness is an integral part of remote collaborative work and has been an important theme within the CSCW research. Our project aims at understanding and mediating non-verbal cues between remote participants involved in a design project. Research approach Within the AMIDA project we focus on distributed 'cooperative design' teams. We especially focus on the 'material' signals - signals in which people communicate through material artefacts, locations and their embodied actions. We apply an ethnographic approach to understand the role of physical artefacts in co-located naturalistic design setting. Based on the results we will generate important implications to support remote design work. We plan to develop a mixed-reality interface supported by a shared awareness display. This awareness display will provide information about the activities happening in the design room to remotely located participants. Findings/Design Our preliminary investigation with real-world design teams suggests that both the materiality of designers' work settings and their social practices play an important role in understanding these material signals that are at play. Originality/Value Most research supporting computer mediated communication have focused on either face-to-face or linguistically oriented communication paradigms. Our research focuses on mediating the non-verbal, material cues for supporting collaborative activities without impoverishing what designers do in their day to day working lives. Take away message An ethnographic approach allows us to understand the naturalistic practices of design teams, which can lead to designing effective technologies to support group work. In that respect, the findings of our research will have a generic value beyond the application domain chosen (design teams).

Interconnected autonomous microgrids in smart grids with self-healing

In order to minimize the number of load shedding in a Microgrid during autonomous operation, islanded neighbour microgrids can be interconnected if they are on a self-healing network and an extra generation capacity is available in Distributed Energy Resources (DER) in one of the microgrids. In this way, the total load in the system of interconnected microgrids can be shared by all the DERs within these microgrids. However, for this purpose, carefully designed self-healing and supply restoration control algorithm, protection systems and communication infrastructure are required at the network and microgrid levels. In this chapter, first a hierarchical control structure is discussed for interconnecting the neighbour autonomous microgrids where the introduced primary control level is the main focus. Through the developed primary control level, it demonstrates how the parallel DERs in the system of multiple interconnected autonomous microgrids can properly share the load in the system. This controller is designed such that the converter-interfaced DERs operate in a voltage-controlled mode following a decentralized power sharing algorithm based on droop control. The switching in the converters is controlled using a linear quadratic regulator based state feedback which is more stable than conventional proportional integrator controllers and this prevents instability among parallel DERs when two microgrids are interconnected. The efficacy of the primary control level of DERs in the system of multiple interconnected autonomous microgrids is validated through simulations considering detailed dynamic models of DERs and converters.

Supplementary material : large scale read classification for next generation sequencing

Next Generation Sequencing (NGS) has revolutionised molecular biology, resulting in an explosion of data sets and an increasing role in clinical practice. Such applications necessarily require rapid identification of the organism as a prelude to annotation and further analysis. NGS data consist of a substantial number of short sequence reads, given context through downstream assembly and annotation, a process requiring reads consistent with the assumed species or species group. Highly accurate results have been obtained for restricted sets using SVM classifiers, but such methods are difficult to parallelise and success depends on careful attention to feature selection. This work examines the problem at very large scale, using a mix of synthetic and real data with a view to determining the overall structure of the problem and the effectiveness of parallel ensembles of simpler classifiers (principally random forests) in addressing the challenges of large scale genomics.

Increased generation of platelet-derived microparticles following percutaneous transluminal coronary angioplasty

Platelet-derived microparticles (PMPs) which are produced during platelet activation contribute to coagulation1 and bind to traumatized endothelium in an animal model2. Such endothelial injury occurs during percutaneous transluminal coronary angioplasty (PTCA), a procedure which restores the diameter of occluded coronary arteries using balloon inflations. However, re-occlusions subsequently develop in 20-25% of patients3, although this is limited by treatment with anti-platelet glycoprotein IIb/IIIa receptor drugs such as abciximab4. However, abciximab only partially decreases the need for revascularisation5, and therefore other mechanisms appear to be involved. As platelet activation occurs during PTCA, it is likely that PMPs may be produced and contribute to restenosis. This study population consisted of 113 PTCA patients, of whom 38 received abciximab. Paired peripheral arterial blood samples were obtained from the PTCA sheath: 1) following heparinisation (baseline); and 2) subsequent to all vessel manipulation (post-PTCA). Blood was prepared with an anti-CD61 (glycoprotein IIIa) fluorescence conjugated antibody to identify PMPs using flow cytometry, and PMP results expressed as a percentage of all CD61 events. The level of PMPs increased significantly from baseline following PTCA in the without abciximab group (paired t test, P=0.019). However, there was no significant change in the level of PMPs following PTCA in patients who received abciximab. Baseline clinical characteristics between patient groups were similar, although patients administered abciximab had more complex PTCA procedures, such as increased balloon inflation pressures (ANOVA, P=0.0219). In this study, we have clearly demonstrated that the level of CD61-positive PMPs increased during PTCA. This trend has been demonstrated previously, although a low sample size prevented statistical significance being attained6. The results of our work also demonstrate that there was no increase in PMPs after PTCA with abiciximab treatment. The increased PMPs may adhere to traumatized endothelium, contributing to re-occlusion of the arteries, but this remains to be determined. References: (1) Holme PA, Brosstad F, Solum NO. Blood Coagulation and Fibrinolysis. 1995;6:302-310. (2) Merten M, Pakala R, Thiagarajan P, Benedict CR. Circulation. 1999;99:2577-2582. (3) Califf RM. American Heart Journal.1995;130:680-684. (4) Coller BS, Scudder LE. Blood. 1985;66:1456-1459. (5) Topol EJ, Califf RM, Weisman HF, Ellis SG, Tcheng JE, Worley S, Ivanhoe R, George BS, Fintel D, Weston M, Sigmon K, Anderson KM, Lee KL, Willerson JT on behalf of the EPIC investigators. Lancet. 1994;343:881-886. (6) Scharf RE, Tomer A, Marzec UM, Teirstein PS, Ruggeri ZM, Harker LA. Arteriosclerosis and Thrombosis. 1992;12:1475-87.

Crypto topics and applications II

In this chapter we continue the exposition of crypto topics that was begun in the previous chapter. This chapter covers secret sharing, threshold cryptography, signature schemes, and finally quantum key distribution and quantum cryptography. As in the previous chapter, we have focused only on the essentials of each topic. We have selected in the bibliography a list of representative items, which can be consulted for further details. First we give a synopsis of the topics that are discussed in this chapter. Secret sharing is concerned with the problem of how to distribute a secret among a group of participating individuals, or entities, so that only predesignated collections of individuals are able to recreate the secret by collectively combining the parts of the secret that were allocated to them. There are numerous applications of secret-sharing schemes in practice. One example of secret sharing occurs in banking. For instance, the combination to a vault may be distributed in such a way that only specified collections of employees can open the vault by pooling their portions of the combination. In this way the authority to initiate an action, e.g., the opening of a bank vault, is divided for the purposes of providing security and for added functionality, such as auditing, if required. Threshold cryptography is a relatively recently studied area of cryptography. It deals with situations where the authority to initiate or perform cryptographic operations is distributed among a group of individuals. Many of the standard operations of single-user cryptography have counterparts in threshold cryptography. Signature schemes deal with the problem of generating and verifying electronic) signatures for documents.Asubclass of signature schemes is concerned with the shared-generation and the sharedverification of signatures, where a collaborating group of individuals are required to perform these actions. A new paradigm of security has recently been introduced into cryptography with the emergence of the ideas of quantum key distribution and quantum cryptography. While classical cryptography employs various mathematical techniques to restrict eavesdroppers from learning the contents of encrypted messages, in quantum cryptography the information is protected by the laws of physics.

Carbon, biodiversity and regional natural resource planning : towards high impact next generation plans

Given the increased importance of adaptation debates in global climate negotiations, pressure to achieve biodiversity, food and water security through managed landscape-scale adaptation will likely increase across the globe over the coming decade. In parallel, emerging market-based, terrestrial greenhouse gas abatement programs present a real opportunity to secure such adaptation to climate change through enhanced landscape resilience. Australia has an opportunity to take advantage of such programs through regional planning aspects of its governance arrangements for NRM. This paper explores necessary reforms to Australia's regional NRM planning systems to ensure that they will be better able to direct the nation's emerging GGA programs to secure enhanced landscape adaptation. © 2013 Planning Institute Australia.

A new grouping genetic algorithm for the MapReduce placement problem in cloud computing

MapReduce is a computation model for processing large data sets in parallel on large clusters of machines, in a reliable, fault-tolerant manner. A MapReduce computation is broken down into a number of map tasks and reduce tasks, which are performed by so called mappers and reducers, respectively. The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation. From the computational point of view, the mappers/reducers placement problem is a generation of the classical bin packing problem, which is NPcomplete. Thus, in this paper we propose a new grouping genetic algorithm for the mappers/reducers placement problem in cloud computing. Compared with the original one, our grouping genetic algorithm uses an innovative coding scheme and also eliminates the inversion operator which is an essential operator in the original grouping genetic algorithm. The new grouping genetic algorithm is evaluated by experiments and the experimental results show that it is much more efficient than four popular algorithms for the problem, including the original grouping genetic algorithm.

Distributed private matching and set operations

Motivated by the need of private set operations in a distributed environment, we extend the two-party private matching problem proposed by Freedman, Nissim and Pinkas (FNP) at Eurocrypt’04 to the distributed setting. By using a secret sharing scheme, we provide a distributed solution of the FNP private matching called the distributed private matching. In our distributed private matching scheme, we use a polynomial to represent one party’s dataset as in FNP and then distribute the polynomial to multiple servers. We extend our solution to the distributed set intersection and the cardinality of the intersection, and further we show how to apply the distributed private matching in order to compute distributed subset relation. Our work extends the primitives of private matching and set intersection by Freedman et al. Our distributed construction might be of great value when the dataset is outsourced and its privacy is the main concern. In such cases, our distributed solutions keep the utility of those set operations while the dataset privacy is not compromised. Comparing with previous works, we achieve a more efficient solution in terms of computation. All protocols constructed in this paper are provably secure against a semi-honest adversary under the Decisional Diffie-Hellman assumption.

On power minimisation and SNR maximisation of distributed beamforming in cooperative communication systems

A comparison of relay power minimisation subject to received signal-to-noise ratio (SNR) at the receiver and SNR maximisation subject to the total transmitted power of relays for a typical wireless network with distributed beamforming is presented. It is desirable to maximise receiver quality-of-service (QoS) and also to minimise the cost of transmission in terms of power. Hence, these two optimisation problems are very common and have been addressed separately in the literature. It is shown that SNR maximisation subject to power constraint and power minimisation subject to SNR constraint yield the same results for a typical wireless network. It proves that either one of the optimisation approaches is sufficient.

Generation of two isomers of C5H from the corresponding anions. A theoretically motivated mass spectrometric study

Molecular orbital calculations have predicted the stability of a range of connectivities for the radical C5H potential surface. The most energetically favorable of these include the linear C4CH geometry and two ring-chain structures HC2C3 and C2C3H The corresponding anions are also shown to be theoretically stable, and furthermore, a fourth isomer, C2CHC2, is predicted to be the most stable anion connectivity. These results have motivated experimental efforts. Methodologies for the generation of the non-ring-containing isomeric anions C4CH and C2CHC2 have been developed utilizing negative ion mass spectrometry. The absolute connectivities of the anions have been established using deuterium labeling, charge reversal, and neutralization reionization techniques. The success of the latter experiment confirms theoretical predictions of stability of the corresponding neutral species. This is the first reported observation of the neutral C2CHC2 species that calculations predict to be substantially less stable than the C4CH connectivity but still bound relative to isomerization processes.

Generation and characterization of ionic and neutral dihydroxy boron B(OH)(2)(+/0) in the gas phase

The dicoordinated borinium ion, dihydroxyborinium, B(OH)(2)(+) is generated from methyl boronic acid CH3B(OH)(2) by dissociative electron ionization and its connectivity confirmed by collisional activation. Neutralization-reionization (NR) experiments on this ion indicate that the neutral B(OH)(2) radical is a viable species in the gas phase. Both vertical neutralization of B(OH)(2)(+) and reionization of B(OH)(2) in the NR experiment are, however, associated with particularly unfavorable Franck-Condon factors. The differences in adiabatic and vertical electron transfer behavior can be traced back to a particular pi stabilization of the cationic species compared to the sp(2)-type neutral radical. Thermochemical data on several neutral and cationic boron compounds are presented based on calculations performed at the G2 level of theory.

Developing Co-operating Legal Knowledge Based Systems

In attempting to build intelligent litigation support tools, we have moved beyond first generation, production rule legal expert systems. Our work supplements rule-based reasoning with case based reasoning and intelligent information retrieval. This research, specifies an approach to the case based retrieval problem which relies heavily on an extended object-oriented / rule-based system architecture that is supplemented with causal background information. Machine learning techniques and a distributed agent architecture are used to help simulate the reasoning process of lawyers. In this paper, we outline our implementation of the hybrid IKBALS II Rule Based Reasoning / Case Based Reasoning system. It makes extensive use of an automated case representation editor and background information.