کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
459491 | 696256 | 2015 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Blinded additively homomorphic encryption schemes for self-tallying voting
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Blinded additively homomorphic encryption schemes for self-tallying voting Blinded additively homomorphic encryption schemes for self-tallying voting](/preview/png/459491.png)
چکیده انگلیسی
In this paper, we propose a self-tallying election protocol based public key homomorphic encryption. The additive homomorphism allows a set of participants (voters) to publish an encrypted value (ballot) and to compute the encrypted sum of all these values based on their ciphertexts. Our scheme has the particularity that anyone can decrypt the sum, but only once all participants have contributed to its computation. More precisely, the sum can be decrypted at all times, but remains blinded until all participants have contributed their vote, which contains a share of the unblinding key. Additionally, we propose an adaptation of Helios in order to provide self-tallying.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Information Security and Applications - Volume 22, June 2015, Pages 40–53
Journal: Journal of Information Security and Applications - Volume 22, June 2015, Pages 40–53
نویسندگان
Jérôme Dossogne, Frédéric Lafitte,