A Formal Framework for Concrete Reputation Systems

In a reputation-based trust-management system, agents maintain information about the past behaviour of other agents. This information is used to guide future trust-based decisions about interaction. However, while trust management is a component in security decision-making, many existing reputation-based trust-management systems provide no formal security-guarantees. In this extended abstract, we describe a mathematical framework for a class of simple reputation-based systems. In these systems, decisions about interaction are taken based on policies that are exact requirements on agents’ past histories. We present a basic declarative language, based on pure-past linear temporal logic, intended for writing simple policies. While the basic language is reasonably expressive (encoding e.g. Chinese Wall policies) we show how one can extend it with quantification and parameterized events. This allows us to encode other policies known from the literature, e.g., ‘one-out-of-k’. The problem of checking a history with respect to a policy is efficient for the basic language, and tractable for the quantified language when policies do not have too many variables

A Logical Framework for Reputation Systems

Reputation systems are meta systems that record, aggregate and distribute information about the past behaviour of principals in an application. Typically, these applications are large-scale open distributed systems where principals are virtually anonymous, and (a priori) have no knowledge about the trustworthiness of each other. Reputation systems serve two primary purposes: helping principals decide whom to trust, and providing an incentive for principals to well-behave. A logical policy-based framework for reputation systems is presented. In the framework, principals specify policies which state precise requirements on the past behaviour of other principals that must be fulfilled in order for interaction to take place. The framework consists of a formal model of behaviour, based on event structures; a declarative logical language for specifying properties of past behaviour; and efficient dynamic algorithms for checking whether a particular behaviour satisfies a property from the language. It is shown how the framework can be extended in several ways, most notably to encompass parameterized events and quantification over parameters. In an extended application, it is illustrated how the framework can be applied for dynamic history-based access control for safe execution of unknown and untrusted programs

Comparative analysis of 18S rRNA genes from Myxobolus aeglefini Auerbach, 1906 isolated from cod (Gadus morhua), Plaice (Pleuronectes platessa) and dab (Limanda limanda), using PCR-RFLP

The myxosporean parasite Myxobolus aeglefini is a marine species, which can be found in the cartilage of mainly gadid fish species. The parasite has, however, been recorded in the flatfish plaice (Pleuronectes platessa) and dab (Limanda limanda). It is not clear if isolates from unrelated hosts represent the same species. Therefore a molecular study was conducted to reveal differences at the DNA level between these isolates. PCR was successfully conducted on three different isolates of Myxobolus aeglefini sampled from cod (Gadus morhua), plaice and dab respectively, using 18S rDNA as template. A PCR product of approx. 1600 base pairs was obtained and RFLP (Restriction Fragment Length Polymerase) was conducted on the fragment with the restriction enzymes Hinf I, Msp I and Hae III. No differences between the isolates were found, suggesting that the three isolates represent the same species

The role of entanglement in dynamical evolution

Entanglement or entanglement generating interactions permit to achieve the maximum allowed speed in the dynamical evolution of a composite system, when the energy resources are distributed among subsystems. The cases of pre-existing entanglement and of entanglement-building interactions are separately addressed. The role of classical correlations is also discussed.Comment: 5 pages, 1 figure. Revised versio

Three-body Thomas-Ehrman shifts of analog states of 17^{17}Ne and 17^{17}N

The lowest-lying states of the Borromean nucleus $^{17}$Ne ($^{15}$O+$p$ + $p$) and its mirror nucleus $^{17}$N ($^{15}$N+$n$ + $n$) are compared by using the hyperspheric adiabatic expansion. Three-body resonances are computed by use of the complex scaling method. The measured size of $^{15}$O and the low-lying resonances of $^{16}$F ($^{15}$O+$p$) are first used as constraints to determine both central and spin-dependent two-body interactions. The interaction obtained reproduces relatively accurately both experimental three-body spectra. The Thomas-Ehrman shifts, involving excitation energy differences, are computed and found to be less than 3% of the total Coulomb energy shift for all states.Comment: 9 pages, 3 postscript figures, revtex style. To be published in Phys. Rev.

Derivative pricing under the possibility of long memory in the supOU stochastic volatility model

We consider the supOU stochastic volatility model which is able to exhibit long-range dependence. For this model we give conditions for the discounted stock price to be a martingale, calculate the characteristic function, give a strip where it is analytic and discuss the use of Fourier pricing techniques. Finally, we present a concrete specification with polynomially decaying autocorrelations and calibrate it to observed market prices of plain vanilla options

Efimov states in asymmetric systems

The conditions for occurrence of the Efimov effect is briefly described using hyperspherical coordinates. The strength of the effective hyperradial $\rho^{-2}$ potential appearing for two or three large scattering lengths is computed and discussed as function of two independent mass ratios of the three constituent particles. The effect is by far most pronounced for asymmetric systems with three very different masses. One Efimov state may by chance appear in nuclei. Many states could be present for systems with one electron and two neutral atoms or molecules. Estimates of the number of states and their sizes and energies are given.Comment: 7 pages, 3 figure

Efficient C-Phase gate for single-spin qubits in quantum dots

Two-qubit interactions are at the heart of quantum information processing. For single-spin qubits in semiconductor quantum dots, the exchange gate has always been considered the natural two-qubit gate. The recent integration of magnetic field or g-factor gradients in coupled quantum dot systems allows for a one-step, robust realization of the controlled phase (C-Phase) gate instead. We analyze the C-Phase gate durations and fidelities that can be obtained under realistic conditions, including the effects of charge and nuclear field fluctuations, and find gate error probabilities of below 10-4, possibly allowing fault-tolerant quantum computation.Comment: 5 pages, 3 figure

A Bayesian model for event-based trust

The application scenarios envisioned for ‘global ubiquitous computing’ have unique requirements that are often incompatible with traditional security paradigms. One alternative currently being investigated is to support security decision-making by explicit representation of principals’ trusting relationships, i.e., via systems for computational trust. We focus here on systems where trust in a computational entity is interpreted as the expectation of certain future behaviour based on behavioural patterns of the past, and concern ourselves with the foundations of such probabilistic systems. In particular, we aim at establishing formal probabilistic models for computational trust and their fundamental properties. In the paper we define a mathematical measure for quantitatively comparing the effectiveness of probabilistic computational trust systems in various environments. Using it, we compare some of the systems from the computational trust literature; the comparison is derived formally, rather than obtained via experimental simulation as traditionally done. With this foundation in place, we formalise a general notion of information about past behaviour, based on event structures. This yields a flexible trust model where the probability of complex protocol outcomes can be assessed