The Rainbow Signature Scheme is a non-trivial generalization of the well known Unbalanced Oil and Vinegar Signature Scheme (Eurocrypt '99) minimizing the length of the signatures. Recently a new variant based on non-commutative rings, called NC-Rainbow, was introduced at CT-RSA 2012 to further minimize the secret key size. We disprove the claim that NC-Rainbow is as secure as Rainbow in general...

An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In addition to being a natural combinatorial problem, the rainbow connectivity problem is motivated by applications in cell...

As a first step toward the genetic mapping of QTL affecting stress response variation in rainbow trout, we performed complex segregation analyses (CSA) fitting mixed inheritance models of plasma cortisol by using Bayesian methods in large full-sib families of rainbow trout. To date, no studies have been conducted to determine the mode of inheritance of stress response as measured by plasma cort...

In this study, the physiological effects that the increasing carbondioxide concentrations on rainbow trout, Oncorhynchus mykiss is evaluated by using serum biochemical variables and carbonic anhydrase activities. The fish were exposed for 14 days to 14 mg/L concentrations of CO2. The serum GLU value showed a significant increase in the group exposed to CO2 compared to the control group at days ...

An r-edge-coloring of a graph is an assignment of r colors to the edges of the graph. An exactly r-edge-coloring of a graph is an r-edge-coloring of the graph that uses all r colors. A matching of an edge-colored graph is called rainbow matching, if no two edges have the same color in the matching. In this paper, we prove that an exactly r-edge-colored complete graph of order n has a rainbow ma...

................................................................................................................................................ iii Acknowledgements................................................................................................................................ v Table of

A path in an edge-colored graph is called a rainbow path if the edges on it have distinct colors. For k ≥ 1, the rainbow-k-connectivity of a graph G, denoted rck(G), is the minimum number of colors required to color the edges of G in such a way that every two distinct vertices are connected by at least k internally vertex-disjoint rainbow paths. In this paper, we study rainbow-k-connectivity in...