No abstract uploaded!

We prove Pólya’s conjecture of 1943: For a real entire function of order greater than 2 with finitely many non-real zeros, the number of non-real zeros of the$n$th derivative tends to infinity, as $$n\to\infty$$ . We use the saddle point method and potential theory, combined with the theory of analytic functions with positive imaginary part in the upper half-plane.

No abstract uploaded!

No abstract uploaded!

In this article, the authors cryptanalyze a k-out-of-n oblivious transfer protocol proposed in [12]. Their protocol is one of the most efficient k-out-of-n oblivious transfer protocols and is directly built from a 1-out-of-n oblivious transfer protocol. However, their analysis shows that the proposed k-out-of-n oblivious transfer protocol is insecure, though the primitive 1-out-of-n oblivious transfer protocol is secure. The weakness is that with high probability the receiver in their protocol can get all n secret messages encrypted by the sender. Finally, they fix the serious flaw and introduce an improved k-out-of-n oblivious transfer protocol without increasing any cost.