Secure Distributed Key Generation for Discrete-Log Based Cryptosystems

A Distributed Key Generation (DKG) protocol is an essential component of threshold cryptosystems required to initialize the cryptosystem securely and generate its private and public keys. In the case of discrete-log-based (dlog-based) threshold signature schemes (ElGamal and its derivatives), the DKG protocol is further used in the distributed signature generation phase to generate one-time signature randomizers (r = g^k). In this paper we show that a widely used dlog-based DKG protocol suggested by Pedersen does not guarantee a uniformly random distribution of generated keys: we describe an efficient active attacker controlling a small number of parties which successfully biases the values of the generated keys away from uniform. We then present a new DKG protocol for the setting of dlog-based cryptosystems which we prove to satisfy the security requirements from DKG protocols and, in particular, it ensures a uniform distribution of the generated keys. The new protocol can be used as a secure replacement for the many applications of Pedersen's protocol. Motivated by the fact that the new DKG protocol incurs additional communication cost relative to Pedersen's original protocol, we investigate whether the latter can be used in specific applications which require relaxed security properties from the DKG protocol. We answer this question affirmatively by showing that Pedersen's protocol suffices for the secure implementation of certain threshold cryptosystems whose security can be reduced to the hardness of the discrete logarithm problem. In particular, we show Pedersen's DKG to be sufficient for the construction of a threshold Schnorr signature scheme. Finally, we observe an interesting trade-off between security (reductions), computation, and communication that arises when comparing Pedersen's DKG protocol with ours.     

Pericyclic Organometallic Reactions. Substituent Effects on Cycloadditions and Rearrangements of (η4-cycloheptatriene)Fe(CO)3 Derivatives

The mechanism of the reactions of (η⁴-cycloheptatrien-1-al)Fe(CO)₃ and its ethyleneglycol acetal with tetracyanoethylene (TCNE) was studied. The aldehyde undergoes a fast reversible 3+2 cycloaddition involving the free aldehyde-substituted double bond, and a slow irreversible 3+2 cycloaddition at the coordinated site. The latter, σ,π-allylic complex undergoes a slow interconversion with the corresponding 5 +2 isomer via the pericyclic [3,3]-sigmahaptotropic rearrangement. In contrast, the acetal reacts with TCNE at the free acetal-substituted double bond to give a single kinetic 3+2 adduct, which, under thermodynamic conditions, undergoes a [4,4]-sigmahaptotropic rearrangement to the 6 + 2 adduct. The reaction kinetics was followed by ¹H NMR. The effect of substituents on the reaction course is discussed, and the detailed mechanism of both the cycloadditions and rearrangements is described.     

A data mining approach to classify serum creatinine values in patients undergoing continuous ambulatory peritoneal dialysis

Wireless Networks - Continuous ambulatory peritoneal dialysis (CAPD) is a treatment used by patients in the end-stage of chronic kidney diseases. Those patients need to be monitored using blood...     

Background memory area estimation for multidimensional signalprocessing systems

Memory cost is responsible for a large amount of the chip and/or board area of customized video and image processing system realizations. In this paper, we present a novel technique-founded on data-flow analysis which allows one to address the problem of background memory size evaluation for a given nonprocedural algorithm specification, operating on multidimensional signals with affine indexes. Most of the target applications are characterized by a huge number of signals, so a new polyhedral data-flow model operating on groups of scalar signals is proposed. These groups are obtained by a novel analytical partitioning technique, allowing to select a desired granularity, depending on the application complexity. The method incorporates a way to tradeoff memory size with computational and controller complexity     

Efficient disparity vector prediction schemes with modified P frame for 2D camera arrays

An efficient disparity estimation algorithm for multi-view video sequences, recorded by a two-dimensional camera array in which the cameras are spaced equidistantly, is presented. Because of the strong geometrical relationship among views, the disparity vectors of a certain view can for most blocks be derived from the disparity vectors of other views. A frame constructed using that idea is called a D frame in this work. Three new prediction schemes which contain D frames are proposed for encoding 5 × 3 multi-view video sequences. The schemes are applied to several multi-view image sequences taken from a camera-array and they are compared in terms of quality, bit-rate and complexity. The experimental results show that the proposed prediction schemes significantly decrease the complexity of the encoder at a very low cost of quality and/or bit-rate.     

The E3 architecture: enabling future cellular networks with cognitive and self‐x capabilities

Future mobile networks are expected to be complex heterogeneous systems. On the one hand this will enable users to take advantage of a number of different access technologies. On the other hand it will seriously affect network management procedures since more extensive operations and decisions will have to be dealt with. To tackle these challenges a number of new dynamic mechanisms need to be designed. It is imperative that certain network management tasks have to be performed without human intervention to reduce the OPEX costs and achieve faster responses in different events. To achieve this goal, the introduction of self‐x functionalities, combined with cognitive mechanisms and the ability to reconfigure network entities and terminals, is required. Moreover, the introduction of a new pilot channel needs to be considered to assist the terminals in selecting the most suitable radio access technology according to their requirements. We present the functional architecture of an evolved network that was designed in the context of the EU‐funded IP project ‘E³: End‐to‐End Efficiency’. This architecture aims to enhance existing procedures usually performed in traditional operation and maintenance systems (e.g. spectrum management, network planning, configuration actions). We explain the rationale of our design and provide specific examples to illustrate the role of the different functional entities and their interfaces. A considerable part of this architecture has recently been approved as a feasibility study by the ETSI Committee Reconfigurable Radio System. Copyright © 2010 John Wiley & Sons, Ltd.     

Kirigami/Origami‐Based Soft Deployable Reflector for Optical Beam Steering

The beam steering mechanism has been a key element for various applications ranging from sensing and imaging to solar tracking systems. However, conventional beam steering systems are bulky and complex and present significant challenges for scaling up. This work introduces the use of soft deployable reflectors combining a soft deployable structure with simple kirigami/origami reflective films. This structure can be used as a macroscale beam steering mechanism that is both simple and compact. This work first develops a soft deployable structure that is easily scalable by patterning of soft linear actuators. This soft deployable structure is capable of increasing its height several folds by expanding in a continuous and controllable manner, which can be used as a frame to deform the linearly stretchable kirigami/origami structures integrated into the structure. Experiments on the reflective capability of the reflectors are conducted and show a good fit to the modeling results. The proposed principles for deployment and for beam steering can be used to realize novel active beam steering devices, highlighting the use of soft robotic principles to produce scalable morphing structures.     

Proposal of visual strength grading rules for Uruguayan pine timber

A previous database with bending and density data of 261 structural size specimens of currently produced Uruguayan slash pine and loblolly pine timber was adjusted to meet testing and characterization requirements of European standards. Visual parameters and mechanical properties for each specimen were evaluated and their relationship was statistically analyzed. Results suggested that all specimens can be grouped in one visual grade with engineered properties similar to those of European C14 strength class. Modulus of elasticity and characteristic bending strength were the defining properties for class assignation.     

Non-conventional high-pressure extraction process: A comparative study for astaxanthin recovery from Xanthophyllomyces dendrorhous

Xanthophyllomyces dendrorhous is one of the most attractive natural sources of astaxanthin. The yeast produces the compound intracellularly, therefore, it is necessary to evaluate cell rupture methods using clean and efficient technologies for its extraction and it subsequent use in industries. At present work, two non-conventional high-pressure extraction methods were evaluated for astaxanthin recovery: Supercritical fluid extraction and microfluidisation. Results: Effect of pressure (15, 30, and 45 Megapascals; MPa), Temperature (313 and 343 °K) and usage of co-solvent were studied in supercritical extraction process, meanwhile the effect of microfluidisation process (five stages and 160 MPa) for cell rupture and its combination with conventional technics (lithic enzymes, glass beads and ultrasonication) for the recovery of astaxanthin were evaluated. Supercritical fluid extraction presented a higher astaxanthin recovery, 54% yield extraction, at 32.5 MPa and 313 °K, and using ethanol as co-solvent, compared to a 31% yield extraction by mean microfluidisation process at 160 MPa combined with 15 min of sonication (amplitude of 80%).