Bilinear pairing-based hybrid mixnet with anonymity revocation

A hybrid mix is presented providing anonymity and eligibility verification of senders, the possibility of anonymous reply and anonymity revocation, that are usually required in practice. Furthermore the proposed mix is capable of processing messages with arbitrarily length. In the process of design we applied bilinear pairings due to their good properties. We compared the time and space complexity of Zhong´s mix (Zhong, 2009) to our one, we achieved better efficiency. In the security evaluation we prove, that our mix is correct, provides anonymity and eligibility verification for senders.