CIVILICA We Respect the Science
(ناشر تخصصی کنفرانسهای کشور / شماره مجوز انتشارات از وزارت فرهنگ و ارشاد اسلامی: ۸۹۷۱)

Providing a secure voting algorithm based elliptic curve cryptography

عنوان مقاله: Providing a secure voting algorithm based elliptic curve cryptography
شناسه ملی مقاله: DCEAEM01_167
منتشر شده در اولین کنفرانس سراسری توسعه محوری مهندسی عمران، معماری،برق و مکانیک ایران در سال 1393
مشخصات نویسندگان مقاله:

Behzad Molavi - Department of computer software, Vahdat-jam University Trobat-e-Jam, Iran
Milad Soltani - Department of computer, Torbat-e-Jam Branch, Islamic Azad University, Torbat-e-Jam, Iran

خلاصه مقاله:
Now days secure commence protocols are increasingly finding new uses. High information processing speed, low human sources expences are of sensible characteriestics of electronic commence protocols. digital voting is a necessity which is discussed in the commence protocols level. Un traceability is of important traits of voting systems.In this paper we present a protocol which , in addition to untraceability has low processing and memory overload. In this paper we use elliptic curve acryptography tool. Un traceabillity, high speed, vote privacy is of the most important characteriestics of this protocol

کلمات کلیدی:
Voting, E-commence, Un traceability, Low overload, Elliptic curve

صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/325770/