{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:36:32Z","timestamp":1742956592549,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319175324"},{"type":"electronic","value":"9783319175331"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17533-1_35","type":"book-chapter","created":{"date-parts":[[2015,4,8]],"date-time":"2015-04-08T12:50:20Z","timestamp":1428497420000},"page":"514-529","source":"Crossref","is-referenced-by-count":7,"title":["A Framework for Analyzing Verifiability in Traditional and Electronic Exams"],"prefix":"10.1007","author":[{"given":"Jannik","family":"Dreier","sequence":"first","affiliation":[]},{"given":"Rosario","family":"Giustolisi","sequence":"additional","affiliation":[]},{"given":"Ali","family":"Kassem","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Lafourcade","sequence":"additional","affiliation":[]},{"given":"Gabriele","family":"Lenzini","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","first-page":"104","volume-title":"POPL 2001","author":"M. Abadi","year":"2001","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: POPL 2001, pp. 104\u2013115. ACM, New York (2001)"},{"key":"35_CR2","unstructured":"Benaloh, J.: Verifiable Secret-Ballot Elections. Ph.D. thesis, Yale University (December 1996)"},{"key":"35_CR3","first-page":"544","volume-title":"STOC 1994","author":"J. Benaloh","year":"1994","unstructured":"Benaloh, J., Tuinstra, D.: Receipt-free secret-ballot elections (extended abstract). In: STOC 1994, pp. 544\u2013553. ACM, New York (1994)"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Blanchet, B.: A Computationally Sound Mechanized Prover for Security Protocols. In: Proc. of the IEEE Symposium on Security and Privacy, Oakland, pp. 140\u2013154 (May 2006)","DOI":"10.1109\/SP.2006.1"},{"key":"35_CR5","first-page":"82","volume-title":"CSFW","author":"B. Blanchet","year":"2001","unstructured":"Blanchet, B.: An Efficient Cryptographic Protocol Verifier Based on Prolog Rules. In: CSFW, pp. 82\u201396. IEEE Computer Society, Cape Breton (2001)"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Castell\u00e0-Roca, J., Herrera-Joancomart\u00ed, J., Dorca-Josa, A.: A Secure E-Exam Management System. In: ARES, pp. 864\u2013871. IEEE Computer Society (2006)","DOI":"10.1109\/ARES.2006.14"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, J., Fischer, M.: A robust and verifiable cryptographically secure election scheme (extended abstract). In: FOCS 1985, pp. 372\u2013382. IEEE Computer Society (October 1985)","DOI":"10.1109\/SFCS.1985.2"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Culnane, C., Schneider, S.: A peered bulletin board for robust use in verifiable voting systems. In: CSF (2014)","DOI":"10.1109\/CSF.2014.20"},{"issue":"2","key":"35_CR9","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.C.: On the security of public key protocols. IEEE Transactions on Information Theory\u00a029(2), 198\u2013208 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"key":"35_CR10","unstructured":"Dreier, J., Giustolisi, R., Kassem, A., Lafourcade, P., Lenzini, G.: On the verifiability of (electronic) exams. Tech. Rep. TR-2014-2, Verimag (April 2014)"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Dreier, J., Giustolisi, R., Kassem, A., Lafourcade, P., Lenzini, G., Ryan, P.Y.A.: Formal analysis of electronic exams. In: SECRYPT 2014. SciTePress (2014)","DOI":"10.5220\/0005050901010112"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Dreier, J., Jonker, H., Lafourcade, P.: Defining verifiability in e-auction protocols. In: ASIACCS 2013, pp. 547\u2013552. ACM (2013)","DOI":"10.1145\/2484313.2484387"},{"key":"35_CR13","unstructured":"Figaro, L.: Etudiants: les examens sur tablettes num\u00e9riques appell\u00e9s a se multiplier. Press release (January 2015), \n                        goo.gl\/ahxQJD"},{"key":"35_CR14","unstructured":"Flock, E.: Aps (atlanta public schools) embroiled in cheating scandal. (November 2011), \n                        http:\/\/goo.gl\/fqzBBR\n                       (retrieved)"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Giustolisi, R., Lenzini, G., Bella, G.: What security for electronic exams? In: CRiSIS 2013, pp. 1\u20135. IEEE (2013)","DOI":"10.1109\/CRiSIS.2013.6766348"},{"key":"35_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/978-3-319-12400-1_5","volume-title":"Security Protocols XXII","author":"R. Giustolisi","year":"2014","unstructured":"Giustolisi, R., Lenzini, G., Ryan, P.Y.A.: Remark!: A secure protocol for remote exams. In: Christianson, B., Malcolm, J., Maty\u00e1\u0161, V., \u0160venda, P., Stajano, F., Anderson, J. (eds.) Security Protocols 2014. LNCS, vol.\u00a08809, pp. 38\u201348. Springer, Heidelberg (2014)"},{"key":"35_CR17","unstructured":"Gu\u00e9nard, F.: La Fabrique des Tricheurs: La fraude aux examens expliqu\u00e9e au ministre, aux parents et aux professeurs. Jean-Claude Gawsewitch (2012)"},{"key":"35_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-642-04444-1_11","volume-title":"Computer Security \u2013 ESORICS 2009","author":"N. Guts","year":"2009","unstructured":"Guts, N., Fournet, C., Zappa Nardelli, F.: Reliable evidence: Auditability by typing. In: Backes, M., Ning, P. (eds.) ESORICS 2009. LNCS, vol.\u00a05789, pp. 168\u2013183. Springer, Heidelberg (2009)"},{"key":"35_CR19","unstructured":"Haenni, R., Spycher, O.: Secure internet voting on limited devices with anonymized dsa public keys. In: EVT\/WOTE 2011. USENIX (2011)"},{"key":"35_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-45539-6_38","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"M. Hirt","year":"2000","unstructured":"Hirt, M., Sako, K.: Efficient receipt-free voting based on homomorphic encryption. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 539\u2013556. Springer, Heidelberg (2000)"},{"key":"35_CR21","doi-asserted-by":"crossref","first-page":"299","DOI":"10.5486\/PMD.2010.4682","volume":"77","author":"A. Huszti","year":"2010","unstructured":"Huszti, A., Peth\u00f5, A.: A secure electronic exam system. Publicationes Mathematicae Debrecen\u00a077, 299\u2013312 (2010)","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"35_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-15497-3_24","volume-title":"Computer Security \u2013 ESORICS 2010","author":"S. Kremer","year":"2010","unstructured":"Kremer, S., Ryan, M., Smyth, B.: Election verifiability in electronic voting protocols. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol.\u00a06345, pp. 389\u2013404. Springer, Heidelberg (2010)"},{"key":"35_CR23","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., Truderung, T., Vogt, A.: Accountability: definition and relationship to verifiability. In: CCS 2010, pp. 526\u2013535. ACM (2010)","DOI":"10.1145\/1866307.1866366"},{"key":"35_CR24","unstructured":"Ryan, P.Y.A., Schneider, S.A., Goldsmith, M., Lowe, G., Roscoe, A.W.: The Modelling and Analysis of Security Protocols: The CSP Approach. Addison-Wesley Professional (2000)"},{"key":"35_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-16074-5_11","volume-title":"Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security","author":"B. Smyth","year":"2010","unstructured":"Smyth, B., Ryan, M., Kremer, S., Kourjieh, M.: Towards automatic analysis of election verifiability properties. In: Armando, A., Lowe, G. (eds.) ARSPA-WITS 2010. LNCS, vol.\u00a06186, pp. 146\u2013163. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Information Security Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17533-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T14:47:59Z","timestamp":1675262879000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17533-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319175324","9783319175331"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17533-1_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}