The contribution of this paper is twofold. First we present a new simple electronic voting scheme having standard re-encryption mix net back-end, which allows to cast a ballot and verify its correctness in a new way. Then we extend the proposed scheme to represent a new very efficient mix network construction. We called our mix network to be self-proving mix, because it is shown how mix process...

The current online voting system used in Estonia has not employed mathematically secure verifiable proofs of correctness for ensuring the honesty of the tabulation server [Com13a]. The auditing is based on observation of the procedures and if the procedures are done according to the protocol. Even though the protocol was not followed, as the cast votes were transferred from ballot storing serve...

Mix-automatic sequences form a proper extension of the class of automatic sequences, and arise from a generalization of finite state automata where the input alphabet is state-dependent. In this paper we compare the class of mix-automatic sequences with the class of morphic sequences. For every polynomial φ we construct a mix-automatic sequence whose subword complexity exceeds φ. This stands in...

We embed venture capital contracting in a search market environment where venture capitalists and entrepreneurs meet and bargain over optimal contracts. We find that both the composition and type of financial claims held by the venture capitalist and entrepreneur depend critically on the underlying market structure. In some cases both parties hold a mix of debt and equity while in others only o...

We study the random composition of a small family of O(n3) simple permutations on {0, 1}n. Specifically we ask what is the number of compositions needed to achieve a permutation that is close to k-wise independent. We improve on a result of Gowers [1] and show that up to a polylogarithmic factor, n3k3 compositions of random permutations from this family suffice. We further show that the result ...