Concurrent Composition of Secure Protocols in the Timing Model

In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their inputs. In the stand-alone case it has been shown that every efficient function can be securely computed. However, in the setting of concurrent composition, broad impossibility results have been proven for the case of no honest majority and no trusted setup phase. These results hold both for the case of general composition (where a secure protocol is run many times concurrently with arbitrary other protocols) and self-composition (where a single secure protocol is run many times concurrently). In this paper we investigate the feasibility of obtaining security in the concurrent setting, assuming that each party has a local clock and that these clocks proceed at approximately the same rate. We show that under this mild timing assumption, it is possible to securely compute any multiparty functionality under concurrent self-composition. Loosely speaking, we also show that it is possible to securely compute any multiparty functionality under concurrent general composition, as long as the secure protocol is run only with protocols whose messages are delayed by a specified amount of time. On the negative side, we show that it is impossible to achieve security under concurrent general composition with no restrictions whatsoever on the network (like the aforementioned delays), even in the timing model.     

Multifrequency zero-jitter delay-locked loop

The approach of an all-digital phase locked loop is used in this delay-locked loop circuit. This design is designated to a system with two processing units, a master CPU and a slave system chip, that share the same bus. It allows maximum utilization of the bus, as the minimal skew between the clocks of the two components significantly reduces idle periods, and also set-up and hold times. Changes in the operating frequency are possible, without falling out of synchronization. Due to the special lead-lag phase detector, the jitter of the clock is zero, when the loop is locked, under any working conditions     

Self-stabilization over unreliable communication media

Summary A self-stabilizing system has the property that it will converge to a desirable state when started from any state. Most previous researchers assumed that processes in self-stabilizing systems may communicate through shared variables while those that studied meassage passing systems allowed messages with unbounded size. This paper discusses the development of self-stabilizing systems which communicate through message passing, and in which messages may be lost in transit. The systems presented all use fixed size message headers. First, a selfstabilizing version of theAlternating Bit Protocol, a fundamental communication protocol for transmitting data across an unreliable communication medium, is presented. Secondly, the alternating-bit protocol is used to construct a self-stabilizing token ring. Yehuda Afek received a B.Sc. in Electrical Engineering from the Technion and an M.S. and Ph.D. in Computer Science from the University of California, Los Angeles. In 1985 he joined the Distributed Systems research Department in AT&T Bell Laboratories and in 1988 he joined the Department of Computer Science in Tel-Aviv University. His interests include communication protocols, distributed systems, and asynchronous shared memories. Geoffrey M. Brown received the BS degree in Engineering from Swarthmore College in 1982, the MS degree in Electrical Engineering from Stanford University in 1983, and the Ph.D. degree in Electrical Engineering from the University of Texas at Austin in 1987. From 1983 to 1984 he worked for Motorola in Austin, TX. Currently he is an Assistant Professor in the School of Electrical Engineering at Cornell University. In 1990, Brown was named a Presidential Young Investigator by the National Science Foundation.This work supported in part by NSF grant CCR-9058180     

Long lived adaptive splitter and applications

Summary. Long-lived and adaptive implementations of mutual exclusion and renaming in the read/write shared memory model are presented. An implementation of a task is adaptive if the step complexity of any operation in the implementation is a function of the number of processes that take steps concurrently with the operation. The renaming algorithm assigns a new unique id in the range to any process whose initial unique name is taken from a set of size N, for an arbitrary N and where k is the number of processes that actually take steps or hold a name while the new name is being acquired. The step complexity of acquiring a new name is , while the step complexity of releasing a name is 1. The space complexity of the algorithm is where n is an upper bound on the number of processes that may be active at the same time (acquiring or holding new names), which could be N in the worst case. Both the system response time and the worst case number of operations per process in the presented mutual-exclusion algorithm are adaptive. Both algorithms rely on the basic building block of a long-lived and adaptive splitter. While the adaptive-splitter satisfies a slightly different set of properties than the Moir-Anderson splitter [MA95], it is adaptive and long-lived. In addition, the new splitter properties enable the construction of a non-blocking long-lived (2k-1)-renaming algorithm (which is optimal in the size of the new name space). We believe that the mechanisms introduced in our splitter implementation are interesting on their own, and might be used in other adaptive and long-lived constructions. Received: March 2000 / Accepted July 2001     

Targeted Nanoparticles Harboring Jasmine-Oil-Entrapped Paclitaxel for Elimination of Lung Cancer Cells

Selectively targeted drug delivery systems are preferable chemotherapeutic platforms, as they specifically deliver the drug cargo into tumor cells, while minimizing untoward toxic effects. However, these delivery systems suffer from insufficient encapsulation efficiency (EE), encapsulation capacity (EC), and premature drug release. Herein, we coencapsulated paclitaxel (PTX) and Jasmine oil (JO) within PEG-PCL nanoparticles (NPs), with an average diameter < 50 nm, selectively targeted to non-small cell lung cancer (NSCLC) cells, via S15-aptamer (APT) decoration. JO was selected as an “adhesive” oily core to enhance PTX entrapment, as JO and PTX share similar hydrophobicity and terpenoid structure. JO markedly enhanced EE of PTX from 23% to 87.8% and EC from 35 ± 6 to 74 ± 8 µg PTX/mg PEG-PCL. JO also markedly increased the residual amount of PTX after 69 h, from 18.3% to 65%. Moreover, PTX cytotoxicity against human NSCLC A549 cells was significantly enhanced due to the co-encapsulation with JO; the IC₅₀ value for PTX encapsulated within JO-containing APT-NPs was 20-fold lower than that for APT-NPs lacking JO. Remarkably, JO-containing APT-NPs displayed a 6-fold more potent cell-killing, relatively to the free-drug. Collectively, these findings reveal a marked synergistic contribution of JO to the cytotoxic activity of APT-NP-based systems, for targeted PTX delivery against NSCLC, which may be readily applied to various hydrophobic chemotherapeutics.     

Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation

In the setting of secure multiparty computation, a set of parties wish to compute a joint function of their private inputs. The computation should preserve security properties such as privacy, correctness, independence of inputs, fairness and guaranteed output delivery. In the case of no honest majority, fairness and guaranteed output delivery cannot always be obtained. Thus, protocols for secure multiparty computation are typically of two disparate types: protocols that assume an honest majority (and achieve all properties including fairness and guaranteed output delivery) and protocols that do not assume an honest majority (and achieve all properties except for fairness and guaranteed output delivery). In addition, in the two-party case, fairness and guaranteed output delivery are equivalent. As a result, the properties of fairness (which means that if corrupted parties receive output then so do the honest parties) and guaranteed output delivery (which means that corrupted parties cannot prevent the honest parties from receiving output in any case) have typically been considered to be the same. In this paper, we initiate a study of the relation between fairness and guaranteed output delivery in secure multiparty computation. We show that in the multiparty setting these properties are distinct and proceed to study under what conditions fairness implies guaranteed output delivery (the opposite direction always holds). We also show the existence of non-trivial functions for which complete fairness is achievable (without an honest majority) but guaranteed output delivery is not, and the existence of non-trivial functions for which complete fairness and guaranteed output delivery are achievable. Our study sheds light on the role of broadcast in fairness and guaranteed output delivery and shows that these properties should sometimes be considered separately.     

Flow pattern transition for vertical downward two phase flow

Experiments of flow pattern for vertical downward gas—liquid flow are reported. In addition theoretically based transition criteria for the flow pattern are presented. The experimental results compare resonably well with the theoretical model for the prediction of flow pattern in vertical downward flow.     

On the complexity of global computation in the presence of link failures: the general case

Summary This paper presents (m logn) and (mn) messages lower bounds on the problem of computing a gobal sensitive function in biderectional networks with link failures (i.e., dynamically changing topology), wheren andm are the total number of nodes and links in the network. The (m logn) lower bound is under the assumption thatn is a-priori known to the nodes, while the second bound is for the case in which such knowledge is not available. A global sensitive function ofn variables is a function that may not be computed without the knowledge of the values of all then variables (e.g. maximum, sum, etc). Thus, computing such a function at one node of a distributed network requires this node to communicate with every other node in the network. Though lower bounds higher than (m) messages are known for this problem in the context of link failures, none holds for dense bidirectional networks. Moreover, we are not aware of any other nontrivial lower bound higher than (m) for dense bidirectional networks. Yehuda Afek received a B.Sc. in Electrical Engineering from the Technion and an M.Sc. and Ph.D. in Computer Science from the University of California, Los-Angeles. In 1985 he joined the Distributed Systems Research Department in AT&T Bell Laboratories as a Member of Technical Staff. In 1988 he joined the Computer Science Department in Tel-Aviv University, where he now holds a permanent position. From 1989 to 1994 he was also a consultant for AT&T Bell Laboratories. His interests include communication protocols, distributed computing and asynchronous shared memory systems. Danny Hendler was born in Kiryat-Haim near Haifa, Israel, on April 17th 1961. He received his B.Sc. and M.Sc. in Computer Science from Tel-Aviv University, Israel, in 1986 and 1993, respectively. In the past 8 years he has worked as a free lance software-consultant, specializing mainly in communication, telephony and voice-mail applications.     

A control procedure for the elimination of mal flow rate distribution in evaporating flow in parallel pipes

Solar power plants that are based on an array of parallel parabolic trough solar collectors currently use oil as the heated fluid. Direct steam generation (DSG) has the potential of being a more efficient and less costly process owing to the elimination of oil as an indirect secondary heating medium and the elimination of heat exchanges and extra equipment needed for the transfer of heat from oil to water/steam.Unfortunately the use of DSG may possess problems regarding undesired flow distribution among the parallel pipes as well as possible flow instabilities. In this work we propose a control procedure that can adjust the flow rate in each of the parallel pipes to a desired quality at the pipes exit.