{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:13:57Z","timestamp":1743142437726,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319702773"},{"type":"electronic","value":"9783319702780"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-70278-0_21","type":"book-chapter","created":{"date-parts":[[2017,11,17]],"date-time":"2017-11-17T21:03:19Z","timestamp":1510952599000},"page":"337-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Existential Assertions for Voting Protocols"],"prefix":"10.1007","author":[{"given":"R.","family":"Ramanujam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vaishnavi","family":"Sundararajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. P.","family":"Suresh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,19]]},"reference":[{"key":"21_CR1","unstructured":"Adida, B.: Helios: web-based open-audit voting. In: Proceedings of 17th Conference on Security Symposium (SS 2008), pp. 335\u2013348 (2008)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Arapinis, M., Chothia, T., Ritter, E., Ryan, M.: Analysing unlinkability and anonymity using the applied Pi calculus. In: 23rd IEEE Computer Security Foundations Symposium, pp. 107\u2013121 (2010)","DOI":"10.1109\/CSF.2010.15"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-36563-8_7","volume-title":"Engineering Secure Software and Systems","author":"D Butin","year":"2013","unstructured":"Butin, D., Gray, D., Bella, G.: Towards verifying voter privacy through unlinkability. In: J\u00fcrjens, J., Livshits, B., Scandariato, R. (eds.) ESSoS 2013. LNCS, vol. 7781, pp. 91\u2013106. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36563-8_7"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Backes, M., Hritcu, C., Maffei, M.: Type-checking zero-knowledge. In: Proceedings of 15th ACM CCS, pp. 357\u2013370 (2008)","DOI":"10.1145\/1455770.1455816"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Backes, M., Maffei, M., Unruh, D.: Zero-knowledge in the applied Pi-calculus and automated verification of the direct anonymous attestation protocol. In: IEEE Symposium on Security and Privacy, pp. 202\u2013215 (2008)","DOI":"10.1109\/SP.2008.23"},{"key":"21_CR6","unstructured":"Boureanu, I., Jones, A.V., Lomuscio, A.: Automatic verification of epistemic specifications under convergent equational theories. In: Proceedings of 11th AAMAS, pp. 1141\u20131148 (2012)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-15155-2_11","volume-title":"Mathematical Foundations of Computer Science 2010","author":"A Baskar","year":"2010","unstructured":"Baskar, A., Ramanujam, R., Suresh, S.P.: A dexptime-complete Dolev-Yao theory with distributive encryption. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 102\u2013113. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15155-2_11"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-1-4757-0602-4_18","volume-title":"Advances in Cryptology","author":"D Chaum","year":"1983","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) Advances in Cryptology, pp. 199\u2013203. Springer, Boston (1983). https:\/\/doi.org\/10.1007\/978-1-4757-0602-4_18"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Cortier, V., Smyth, B.: Attacking and fixing Helios: an analysis of ballot secrecy. In: Proceedings of Computer Security Foundations Symposium, pp. 297\u2013311 (2011)","DOI":"10.1109\/CSF.2011.27"},{"key":"21_CR10","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.: On the security of public key protocols. IEEE Trans. Inf. Theory 29, 198\u2013208 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Fujioka, A., Okamoto, T., Ohta, K.: A practical secret voting scheme for large scale elections. In: International Workshop on the Theory and Application of Cryptographic Techniques, pp. 244\u2013251 (1992)","DOI":"10.1007\/3-540-57220-1_66"},{"key":"21_CR12","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s004460050043","volume":"11","author":"JW Gray","year":"1998","unstructured":"Gray, J.W., Syverson, P.F.: A logical approach to multilevel security of probabilistic systems. Distrib. Comput. 11, 73\u201390 (1998)","journal-title":"Distrib. Comput."},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-540-78967-3_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J Groth","year":"2008","unstructured":"Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 415\u2013432. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_24"},{"issue":"3","key":"21_CR14","doi-asserted-by":"crossref","first-page":"483","DOI":"10.3233\/JCS-2005-13305","volume":"13","author":"JY Halpern","year":"2005","unstructured":"Halpern, J.Y., O\u2019Neill, K.R.: Anonymity and information hiding in multiagent systems. J. Comput. Secur. 13(3), 483\u2013514 (2005)","journal-title":"J. Comput. Secur."},{"issue":"1","key":"21_CR15","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/JCS-2004-12102","volume":"12","author":"D Hughes","year":"2004","unstructured":"Hughes, D., Shmatikov, V.: Information hiding, anonymity and privacy: a modular approach. J. Comput. Secur. 12(1), 3\u201336 (2004)","journal-title":"J. Comput. Secur."},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-540-31987-0_14","volume-title":"Programming Languages and Systems","author":"S Kremer","year":"2005","unstructured":"Kremer, S., Ryan, M.: Analysis of an electronic voting protocol in the applied Pi calculus. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 186\u2013200. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31987-0_14"},{"issue":"4","key":"21_CR17","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1016\/j.ic.2006.10.008","volume":"205","author":"P Lafourcade","year":"2007","unstructured":"Lafourcade, P., Lugiez, D., Treinen, R.: Intruder deduction for the equational theory of Abelian Groups with distributive encryption. Inf. Comput. 205(4), 581\u2013623 (2007)","journal-title":"Inf. Comput."},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Maffei, M., Pecina, K., Reinert, M.: Security and privacy by declarative design. In: IEEE 26th CSF Symposium, pp. 81\u201396 (2013)","DOI":"10.1109\/CSF.2013.13"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Mauw, S., Verschuren, J., de Vink, E.P.: Data anonymity in the FOO voting scheme. In: Electronic Notes in Theoretical Computer Science, pp. 5\u201328 (2007)","DOI":"10.1016\/j.entcs.2006.11.001"},{"key":"21_CR20","unstructured":"The Netflix Prize. http:\/\/www.netflixprize.com\/index.html"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-319-13841-1_4","volume-title":"Information Systems Security","author":"R Ramanujam","year":"2014","unstructured":"Ramanujam, R., Sundararajan, V., Suresh, S.P.: Extending Dolev-Yao with assertions. In: Prakash, A., Shyamasundar, R. (eds.) ICISS 2014. LNCS, vol. 8880, pp. 50\u201368. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13841-1_4"},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1007\/3-540-48119-2_45","volume-title":"FM 1999\u2014Formal Methods","author":"PF Syverson","year":"1999","unstructured":"Syverson, P.F., Stubblebine, S.G.: Group principals and the formalization of anonymity. In: Wing, J.M., Woodcock, J., Davies, J. (eds.) FM 1999. LNCS, vol. 1708, pp. 814\u2013833. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48119-2_45"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-70278-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,6]],"date-time":"2019-10-06T05:18:32Z","timestamp":1570339112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-70278-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319702773","9783319702780"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-70278-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}