Environments for Distributed Systems Engineering, Lecture Notes in Computer Science 2236, Springer, 279 p., NISBN 3-540-43083-0, 2001.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the encrypted computation must leak to the host and only the originator may receive any output. This rules out any active mobile code that performs some immediate action on the host (like a mobile agent in a shopping scenario that accepts or rejects an o#er of its host based on a secret strategy [Yee99]) The impossibility of protecting active mobile code is demonstrated in Section 2 below; the basic problem is that a malicious host can observe the output of the computation and simply run the code again with a di#erent input. The only existing defense for active mobile code against a malicious ....

....demonstrated in Section 2 below; the basic problem is that a malicious host can observe the output of the computation and simply run the code again with a di#erent input. The only existing defense for active mobile code against a malicious host uses trusted hardware. This has been proposed by Yee [Yee99] and by Wilhelm et al. WSB99] and entails running mobile code exclusively inside tamper proof hardware, encrypting it as soon as it leaves the trusted environment. The implicit assumption one must make here is that all users trust the manufacturer of the hardware. Such an assumption seems very ....

[Article contains additional citation context not shown here]

B. Yee, A sanctuary for mobile agents, Secure Internet Programming (J. Vitek and C. D. Jensen, eds.), Lecture Notes in Computer Science, vol. 1603, Springer, 1999, pp. 261--273. 15

....available to default value expressions of later ones, make parse and make eval exp can be fed the actual language to yield parse and eval exp. Language also speci es the requirement of return, extend and run procedures for any language. return and extend are assumed to satisfy the monadic laws [13]. Computations are represented as monadic values. The return procedure creates a monadic value representing a trivial computation from a term. The extend procedure composes a procedure expecting a value and returning a monadic value with an initial monadic value, yielding a composite monadic ....

P. Wadler. Monads for functional programming. Lecture Notes in Computer Science, 925:24{??, 1995.

....capture the current static mapping, and the morphism inEnv takes a captured mapping and a computation, and is used to create a new computation that will run under the captured mapping. The structure of Values and the monad M are conventional. We assume the reader has some familiarity with monads[28,27,29] and interpreters[16,3,24] 2.2 Monadic Control Structures A nice property of monadic computation in Haskell is that it is easy to capture patterns of control and abstract them into functions at the monadic level. A familiar pattern that occurs many times in our semantics is a monadic ....

Wadler, P., Monads for functional programming, Lecture Notes in Computer Science 925 (1995), pp. 24-52. 25

....the encrypted computation must leak to the host and only the originator may receive any output. This rules out any active mobile code that performs some immediate action on the host (like a mobile agent in a shopping scenario that accepts or rejects an o er of its host based on a secret strategy [Yee99]) The impossibility of protecting active mobile code is demonstrated in Section 2 below; the basic problem is that a malicious host can observe the output of the computation and simply run the code again with a di erent input. The only existing defense for active mobile code against a malicious ....

....demonstrated in Section 2 below; the basic problem is that a malicious host can observe the output of the computation and simply run the code again with a di erent input. The only existing defense for active mobile code against a malicious host uses trusted hardware. This has been proposed by Yee [Yee99] and by Wilhelm et al. WSB99] and entails running mobile code exclusively inside tamper proof hardware, encrypting it as soon as it leaves the trusted environment. The implicit assumption one must make here is that all users trust the manufacturer of the hardware. Such an assumption seems very ....

[Article contains additional citation context not shown here]

B. Yee, A sanctuary for mobile agents, Secure Internet Programming (J. Vitek and C. D. Jensen, eds.), Lecture Notes in Computer Science, vol. 1603, Springer, 1999, pp. 261-273. 15

....for completeness. The best known lower bound technique was found by Fredman and Saks [18] and commonly referred to as the time stamp method. The compress and comminicate technique was made explicit independently by Miltersen [33] and Xiao [45] Surveys of lower bound techniques can be found in [17] and [30] Structural issues are addressed by Miltersen, Subramanian, Tamassia, and Vitter [29] who define a reduction that enables us to use the well known notion of P completeness as a hardness argument. The paper also defines the notion of a dynamic membership problem: given language L and ....

, Lower bounds for dynamic algorithms, Proc. 4th SWAT (Erik M. Schmidt and Sven Skyum, eds.), Lecture Notes in Computer Science, vol. 824, Springer Verlag, Berlin, 1994, pp. 167--171.

....sets and multiple parent recombination. 2.3.2. Scatter Search Techniques Scatter Search (SS) is a technique originally presented by Glover in [23] but which has only recently been applied to CO problems. Two essential papers present it: a more normative one in [25] and a more general one in [26]. By making reference to [25] SS is a technique which combines polyhedral cutting planes approaches with primal solutions recombination and update. The general framework for an integer problem, IP, whose linear relaxation is LP, is the following. 1. Initialize the Reference Set R with feasible IP ....

, A template for scattersearch and path relinking, Lecture Notes in Computer Science, J.K. Hao, E. Lutton, E. Ronald, M. Schoenauer, D.Snyers (Eds.) (1997).

No context found.

Environments for Distributed Systems Engineering, Lecture Notes in Computer Science 2236, Springer, 279 p., NISBN 3-540-43083-0, 2001.

No context found.

, "A proposed scheme for performance evaluation of graphics/text separation algorithms," in Graphics Recognition---Algorithms and Systems, K. Tombre and A. Chhabra, Eds. Berlin, Germany: Springer, 1998, vol. 1389, Lecture Notes in Computer Science, pp. 359--371.

No context found.

Yee, B. A sanctuary for mobile agents. Secure Internet Programming, Lecture notes in computer science 1603 (1999), 261--73.

No context found.

Algorithms for the Construction and Analysis of Systems #TACAS '99#, R. Cleaveland, ed., vol. 1579 of Lecture Notes in Computer Science, Amsterdam, The Netherlands, March 1999, Springer-Verlag, pp. 270#284.

No context found.

Techniques and Tools for Computer Performance Evaluation #Tools '97#, R. Marie, B. Plateau, M. Calzarossa, and G. Rubino, eds., vol. 1245 of Lecture Notes in Computer Science, St. Malo, France, June 1997, Springer-Verlag, pp. 44#57.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC