The cryptosystem recently proposed by Cramer and Shoup [CS98] is a practical public key cryptosystem that is secure against adaptive chosen ciphertext attack provided the Decisional Diffie-Hellman assumption is true. Although this is a reasonable intractability assumption, it would be preferable to base a security proof on a weaker assumption, such as the Computational Diffie-Hellman assumption...

This paper addresses the problem of Doppler frequency estimation in the presence of speckle and receiver noise. An ultimate accuracy bound for Doppler frequency estimation is derived from the Cramer-Rao inequality. It is shown that estimates based on the correlation of the signal power spectra with an arbitrary weighting function are approximately Gaussian distributed. Their variance is derived...

The Cramer-Rao error bound provides a fundamental limit on the expected performance of a statistical estimator. The error bound depends on the general properties of the system, but not on the specific properties of the estimator or the solution. The Cramer-Rao error bound has been applied to scalarand vector-valued estimators and recently to parametric shape estimators. However, nonparametric, ...

At Eurocrypt ’02 Cramer and Shoup [7] proposed a general paradigm to construct practical public-key cryptosystems secure against the adaptive chosen ciphertext attack as well as several concrete examples. Using the construction, we present a new variant of the Cramer-Shoup encryption scheme, which is secure against the adaptive chosen ciphertext attack. Our variant is based on the problem relat...

At Crypto’98, Cramer and Shoup [1] proposed a public key cryptosystem that is provably secure against the adaptive chosen ciphertext attacks. Recently, Zhu, Chan, and Deng [2] proposed a variation of Cramer and Shoup’s scheme (the Zhu-Chan-Deng scheme in short) which attempts to reduce Cramer and Shoup’s public key cryptosystem in terms of both the size of the ciphertext and the computation req...

by John G. Cramer Alternate View Column AV-150

We revisit the problem of computing submatrices of the Cramér-Rao bound (CRB), which lower bounds the variance of any unbiased estimator of a vector parameter θ. We explore iterative methods that avoid direct inversion of the Fisher information matrix, which can be computationally expensive when the dimension of θ is large. The computation of the bound is related to the quadratic matrix program...

The identity of Phalaena Attacus cassandra Cramer, [1779] is established, based on a female reared from caterpillar that matched the description and illustration by STOLL (1790), raising following questions: Are armida really same species, or two different as supposed CRAMER (1771 [1779]), when described adults, Stoll, he caterpillars? If they are same, caterpillars polymorphic? Illustrations l...