Verifiable Shuffled Decryption
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.
Place, publisher, year, edition, pages
Institutt for matematiske fag , 2013. , 70 p.
IdentifiersURN: urn:nbn:no:ntnu:diva-21427Local ID: ntnudaim:7263OAI: oai:DiVA.org:ntnu-21427DiVA: diva2:637038
Gjøsteen, Kristian, Førsteamanuensis