Open AccessMixnets: Implementation and Performance Evaluation of Decryption and Re-encryption Types
Author(s) -
Pance Ribarski,
Ljupcho Antovski
Publication year - 2012
Publication title -
cit. journal of computing and information technology/journal of computing and information technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.169
H-Index - 27
eISSN - 1846-3908
pISSN - 1330-1136
DOI - 10.2498/cit.1002101
Subject(s) - computer science , encryption , implementation , key (lock) , theoretical computer science , anonymity , java , computer security , programming language
The anonymous channels have been the essence of numerous protocols that include anonymous message passing between peers. The mixnet structure is one way to accomplish the anonymity . Since the publication of the Chaumian mixnet, there have been many practical implementations. There are two main approaches to implement mixnets: the decryption (Chaumian) and the re-encryption mixnets. In this paper we analyze four types of mixnets, from which one decryption and three re-encryption types. They were implemented in the Java programing language and evaluated on several criterias as: the number of messages, the total number of nodes, the number of threshold nodes, and the key length of underlying crypto system. In the results section we compare the results from the practical tests to answer the research question, which type of mixnets has better features