3. Introduction -1

14. The Proposed System 2-

20. accomplished by HTO w >> n accomplished by HTO one – to – one correspondence voted n> =z Set E Set P Set S Set C c 0 e 0 p 0 s 0 c 1 e 1 p 1 s 1 c 2 | | | | | | | | e z-1 p n-1 s n-1 | | c w-1

21. pt (EC) e 0 e z-1 e z-2 e i e 1 e 2

22. Combined message ms i MS i = encrypted ms i using the public key of pt Unsecure channel Vote message m i of e i Code s i assigned to e i (originally as p i ) Encryption of ms i using the public key of pt Decryption of MS i using the private key of pt Vote message m i Code s i assigned to e i

23. Comparing s i with the already voted codes (people) mismatch repeated Not repeated checking the crosscorrelation properties between s i and st (the code of pt) Vote rejection

24. m o m 1 m i m z-1 Fig. 3 Steps used to accomplish voting in the proposed system Accepting the vote message m i of e i Taking decision according to the specified threshold Yes or No (decision)

25. 3- Feasibility Aspects of The Proposed System

33. Conclusions -4