Skip to main content

A Framework for Analyzing Associativity and Anonymity in Conventional and Electronic Summative Examinations

  • Conference paper
  • First Online:
  • 991 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 10063))

Abstract

The prevalence of malpractices in the assessments carried by educational institutions worldwide appears to be very high. Appropriate measures to deter and prevent the malpractices during the examinations are necessary to uphold the academic integrity and to ensure the basic principles of fairness throughout the examination process. Some malpractices such as question paper leakage and collusion/plagiarism can be controlled considerably, if unique question paper is provided to each student/group of students. However, the use of unique question paper for each student/group of students brings up some security and performance challenges non-existent in the examination system with the common question paper. One specific challenge in the examinations with the unique question paper is binding the unique question paper with the answer-script produced by the student and establishing the anonymity of student and examiners from each other. The purpose of this paper is to propose a framework, that establishes and preserves the association between the given question paper and the answer-script and provide required anonymity to students and examiners during an exchange of the examination content. In order to achieve this goal, we first formalize the associativity and anonymity properties and then validate our framework by analyzing the associativity and anonymity properties for the existing conventional/electronic summative examination system.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. ACM SIGPLAN Not. 36(3), 104–115 (2001)

    Article  MATH  Google Scholar 

  2. Apampa, K.M., Wills, G., Argles, D.: An approach to presence verification in summative e-assessment security. In: 2010 International Conference on Information Society (i-Society), pp. 647–651. IEEE (2010)

    Google Scholar 

  3. Bella, G., Giustolisi, R., Lenzini, G., Ryan, P.Y.A.: A secure exam protocol without trusted parties. In: Federrath, H., Gollmann, D. (eds.) SEC 2015. IAICT, vol. 455, pp. 495–509. Springer, Heidelberg (2015). doi:10.1007/978-3-319-18467-8_33

    Chapter  Google Scholar 

  4. Bhardwaj, M., Singh, A.J.: Automated integrated examination system: a security concern. Inf. Secur. J. Glob. Perspect. 20(3), 156–162 (2011)

    Article  Google Scholar 

  5. Blanchet, B.: An efficient cryptographic protocol verifier based on prolog rules. In: Schneider, S. (ed.) 14th IEEE Computer Security Foundations Workshop, pp. 82–96. IEEE Computer Society Press (2001)

    Google Scholar 

  6. Blanchet, B., Abadi, M., Fournet, C.: Automated verification of selected equivalences for security protocols. In: 20th Annual IEEE Symposium on Logic in Computer Science (LICS 2005), pp. 331–340 (2005)

    Google Scholar 

  7. Castella-Roca, J., Herrera-Joancomarti, J., Dorca-Josa, A.: A secure e-exam management system. In: The First International Conference on Availability, Reliability and Security, ARES 2006. IEEE (2006)

    Google Scholar 

  8. Delaune, S., Kremer, S., Ryan, M.: Verifying privacy-type properties of electronic voting protocols. J. Comput. Secur. 17(4), 435–487 (2009)

    Article  MATH  Google Scholar 

  9. Dolev, D., Yao, A.C.: On the security of public key protocols. IEEE Trans. Inf. Theory 29(2), 198–208 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  10. Dreier, J., Giustolisi, R., Kassem, A., Lafourcade, P., Lenzini, G.: A framework for analyzing verifiability in traditional and electronic exams. In: Lopez, J., Wu, Y. (eds.) ISPEC 2015. LNCS, vol. 9065, pp. 514–529. Springer, Heidelberg (2015). doi:10.1007/978-3-319-17533-1_35

    Chapter  Google Scholar 

  11. Dreier, J., Lafourcade, P., Lakhnech, Y.: Formal verification of e-auction protocols. In: Basin, D., Mitchell, J.C. (eds.) POST 2013. LNCS, vol. 7796, pp. 247–266. Springer, Heidelberg (2013). doi:10.1007/978-3-642-36830-1_13

    Chapter  Google Scholar 

  12. Eckstein, M.A.: Combating academic fraud: Towards a culture of integrity. International Institute for Educational Planning (2003)

    Google Scholar 

  13. Giustolisi, R., Lenzini, G., Bella, G.: What security for electronic exams? In: International Conference on Risks and Security of Internet and Systems (CRiSIS), pp. 1–5. IEEE (2013)

    Google Scholar 

  14. Giustolisi, R., Lenzini, G., Ryan, P.Y.A.: Remark!: a secure protocol for remote exams. In: Christianson, B., Malcolm, J., Matyáš, V., Švenda, P., Stajano, F., Anderson, J. (eds.) Security Protocols 2014. LNCS, vol. 8809, pp. 38–48. Springer, Heidelberg (2014). doi:10.1007/978-3-319-12400-1_5

    Google Scholar 

  15. Good, C.V., et al.: Dictionary of education (1945)

    Google Scholar 

  16. Huszti, A., Petho, A.: A secure electronic exam system. Publicationes Mathematicae Debrecen 77(3–4), 299–312 (2010)

    MathSciNet  MATH  Google Scholar 

  17. Kungpisdan, S.: Modelling, design, and analysis of secure mobile payment systems. Ph.D. thesis, Monash University (2005)

    Google Scholar 

  18. Maheshwari, V.: Malpractices in examinations-the termites destroying the educational set up (2011)

    Google Scholar 

  19. Morgan, C., O’reilly, M.: Assessing Open and Distance Learners. Psychology Press, Cambridge (1999)

    Google Scholar 

  20. Varble, D.: Reducing cheating opportunities in online test. Atlantic Mark. J. 3(3), 9 (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kissan Gauns Dessai .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Dessai, K.G., Kamat, V. (2016). A Framework for Analyzing Associativity and Anonymity in Conventional and Electronic Summative Examinations. In: Ray, I., Gaur, M., Conti, M., Sanghi, D., Kamakoti, V. (eds) Information Systems Security. ICISS 2016. Lecture Notes in Computer Science(), vol 10063. Springer, Cham. https://doi.org/10.1007/978-3-319-49806-5_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49806-5_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49805-8

  • Online ISBN: 978-3-319-49806-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics