• (z)r and (z)i denote the real and imaginary part of z. II. CONSTRAINED CRAMER-RAO BOUND A. Problem Statement Problem statement and notation are based on [1]. • a: a K × 1 non-random vector which are to be estimated. • r: an observation of a random vector . • â (R): an estimate of a basing on the observed vector r . It is required that â (R) satisfies M nonlinear equality constraints (M < K), ...

6 Cramer-Shoup cryptosystem 11 6.

In this paper we examine the notion of plaintext awareness as it applies to hybrid encryption schemes. We apply this theory to the Cramer-Shoup hybrid scheme acting on fixed length messages and deduce that the Cramer-Shoup scheme is plaintext-aware in the standard model. This answers a previously open conjecture of Bellare and Palacio on the existence of fully plaintext-aware encryption schemes.

In this paper we examine the security criteria for a KEM and a DEM that are sufficient for the overall hybrid encryption scheme to be plaintext-aware in the standard model. We apply this theory to the Cramer-Shoup hybrid scheme acting on fixed length messages and deduce that the Cramer-Shoup scheme is plaintext-aware in the standard model. This answers a previously open conjecture of Bellare an...

The nonlinear estimation problem in navigation us ing terrain height variations is studied The optimal Bayesian solution to the problem is derived The im plementation is grid based calculating the probabil ity of a set of points on an adaptively dense mesh The Cramer Rao bound is derived Monte Carlo sim ulations over a commercial map shows that the al gorithm after convergence reaches the Crame...