RT Journal Article
T1 Binary-Tree-Fed Mixnet: An Efficient Symmetric Encryption Solution
A1 López García, Diego Antonio
A1 Pérez Torreglosa, Juan
A1 Vera, David
A1 Sánchez Raya, Manuel
AB Mixnets are an instrument to achieve anonymity. They are generally a sequence of serversthat apply a cryptographic process and a permutation to a batch of user messages. Most useasymmetric cryptography, with the high computational cost that this entails. The main objective ofthis study is to reduce delay in mixnet nodes. In this sense, this paper presents a new scheme that is based only on symmetric cryptography. The novelty of this scheme is the use of binary graphs built by mixnet nodes. The root node collects user keys and labels without knowing their owners. After feeding each node by its graph, they can establish a random permutation and relate their keys to the incoming batch positions through labels. The differences with previous symmetric schemes are that users do not need long headers and nodes avoid the searching process. The outcomes are security and efficiency improvements. As far as we know, it is the fastest mixnet system. Therefore, it is appropriate for high-throughput applications like national polls (many users) or debates (many messages).
PB MDPI
SN 2076-3417 (electrónico)
YR 2024
FD 2024-01
LK https://hdl.handle.net/10272/23338
UL https://hdl.handle.net/10272/23338
LA eng
NO López-García, D. A., Pérez Torreglosa, J., Vera, D., & Sánchez-Raya, M. (2024). Binary-Tree-Fed Mixnet: An Efficient Symmetric Encryption Solution. In Applied Sciences (Vol. 14, Issue 3, p. 966). MDPI AG. https://doi.org/10.3390/app14030966
DS Repositorio Institucional de la Universidad de Huelva
RD 1 jun 2026