In a functional encryption (FE) scheme, the owner of the secret key can generate restricted decryption keys that allow users to learn specific functions of the encrypted messages and nothing else. In many known constructions of FE schemes, such a notion of security is guaranteed only for messages that are fixed ahead of time (i.e., before the adversary even interacts with the system). This is c...

DOI 10.1007/s10040-002-0225-5 Abstract Suzhou City, located at the lower reaches of the Yangtze River in southeastern Jiangsu Province, is one of the few cities in China which suffer from severe ground settlement. A research project was carried out to investigate this problem. Geological and hydrogeological studies show that there is a multi-layered aquifer system with three distinct, soft mud ...

Functional encryption is an emerging paradigm for publickey encryption that enables fine-grained control of access to encrypted data. In this work, we present new lower bounds and impossibility results on functional encryption, as well as new perspectives on security definitions. Our main contributions are as follows: – We show that functional encryption schemes that satisfy even a weak (non-ad...

The wide variety of small, computationally weak devices, and the growing number of computationally intensive tasks makes it appealing to delegate computation to data centers. However, outsourcing computation is useful only when the returned result can be trusted, which makes verifiable computation (VC) a must for such scenarios. In this work we extend the definition of verifiable computation in...

In a functional encryption (FE) scheme, the owner of the secret key can generate restricted decryption keys that allow users to learn specific functions of the encrypted messages and nothing else. In many known constructions of FE schemes, security is guaranteed only for messages that are fixed ahead of time (i.e., before the adversary even interacts with the system). This so-called selective s...

This paper defines a n e w approach and investigates a fundamen ta l problem in route planners. This capability is impor tan t f o r robotic vehicles( M a r t i a n Rovers , etc.) and f o r planning off-road mi l i tary maneuvers. T h e emphas is throughout this paper will be on the design and analysis and hierarchical implementa t ion of our route p lanner . This work was motivated by anticipa...

We construct protocols for secure multiparty computation with the help of a computationally powerful party, namely the “cloud”. Our protocols are simultaneously efficient in a number of metrics: • Rounds: our protocols run in 4 rounds in the semi-honest setting, and 5 rounds in the malicious setting. • Communication: the number of bits exchanged in an execution of the protocol is independent of...

Center for Adaptive Systems and Department of Cognitive and Neural Systems Boston University, 111 Cummington Street, Boston, MA 02215 A four-channel neural pattern generator is described in which both the frequency and the relative phase of oscillations are controlled by a scalar arousal or GO signal. The generator is used to simulate quadruped gaits; in particular, rapid transitions are simula...

Kagan, V., A. Nerode and V.S. Subrahmanian, Computing definite logic programs by partial instantiation, Annals of Pure and Applied Logic 67 (1994) 161-182. Query processing in ground definite deductive databases is known to correspond precisely to a linear programming problem. However, the “groundedness” requirement is a huge drawback to using linear programming techniques for logic program com...