Pseudo-Code Algorithms for Verifiable Re-encryption Mix-Nets
| Autor: | Rolf Haenni, Eric Dubuis, Philipp Locher, Reto E. Koenig |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
060201 languages & linguistics
business.industry Electronic voting Computer science Cryptography Pseudo-code 06 humanities and the arts 02 engineering and technology Encryption Mathematical proof Task (project management) Software 0602 languages and literature 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Verifiable secret sharing business Algorithm |
| Zdroj: | Financial Cryptography and Data Security ISBN: 9783319702773 Financial Cryptography Workshops |
| DOI: | 10.1007/978-3-319-70278-0_23 |
| Popis: | Implementing the shuffle proof of a verifiable mix-net is one of the most challenging tasks in the implementation of an electronic voting system. For non-specialists, even if they are experienced software developers, this task is nearly impossible to fulfill without spending an enormous amount of resources into studying the necessary cryptographic theory. In this paper, we present one of the existing shuffle proofs in a condensed form and explain all the necessary technical details in corresponding pseudo-code algorithms. The goal of presenting the shuffle proof in this form is to make it accessible to a broader audience and to facilitate its implementation by non-specialists. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|