Electronic Voting System

This paper presents the simulation of privacy-related applications employing blind signature (BS) schemes. Two popular privacy-related applications: 'traditional BS based electronic voting system (EVS)' and 'traditional offline electronic payment protocol (EPP)' have been chosen here. A BS scheme is a cryptographic protocol that plays a vital role to conduct the electronic transactions of privacy-related applications securely but anonymously. It ensures the confidentiality of the private information of a user while she involves in an electronic transaction over the internet. Intuitively, existing BS schemes can be categorized as traceable and untraceable. RSA cryptosystem based two popular schemes from two categories: the scheme of Chaum [1] from traceable schemes and the scheme of Hwang et al. [2] from untraceable schemes have been chosen here for simulation. The upshot of the simulation model is the comparison of computation time requirement of blinding, singing, unblinding and verification operations involved in different steps of privacy-related applications evaluated by the chosen BS schemes.

We propose a peripheral authentication scheme for autonomous vehicles. A mutual authentication protocol is required to secure every peripheral device access to a vehicle. Specifically, we present a vehicle to peripheral device authentication scheme. In addition, our three way handshake scheme for vehicle to keyfob authentication scheme based on generalized peripheral authentication scheme has been proposed. The vehicle to keyfob authentication scheme is adapted and improved with an additional attribute verification of the keyfob holder. Conventionally, vehicle to keyfob authentication is realized through a challenge-response verification protocol. An authentic coupling between the vehicle identity and the keyfob avoids any illegal access to the vehicle. However, these authentication messages can be relayed by an active adversary, thereby, can amplify the actual distance between the authentic vehicle and the keyfob. Eventually, through this malicious relaying an adversary can possibl...

This paper examines the various different types of electronic voting systems, and distinguishes between electronic machine voting and electronic distance voting. The prospects of electronic voting systems are unclear; this paper observes some of the risks and the costs that are associated with electronic voting systems. This paper discusses security requirements when using information communications technologies in an electronic voting system. This paper uses computer security requirements to develop a voter trust model that helps to identify weaknesses in electronic voting systems. This paper observes the security threats that may affect an electronic voting system and that can compromise such a system. Diebold's electronic voting systems highlight security concerns of electronic voting. To develop electronic voting system governments must make considerations regarding the system and its characteristics, as these will inevitably affect its future.

This case study aims at ensuring preservice science teachers to acquire experience by creating paper-based mind maps (PB-MM) and digital mind maps (D-MM) in technology education and to reveal their opinions on these mind mapping techniques. A total of 32 preservice science teachers, enrolled in the undergraduate program of Science Teaching at a university in Turkey, participated in this study. During the first three weeks of the six-week study, participants created PB-MM for certain subjects in science education. For the rest of the weeks, they created D-MM by using Coggle. As data collection tool, a form, consisting of open-ended questions, was used in this study. The obtained results demonstrated that the participants generally reported positive opinions including that mind maps are beneficial and useful tools in reinforcing, assessing and visualizing learning in general, making lessons more entertaining as well as offering ease of use. It was also concluded that students can also use mind maps in teaching of other topics such as "Vitamins", "The Earth and the Universe" and "Systems" in particular, as well as in events like meetings, presentations, brainstorming. Advantages of D-MM were listed as the possibility of adding multimedia material, ease of correction processes and the visual richness, while its disadvantage was listed as experiencing technical problems. PB-MM contribute to psychomotor development of students as well as learning by performing/experiencing. The difficulty in processes such as deleting, editing, etc. and in adding videos and images constitute the restrictions of PB-MM technique.

This paper presents the simulation of privacy-related applications employing blind signature (BS) schemes. Two popular privacy-related applications: 'traditional BS based electronic voting system (EVS)' and 'traditional offline electronic payment protocol (EPP)' have been chosen here. A BS scheme is a cryptographic protocol that plays a vital role to conduct the electronic transactions of privacy-related applications securely but anonymously. It ensures the confidentiality of the private information of a user while she involves in an electronic transaction over the internet. Intuitively, existing BS schemes can be categorized as traceable and untraceable. RSA cryptosystem based two popular schemes from two categories: the scheme of Chaum [1] from traceable schemes and the scheme of Hwang et al. [2] from untraceable schemes have been chosen here for simulation. The upshot of the simulation model is the comparison of computation time requirement of blinding, singing, unblinding and verification operations involved in different steps of privacy-related applications evaluated by the chosen BS schemes.

In this paper we analyze an authentication protocol so-called Pasargad which proposed by Arjemand et al. [1]. The Pasargad protocol is a distance bounding protocol which has been designed for RFID-based electronic voting systems. The designers have claimed that this protocol is more secure than Preneel and Single protocol [2], against relay attacks. However, in this paper, we present some efficient attacks against it. Our attacks include conditional impersonation attack and recovery key attack. Moreover, we show that this protocol has some structural flaw which may prevent to execution the protocol.

This paper presents the simulation of privacy-related applications employing blind signature (BS) schemes. Two popular privacy-related applications: ‘traditional BS based electronic voting system (EVS) ’ and ‘traditional offline electronic payment protocol (EPP) ’ have been chosen here. A BS scheme is a cryptographic protocol that plays a vital role to conduct the electronic transactions of privacy-related applications securely but anonymously. It ensures the confidentiality of the private information of a user while she involves in an electronic transaction over the internet. Intuitively, existing BS schemes can be categorized as traceable and untraceable. RSA cryptosystem based two popular schemes from two categories: the scheme of Chaum [1] from traceable schemes and the scheme of Hwang et al. [2] from untraceable schemes have been chosen here for simulation. The upshot of the simulation model is the comparison of computation time requirement of blinding, singing, unblinding and ...

In this paper we analyze an authentication protocol so-called Pasargad which proposed by Arjemand et al. [1]. The Pasargad protocol is a distance bounding protocol which has been designed for RFID-based electronic voting systems. The designers have claimed that this protocol is more secure than Preneel and Single protocol [2], against relay attacks. However, in this paper, we present some efficient attacks against it. Our attacks include conditional impersonation attack and recovery key attack. Moreover, we show that this protocol has some structural flaw which may prevent to execution the protocol.

Distance bounding protocols are launched based upon the round trip time measurements of the carried out messages to defend RFID systems against the relay attack. In such protocols, the reader authenticates tags and also estimates an upper bound for the physical distance between the tag and itself. Distance bounding protocols are vulnerable to mafia fraud and distance fraud attacks. In this paper, a new distance bounding protocol is proposed based on mutual utilization of binary predefined and random challenges. Moreover, this protocol is analyzed to compute the attacker's success probability due to mafia fraud and distance fraud attacks. In this case, the analysis and simulation results show that the proposed protocol obtains the desirable attackers' success probabilities, with minimum system memory requirement and minimum number of rounds compared with other distance bounding protocols employed by RFID systems.

Radio Frequency Identification (RFID) systems are vulnerable to relay attacks (i.e., mafia, terrorist and distance frauds) when they are used for authentication purposes. Distance bounding protocols are particularly designed as a countermeasure against these attacks. These protocols aim to ensure that the tags are in a distant area by measuring the round-trip delays during a rapid challenge-response exchange of short authenticated messages. Terrorist fraud is the most challenging attack to avoid, because a legitimate user (a tag owner) collaborates with an attacker to defeat the authentication system. Many RFID distance bounding protocols have been proposed recently, with encouraging results. However, none of them provides the ideal security against the terrorist fraud. Motivated by this need, we first introduce a strong adversary model for Physically Unclonable Functions (PUFs) based authentication protocol in which the adversary has access to volatile memory of the tag. We show that the security of Sadeghi et al.'s PUF based authentication protocol is not secure in this model. We provide a new technique to improve the security of their protocol. Namely, in our scheme, even if an adversary has access to volatile memory she cannot obtain all long term keys to clone the tag. Next, we propose a novel RFID distance bounding protocol based on PUFs which satisfies the expected security requirements. Comparing to the previous protocols, the use of PUFs in our protocol enhances the system in terms of security, privacy and tag computational overhead. We also prove that our extended protocol with a final signature provides the ideal security against all those frauds, remarkably the terrorist fraud. Besides that, our protocols enjoy the attractive properties of PUFs, which provide the most cost efficient and reliable means to fingerprint chips based on their physical properties.

This case study aims at ensuring preservice science teachers to acquire experience by creating paper-based mind maps (PB-MM) and digital mind maps (D-MM) in technology education and to reveal their opinions on these mind mapping techniques. A total of 32 preservice science teachers, enrolled in the undergraduate program of Science Teaching at a university in Turkey, participated in this study. During the first three weeks of the six-week study, participants created PB-MM for certain subjects in science education. For the rest of the weeks, they created D-MM by using Coggle. As data collection tool, a form, consisting of open-ended questions, was used in this study. The obtained results demonstrated that the participants generally reported positive opinions including that mind maps are beneficial and useful tools in reinforcing, assessing and visualizing learning in general, making lessons more entertaining as well as offering ease of use. It was also concluded that students can also use mind maps in teaching of other topics such as "Vitamins", "The Earth and the Universe" and "Systems" in particular, as well as in events like meetings, presentations , brainstorming. Advantages of D-MM were listed as the possibility of adding multime-dia material, ease of correction processes and the visual richness, while its disadvantage was listed as experiencing technical problems. PB-MM contribute to psychomotor development of students as well as learning by performing/experiencing. The difficulty in processes such as deleting, editing , etc. and in adding videos and images constitute the restrictions of PB-MM technique.

Electronic voting system used in the study, primary and secondary schools (Elektroy-EOS) use, and on the contributions of the educational environment using the system to investigate teachers' views. Case study used qualitative research methods. In this respect primary and secondary schools in the province of Bolu in Turkey, EOS opinion of the class that implements the different branches were 22 teachers, content analysis was conducted. To increase the interest and motivation of students to EOS result of the study course, the student assessment opportunities offered at the time and concluded that the competitive environment created. In this system, the uses of instructional materials have been identified mostly used as a measurement tool. Sorry did not see top-ranked students fail to hear them, the formation of a noisy environment, such as time consuming problems encountered in the implementation process have been identified.

In this research, it is aimed to investigate in depth the thoughts and practices of primary teachers regarding the practice of dialogical teaching. This research is designed as a phenomenological. Within the scope of the study, the researcher examined the conditions under which the experiences of dialogic teaching in the learning-teaching process are realised, focusing on the phenomenon of dialogical teaching. Research data are gathered through interviews and observations. 11 primary teachers participated in the interviews as well as with the observations in the classroom of four teachers. In the analysis of the interview data, Moustakas data analysis technique is used. The findings of the interviews show that teachers care about interaction and try to regulate the learning environment accordingly. On the contrary, the findings obtained from the observations do not support the interviews. It is observed that the learning environment is monologue rather than dialogic.

Dear Colleagues It is an honour for us to welcome you as Editors of Cypriot Journal of Educational Sciences which has accepted publications since 2006 and is indexed in qualified databases. Cypriot Journal of Educational Sciences (CJES) is listed in many scholarly citation indexes; DOAJ, Ulrich's Educational Research Abstracts (ERA), EBSCO, Google Scholar, PsycINFO, Asian Education Index & AWER index. Also our major aim is to increase the quality of the journal day by day. We are ready to publish the new studies of Cypriot Journal of Educational Sciences which has 6 full length articles written by authors from, Philippines, Turkey and Cyprus. The aim of this issue is to give the researchers an opportunity to share their academic studies. First of all, I would like to thank all who have contributed to this issue. There are different focuses. For example, Hakan Sarıçam, Mehmet Çardak, Erkan Yaman analyze the relationship between mobbing and forgiveness. In this study, the Mobbing Scale and Heartland Forgiveness Scale were used. The relationships between mobbing and forgiveness were examined using correlation analysis and the hypothesis model was tested through structural equation modeling. The study was conducted with 436 teachers from Sakarya, Turkey. Mustafa Fidan, Murat Debbağ, Barış Çukurbaşı, on the other hand, examined teacher perceptions about the electronic voting system used in classroom. The electronic voting system used in the study, primary and secondary schools (Elektroy-EOS) use, and on the contributions of the educational environment using the system to investigate teachers' views. Also Gülay Dalgıç and Güzide Bayhan studied on student misbehaviors in classroom have focused on the identification of most frequent misbehaviors and individual practices used by the teachers. This Meta-analysis reviewed the literature in Turkey on student misbehaviors from the views of teachers and demographic factors in theses and published articles between 2000-2012 years. And Betül Aydın, Serkan Volkan Sarı and Mustafa Şahin examined of this study, the relationship between adult attachment styles and Internet addiction among university students. Also four articles in this issue are related to Turkish studies. Aşkın Kiraz and Rasiha Özyurtlu examined the relationship between level of burnout and level of perfectionism of science teachers who work in primary and secondary education institutions in Nicosia in Northern Cyprus. And Marie Paz E. Morales, combined qualitative approaches with quantitative research design to come up with a survey instrument called Culture-Sensitive Physics Learning Environment Survey (CS-PLES). This survey instrument is intended to extract the learners' beliefs and expectations on the integration of culture and language in the teaching and learning process of physics concepts.

Electronic voting system used in the study, primary and secondary schools (Elektroy-EOS) use, and on the contributions of the educational environment using the system to investigate teachers' views. Case study used qualitative research methods. In this respect primary and secondary schools in the province of Bolu in Turkey, EOS opinion of the class that implements the different branches were 22 teachers, content analysis was conducted. To increase the interest and motivation of students to EOS result of the study course, the student assessment opportunities offered at the time and concluded that the competitive environment created. In this system, the uses of instructional materials have been identified mostly used as a measurement tool. Sorry did not see top-ranked students fail to hear them, the formation of a noisy environment, such as time consuming problems encountered in the implementation process have been identified.

Relay attacks are one of the most challenging threats RFID will have to face in the close future. They consist in making the verifier believe that the prover is in its close vicinity by surreptitiously forwarding the signal between the verifier and an out-of-field prover. Distance bounding protocols represent a promising way to thwart relay attacks, by measuring the round trip time of short authenticated messages. Several such protocols have been designed during the last years but none of them combine all the features one may expect in a RFID system. We introduce in this paper the first solution that compounds in a single protocol all these desirable features. We prove, with respect to the previous protocols, that our proposal is the best one in terms of security, privacy, tag computational overhead, and fault tolerance. We also point out a weakness in Tu and Piramuthu's protocol, which was considered up to now as one of the most efficient distance bounding protocol.

Distance-Bounding identification protocols aim at impeding man-in-themiddle attacks by measuring response times. There are three kinds of attacks such protocols could address: (1) Mafia attacks where the adversary relays communication between honest prover and honest verifier in different sessions; (2) Terrorist attacks where the adversary gets limited active support from the prover to impersonate. (3) Distance attacks where a malicious prover claims to be closer to the verifier than it actually is. Many protocols in the literature address one or two such threats, but no rigorous cryptographic security models -nor clean security proofs-exist so far. For resource-constrained RFID tags, distance-bounding is more difficult to achieve. Our contribution here is to formally define security against the above-mentioned attacks and to relate the properties. We thus refute previous beliefs about relations between the notions, showing instead that they are independent. Finally we use our new framework to assess the security of the RFID distance-bounding scheme due to Kim and Avoine, and enhance it to include impersonation security and allow for errors due to noisy channel transmissions.

In this paper we analyze an authentication protocol so-called Pasargad which proposed by Arjemand et al. [1]. The  Pasargad protocol is a distance bounding protocol which has been designed for RFID-based electronic voting systems. The designers have claimed that this protocol is more secure than Preneel and Single protocol [2], against relay attacks. However, in this paper, we present some efficient attacks against it. Our attacks include conditional impersonation attack and recovery key attack. Moreover, we show that
this protocol has some structural flaw which may prevent to execution the protocol

Electronic voting system used in the study, primary and secondary schools (Elektroy -EOS) use, and on the contributions of the educational environment using the system to investigate teachers' views. Case study used qualitative research methods. In this respect primary and secondary schools in the province of Bolu in Turkey, EOS opinion of the class that implements the different branches were 22 teachers, content analysis was conducted. To increase the interest and motivation of students to EOS result of the study course, the student assessment opportunities offered at the time and concluded that the competitive environment created. In this system, the uses of instructional materials have been identified mostly used as a measurement tool. Sorry did not see top-ranked students fail to hear them, the formation of a noisy environment, such as time consuming problems encountered in the implementation process have been identified.

Electronic voting system used in the study, primary and secondary schools (Elektroy -EOS) use, and on the contributions of the educational environment using the system to investigate teachers' views. Case study used qualitative research methods. In this respect primary and secondary schools in the province of Bolu in Turkey, EOS opinion of the class that implements the different branches were 22 teachers, content analysis was conducted. To increase the interest and motivation of students to EOS result of the study course, the student assessment opportunities offered at the time and concluded that the competitive environment created. In this system, the uses of instructional materials have been identified mostly used as a measurement tool. Sorry did not see top-ranked students fail to hear them, the formation of a noisy environment, such as time consuming problems encountered in the implementation process have been identified.

Abstract: Many distance bounding protocols appropriate for RFID technology have been proposed recently. However, the design and the analysis of these protocols are not based on a formal perspective. Motivated by this need, a formal framework is presented that helps the future attempts to cryptanalyze and design new distance bounding protocols. We first formalize the adversary scenarios, the protocol means, and the adversary goals in general.

The learning environment plays an important role in how students perceive information and how they learn. Models and methods have changed over the years influenced by greater student diversity in addition to national HE strategic agendas. This has led to an increasing prominence being afforded to the student voice in evaluating and influencing learning, teaching and assessment practice (Heywood 2000).

Abstract. The communication between an honest prover and an honest verifier can be intercepted by a malicious man-in-the-middle (MiM), without the legitimate interlocutors noticing the intrusion. The attacker can simply relay messages from one party to another, eventually impersonating the prover to the verifier and possibly gaining the privileges of the former.

Radio Frequency Identification (RFID) systems are vulnerable to relay attacks (i.e., mafia, terrorist and distance frauds) when they are used for authentication purposes. Distance bounding protocols are particularly designed as a countermeasure against these attacks. These protocols aim to ensure that the tags are in a distant area by measuring the round-trip delays during a rapid challenge-response exchange of short authenticated messages. Terrorist fraud is the most challenging attack to avoid, because a legitimate user (a tag owner) collaborates with an attacker to defeat the authentication system. Many RFID distance bounding protocols have been proposed recently, with encouraging results. However, none of them provides the ideal security against the terrorist fraud. Motivated by this need, we first introduce a strong adversary model for Physically Unclonable Functions (PUFs) based authentication protocol in which the adversary has access to volatile memory of the tag. We show that the security of Sadeghi et al.'s PUF based authentication protocol is not secure in this model. We provide a new technique to improve the security of their protocol. Namely, in our scheme, even if an adversary has access to volatile memory she cannot obtain all long term keys to clone the tag. Next, we propose a novel RFID distance bounding protocol based on PUFs which satisfies the expected security requirements. Comparing to the previous protocols, the use of PUFs in our protocol enhances the system in terms of security and privacy. We also prove that our extended protocol with a final signature provides the ideal security against all those frauds, remarkably the terrorist fraud. Besides that, our protocols enjoy the attractive properties of PUFs, which provide a cost efficient and reliable method to fingerprint chips based on their physical properties.

In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two specific classes, leaving the security bounds for the general case as an open problem. As for the classification, we introduce the notion of k-previous challenge dependent (k-PCD) protocols where each response bit depends on the current and k-previous challenges and there is no final signature. We treat the case k = 0, which means each response bit depends only on the current challenge, as a special case and define such protocols as current challenge dependent (CCD) protocols. In general, we construct a trade-off curve between the security levels of mafia and distance frauds by introducing two generic attack algorithms. This leads to the conclusion that CCD protocols cannot attain the ideal security against distance fraud, i.e. 1/2, for each challenge-response bit, without totally losing the security against mafia fraud. We extend the generic attacks to 1-PCD protocols and obtain a trade-off curve for 1-PCD protocols pointing out that 1-PCD protocols can provide better security than CCD protocols. Thereby, we propose a natural extension of a CCD protocol to a 1-PCD protocol in order to improve its security. As a study case, we give two natural extensions of Hancke and Kuhn protocol to show how to enhance the security against either mafia fraud or distance fraud without extra cost.

Many distance bounding protocols appropriate for the RFID technology have been proposed recently. Unfortunately, they are commonly designed without any formal approach, which leads to inaccurate analyzes and unfair comparisons. Motivated by this need, we introduce a unified framework that aims to improve analysis and design of distance bounding protocols. Our framework includes a thorough terminology about the frauds, adversary, and prover, thus disambiguating many misleading terms. It also explores the adversary's capabilities and strategies, and addresses the impact of the prover's ability to tamper with his device. It thus introduces some new concepts in the distance bounding domain as the black-box and white-box models, and the relation between the frauds with respect to these models. The relevancy and impact of the framework is finally demonstrated on a study case: Munilla-Peinado distance bounding protocol. through the accomplice and the adversary. The communication between the adversary and her accomplice can be set up, for example, using mobile phones. One may argue that the merchant will detect the attack. However, some payment systems are based on the NFC-friendly cellphones and this still facilitates the masquerade because the merchant is not able to see that the cell-phone performs a mafia fraud.

In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two specific classes, leaving the security bounds for the general case as an open problem. As for the classification, we introduce the notion of k-previous challenge dependent (k-PCD) protocols where each response bit depends on the current and k-previous challenges and there is no final signature. We treat the case k = 0, which means each response bit depends only on the current challenge, as a special case and define such protocols as current challenge dependent (CCD) protocols. In general, we construct a trade-off curve between the security levels of mafia and distance frauds by introducing two generic attack algorithms. This leads to the conclusion that CCD protocols cannot attain the ideal security against distance fraud, i.e. 1/2, for each challenge-response bit, without totally losing the security against mafia fraud. We extend the generic attacks to 1-PCD protocols and obtain a trade-off curve for 1-PCD protocols pointing out that 1-PCD protocols can provide better security than CCD protocols. Thereby, we propose a natural extension of a CCD protocol to a 1-PCD protocol in order to improve its security. As a study case, we give two natural extensions of Hancke and Kuhn protocol to show how to enhance the security against either mafia fraud or distance fraud without extra cost.

Radio Frequency Identification (RFID) systems are vulnerable to relay attacks (i.e., mafia, terrorist and distance frauds) when they are used for authentication purposes. Distance bounding protocols are particularly designed as a countermeasure against these attacks. These protocols aim to ensure that the tags are in a distant area by measuring the round-trip delays during a rapid challenge-response exchange of short authenticated messages. Terrorist fraud is the most challenging attack to avoid, because a legitimate user (a tag owner) collaborates with an attacker to defeat the authentication system. Many RFID distance bounding protocols have been proposed recently, with encouraging results. However, none of them provides the ideal security against the terrorist fraud. Motivated by this need, we first introduce a strong adversary model for Physically Unclonable Functions (PUFs) based authentication protocol in which the adversary has access to volatile memory of the tag. We show that the security of Sadeghi et al.'s PUF based authentication protocol is not secure in this model. We provide a new technique to improve the security of their protocol. Namely, in our scheme, even if an adversary has access to volatile memory she cannot obtain all long term keys to clone the tag. Next, we propose a novel RFID distance bounding protocol based on PUFs which satisfies the expected security requirements. Comparing to the previous protocols, the use of PUFs in our protocol enhances the system in terms of security and privacy. We also prove that our extended protocol with a final signature provides the ideal security against all those frauds, remarkably the terrorist fraud. Besides that, our protocols enjoy the attractive properties of PUFs, which provide a cost efficient and reliable method to fingerprint chips based on their physical properties.

Many distance bounding protocols appropriate for the RFID technology have been proposed recently. Unfortunately, they are commonly designed without any formal approach, which leads to inaccurate analyzes and unfair comparisons. Motivated by this need, we introduce a unified framework that aims to improve analysis and design of distance bounding protocols. Our framework includes a thorough terminology about the frauds, adversary, and prover, thus disambiguating many misleading terms. It also explores the adversary's capabilities and strategies, and addresses the impact of the prover's ability to tamper with his device. It thus introduces some new concepts in the distance bounding domain as the black-box and white-box models, and the relation between the frauds with respect to these models. The relevancy and impact of the framework is finally demonstrated on a study case: Munilla-Peinado distance bounding protocol. through the accomplice and the adversary. The communication between the adversary and her accomplice can be set up, for example, using mobile phones. One may argue that the merchant will detect the attack. However, some payment systems are based on the NFC-friendly cellphones and this still facilitates the masquerade because the merchant is not able to see that the cell-phone performs a mafia fraud.