The eight variable homogeneous degree three bent functions

We determine the affine equivalence classes of the eight variable degree three homogeneous bent functions using a new algorithm. Our algorithm applies to general bent functions and can systematically determine the automorphism groups. We provide a partial verification of the enumeration of eight variable degree three homogeneous bent functions obtained by Meng et al. We determine the affine equivalence classes of these functions.

Ideal threshold schemes from MDS codes

We observe that MDS codes have interesting properties that can be used to construct ideal threshold schemes. These schemes permit the combiner to detect cheating, identify cheaters and recover the correct secret. The construction is later generalised so the resulting secret sharing is resistant against the Tompa-Woll cheating.

An ideal and robust threshold RSA

We present a novel implementation of the threshold RSA. Our solution is conceptually simple, and leads to an easy design of the system. The signing key is shared in additive form, which is desirable for collaboratively performing cryptographic transformations, and its size, at all times, is logn, where n is the RSA modulus. That is, the system is ideal.

Crystalline Si nanoparticles below crystallization threshold : effects of collisional heating in non-thermal atmospheric-pressure microplasmas

Nucleation and growth of highly crystalline silicon nanoparticles in atmospheric-pressure low-temperature microplasmas at gas temperatures well below the Si crystallization threshold and within a short (100 μs) period of time are demonstrated and explained. The modeling reveals that collision-enhanced ion fluxes can effectively increase the heat flux on the nanoparticle surface and this heating is controlled by the ion density. It is shown that nanoparticles can be heated to temperatures above the crystallization threshold. These combined experimental and theoretical results confirm the effective heating and structure control of Si nanoparticles at atmospheric pressure and low gas temperatures.

Standards that we can 'own' : Threshold Learning Outcomes for Journalism, Public Relations, and Media & Communication Studies

This paper outlines the progress by the JoMeC (Journalism, Media & Communication) Network in developing TLO (Threshold Learning Outcome) statements for Bachelor-level university programs in the disciplines of Journalism, Public Relations and Media & Communications Studies. The paper presents the finalised TLO statement for Journalism, and outlines moves to engage discipline-based groups to further develop preliminary TLOs for Public Relations and Media & Communication Studies. The JoMeC Network was formed in 2011, in response to requirements that from 2014 all degrees and qualifications at Australian universities would be able to demonstrate that they comply with the threshold learning standards set by the Australian Qualifications Framework (AQF). The AQF’s threshold standards define the minimum types and levels of knowledge, skills and capabilities that a student must demonstrate in order to graduate. The Tertiary Education Quality and Standards Agency (TEQSA) will use the AQF’s threshold standards as a key tool in recording and assessing the performance of higher educational institutions, and determining whether they should be registered as Australian Higher Education Providers under the Higher Education Standards Framework. The Office of Learning & Teaching (OLT) places the onus on discipline communities to collaborate in order to develop and ‘own’ the threshold learning standards that can be considered the minimum learning outcomes of university-level programs in that field. With the support of an OLT Grant, the JoMeC Network’s prime goal has been to develop three sets of discipline-specific TLOs – one each for the Journalism, Public Relations, and Media & Communications Studies disciplines. This paper describes the processes of research, consultation, drafting and ongoing revision of the TLO for Journalism. It outlines the processes that the JoMeC Network has taken in developing a preliminary TLO draft to initiate discussion of Public Relations and Media & Communication Studies. The JoMeC Network plans to hand management of further development of these TLOs to scholars within the discipline who will engage with academics and other stakeholders to develop statements that the respective disciplines can embrace and ‘own’.

Lattice-based threshold-changeability for standard CRT secret-sharing schemes

We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the dealer and the shareholders. Previous solutions to this problem require one to start off with a non-standard scheme designed specifically for this purpose, or to have secure channels between shareholders. In contrast, we show how to increase the threshold parameter of the standard CRT secret-sharing scheme without secure channels between the shareholders. Our method can thus be applied to existing CRT schemes even if they were set up without consideration to future threshold increases. Our method is a positive cryptographic application for lattice reduction algorithms, and we also use techniques from lattice theory (geometry of numbers) to prove statements about the correctness and information-theoretic security of our constructions.

Lattice-based threshold-changeability for standard Shamir secret-sharing schemes

We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the dealer and the shareholders. Previous solutions to this problem require one to start off with a non-standard scheme designed specifically for this purpose, or to have communication between shareholders. In contrast, we show how to increase the threshold parameter of the standard Shamir secret-sharing scheme without communication between the shareholders. Our technique can thus be applied to existing Shamir schemes even if they were set up without consideration to future threshold increases. Our method is a new positive cryptographic application for lattice reduction algorithms, inspired by recent work on lattice-based list decoding of Reed-Solomon codes with noise bounded in the Lee norm. We use fundamental results from the theory of lattices (Geometry of Numbers) to prove quantitative statements about the information-theoretic security of our construction. These lattice-based security proof techniques may be of independent interest.

Threshold MACs

The power of sharing computation in a cryptosystem is crucial in several real-life applications of cryptography. Cryptographic primitives and tasks to which threshold cryptosystems have been applied include variants of digital signature, identification, public-key encryption and block ciphers etc. It is desirable to extend the domain of cryptographic primitives which threshold cryptography can be applied to. This paper studies threshold message authentication codes (threshold MACs). Threshold cryptosystems usually use algebraically homomorphic properties of the underlying cryptographic primitives. A typical approach to construct a threshold cryptographic scheme is to combine a (linear) secret sharing scheme with an algebraically homomorphic cryptographic primitive. The lack of algebraic properties of MACs rules out such an approach to share MACs. In this paper, we propose a method of obtaining a threshold MAC using a combinatorial approach. Our method is generic in the sense that it is applicable to any secure conventional MAC by making use of certain combinatorial objects, such as cover-free families and their variants. We discuss the issues of anonymity in threshold cryptography, a subject that has not been addressed previously in the literature in the field, and we show that there are trade-offis between the anonymity and efficiency of threshold MACs.

Shared generation of pseudo-random functions

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0⩽tfunctions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where fsi(·)'s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali–Sidney scheme is a special case of this general construction. We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

Shared generation of pseudo-random functions with cumulative maps

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0 ≤ t < u ≤ n. The idea behind the Micali-Sidney scheme is to generate and distribute secret seeds S = s1, . . . , sd of a poly-random collection of functions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where f s i (·)’s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali-Sidney scheme is a special case of this general construction.We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

The Saccharomyces cerevisiae RNA-binding protein Rbp29 functions in cytoplasmic mRNA metabolism

Here we report that the Saccharomyces cerevisiae RBP29 (SGN1, YIR001C) gene encodes a 29-kDa cytoplasmic protein that binds to mRNA in vivo. Rbp29p can be co-immunoprecipitated with the poly(A) tail-binding protein Pab1p from crude yeast extracts in a dosageand RNA-dependent manner. In addition, recombinant Rbp29p binds preferentially to poly(A) with nanomolar binding affinity in vitro. Although RBP29 is not essential for cell viability, its deletion exacerbates the slow growth phenotype of yeast strains harboring mutations in the eIF4G genes TIF4631 and TIF4632. Furthermore, overexpression of RBP29 suppresses the temperaturesensitive growth phenotype of specific tif4631, tif4632, and pab1 alleles. These data suggest that Rbp29p is an mRNA-binding protein that plays a role in modulating the expression of cytoplasmic mRNA.

Independent functions of yeast Pcf11p in pre-mRNA 3' end processing and in transcription termination

Pcf11p, an essential subunit of the yeast cleavage factor IA, is required for pre‐mRNA 3′ end processing, binds to the C‐terminal domain (CTD) of the largest subunit of RNA polymerase II (RNAP II) and is involved in transcription termination. We show that the conserved CTD interaction domain (CID) of Pcf11p is essential for cell viability. Interestingly, the CTD binding and 3′ end processing activities of Pcf11p can be functionally uncoupled from each other and provided by distinct Pcf11p fragments in trans. Impaired CTD binding did not affect the 3′ end processing activity of Pcf11p and a deficiency of Pcf11p in 3′ end processing did not prevent CTD binding. Transcriptional run‐on analysis with the CYC1 gene revealed that loss of cleavage activity did not correlate with a defect in transcription termination, whereas loss of CTD binding did. We conclude that Pcf11p is a bifunctional protein and that transcript cleavage is not an obligatory step prior to RNAP II termination.

Role of the N-terminal region in G protein-coupled receptor functions : negative modulation revealed by 5-HT2B receptor polymorphisms

The putative role of the N-terminal region of rhodopsin-like 7 transmembrane biogenic amine receptors in agonist-induced signaling has not yet been clarified despite recent advances in 7 transmembrane receptor structural biology. Given the existence of N-terminal nonsynonymous polymorphisms (R6G;E42G) within the HTR2B gene in a drug-abusing population, we assessed whether these polymorphisms affect 5-hydroxytryptamine 2B (5-HT2B) receptor in vitro pharmacologic and coupling properties in transfected COS-7 cells. Modification of the 5-HT2B receptor N terminus by the R6G;E42G polymorphisms increases such agonist signaling pathways as inositol phosphate accumulation as assessed by either classic or operational models. The N-terminal R6G;E42G mutations of the 5-HT2B receptor also increase cell proliferation and slow its desensitization kinetics compared with the wild-type receptor, further supporting a role for the N terminus in transduction efficacy. Furthermore, by coexpressing a tethered wild-type 5-HT2B receptor N terminus with a 5-HT2B receptor bearing a N-terminal deletion, we were able to restore original coupling. This reversion to normal activity of a truncated 5-HT2B receptor by coexpression of the membrane-tethered wild-type 5-HT2B receptor N terminus was not observed using a membrane-tethered 5-HT2B receptor R6G;E42G N terminus. These data suggest that the N terminus exerts a negative control over basal as well as agonist-stimulated receptor activity that is lost in the R6G;E42G mutant. Our findings reveal a new and unanticipated role of the 5-HT2B receptor N terminus as a negative modulator, affecting both constitutive and agonist-stimulated activity. Moreover, our data caution against excluding the N terminus and extracellular loops in structural studies of this 7 transmembrane receptor family

Chromosomal genotoxicity of nitrobenzene and benzonitrile

In order to investigate the chromosomal genotoxicity of nitrobenzene and benzonitrile, we studied the induction of micronuclei (MN) by these test compounds in V79 cells, as well as effects on the formation and stability of microtubules and on motor protein functions. No cytotoxicity was seen in V79 cell cultures in terms of Neutral red uptake after 18 h treatment with up to 1 mM nitrobenzene or 1 mM benzonitrile. Subsequently, a concentration range up to 100 μM was used in the experiments on induction of MN. Both test compounds exhibit a weak, but definitely positive test result compared to the solvent (DMSO) control. Minimal effect concentrations of nitrobenzene and benzonitrile appeared as low as 0.01 μM, and no-effect-concentrations were between 0.001 and 0.005 μM. Clearly enhanced MN rates were found at 0.1 μM and higher. Both, nitrobenzene and benzonitrile, induced mostly kinetochor (CREST)-positive micronuclei, thus characterising the chromosomal effects as aneugenic. In cell-free assays, a slight effect on tubulin assembly was observed at 1 mM nitrobenzene without addition of DMSO. Higher concentrations (5 mM) led to secondary effects. In presence of 1% DMSO, nitrobenzene exerted no detectable effect on tubulin assembly up to the solubility limit in water of about 15 mM. For benzonitrile in presence of DMSO, a clear dose-response of inhibition of tubulin assembly at 37°C was seen above the no-effect-concentration of 2 mM, with an IC50 of 13 mM and protein denaturation starting above a level of about 20 mM. The nature of the effects of nitrobenzene and benzonitrile on the association of tubulin to form microtubules was confirmed by electron microscopy. Treatment by either 5 mM nitrobenzene or 13 mM benzonitrile plus 1% DMSO left the microtubular structure intact whereas 5 mM nitrobenzene, in absence of DMSO, led to irregular cluster formations. The experiments demonstrate that both nitrobenzene and benzonitrile, in millimolar concentration ranges, may lead to interference with tubulin assembly in a cell-free system. The functionality of the tubulin-kinesin motor protein system was assessed using the microtubule gliding assay. Nitrobenzene affected the gliding velocity in a concentration-dependent manner, starting at about 7.5 μM and reaching complete inhibition of motility at 30 μM, whereas benzonitrile up to 200 μM did not affect the kinesin-driven gliding velocity. The micronucleus assay data demonstrate a chromosomal endpoint of genotoxicity of nitrobenzene and benzonitrile. Aneugenic effects of both compounds occur at remarkably low concentrations, with lowest-effect-concentrations being 0.1 μM. This points to the relevance of interactions with the cellular spindle apparatus.