Verifiable Shuffled Decryption
Master thesis
Permanent lenke
http://hdl.handle.net/11250/259169Utgivelsesdato
2013Metadata
Vis full innførselSamlinger
Sammendrag
We describe the Verifiable Shuffled Decryption problem, and present five solutions based on adapting several existing verifiable shuffles. All but one may have potential for implementation, the choice of which would depend on the required level of security and computational restrictions given by the available hardware.