![]() Ryan, Peter ![]() in Lecture Notes in Computer Science (2013) This paper shows how Prêt à Voter can be adjusted in order to provide everlasting privacy. This is achieved by adapting the ballot generation and anonymisation process, such that only unconditional hiding ... [more ▼] This paper shows how Prêt à Voter can be adjusted in order to provide everlasting privacy. This is achieved by adapting the ballot generation and anonymisation process, such that only unconditional hiding commitments and zero knowledge proofs are published for verification, thus ensuring privacy towards the public. This paper presents a security analysis carried out in a collaboration between computer scientists and legal researchers. On the technical side it is shown that the modified Prêt à Voter provides verifiability, robustness, and everlasting privacy towards the public. Everlasting privacy towards the authorities can be achieved by implementing several organisational measures. A legal evaluation of these measures demonstrates that the level of privacy achieved would be acceptable under German law. [less ▲] Detailed reference viewed: 222 (4 UL)![]() ![]() ; Müller, Volker ![]() in Computing the number of points of elliptic curves over finite fields (1991) In this paper we report on our implementation of a combination of the Babystep-Giantstep Algorithm and the Algorithm of Schoof for computing group orders of elliptic curves over finite fields. This paper ... [more ▼] In this paper we report on our implementation of a combination of the Babystep-Giantstep Algorithm and the Algorithm of Schoof for computing group orders of elliptic curves over finite fields. This paper is a summary of the results in my Master Thesis. [less ▲] Detailed reference viewed: 135 (4 UL) |
||