We propose a concrete procedure of a Σ-protocol proving knowledge that a set of witnesses satisfies a monotone predicate in the witness-indistinguishable manner. Inspired by the high-level work proposed by Cramer, Damg̊ard and Schoenmakers at CRYPTO ’94, we provide a concrete procedure by extending the so-called OR-proof.

John Knight, Ross P. Holmes, Scott D. Cramer, Tatsuya Takayama, and Eduardo Salido Departments of Urology and Cancer Biology, Wake Forest University Health Sciences, Winston-Salem, North Carolina; Department of Pharmacology, University of Colorado, Denver, Anschutz Medical Campus, Aurora, Colorado; and Center for Biomedical Research on Rare Diseases, Hospital Universitario Canarias, Instituto T...

The problem of the parameter estimation of chirp signals is addressed. Several closely related estimators are proposed whose main characteristics are simplicity, accuracy, and ease of on-line or off-line implementation. For moderately high signal-to-noise ratios they are unbiased and attain the Cramer-Rao bound. Monte Carlo simulations verify the expected performance of the estimators.

This paper is the second of a two-part paper aimed at studying fundamental limits in estimation in 1D scattering systems via the Cramer-Rao bound. In this paper we provide and discuss computer simulation results illustrating the theory in the first paper.