A Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem

dc.creatorNguyen,Lan
dc.creatorSafavi-Naini,Reihaneh
dc.creatorKurosawa,Kaoru
dc.date2005
dc.date.accessioned2024-02-06T12:53:43Z
dc.date.available2024-02-06T12:53:43Z
dc.descriptionWe propose a variant of the Paillier cryptosystem that improves efficiency in encryption, re-encryption and decryption while preserving the homomorphic property. We then use this variant to construct a new verifiable shuffle system and prove its security. We show that the new shuffle scheme has the least number of rounds and exponentiations compared to all known shuffle schemes. Finally, we show how to construct a publicly verifiable mix-net using the shuffle system.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-011-06-0986
dc.identifierhttps://lib.jucs.org/article/28425/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/8780
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 11(6): 986-1010
dc.subjectprivacy
dc.subjectverifiable shuffles
dc.subjectmix-nets
dc.subjectPaillier's public-key system
dc.titleA Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem
dc.typeResearch Article
Файлы
Коллекции