{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:37:30Z","timestamp":1742949450402,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030354220"},{"type":"electronic","value":"9783030354237"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35423-7_13","type":"book-chapter","created":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:02:46Z","timestamp":1575849766000},"page":"250-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Blind Coupon Mechanism Enabling Veto Voting over Unreliable Networks"],"prefix":"10.1007","author":[{"given":"Colin","family":"Boyd","sequence":"first","affiliation":[]},{"given":"Kristian","family":"Gj\u00f8steen","sequence":"additional","affiliation":[]},{"given":"Cl\u00e9mentine","family":"Gritti","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Haines","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,19]]},"reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00145-014-9196-7","volume":"29","author":"M Abe","year":"2016","unstructured":"Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., Ohkubo, M.: Structure-preserving signatures and commitments to group elements. J. Cryptol. 29(2), 363\u2013421 (2016)","journal-title":"J. Cryptol."},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/11593447_14","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"J Aspnes","year":"2005","unstructured":"Aspnes, J., Diamadi, Z., Gj\u00f8steen, K., Peralta, R., Yampolskiy, A.: Spreading alerts quietly and the subgroup escape problem. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 253\u2013272. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11593447_14"},{"issue":"4","key":"13_CR3","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1007\/s00145-014-9181-1","volume":"28","author":"J Aspnes","year":"2015","unstructured":"Aspnes, J., Diamadi, Z., Yampolskiy, A., Gj\u00f8steen, K., Peralta, R.: Spreading alerts quietly and the subgroup escape problem. J. Cryptol. 28(4), 796\u2013819 (2015)","journal-title":"J. Cryptol."},{"issue":"4","key":"13_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1049\/iet-ifs.2018.5115","volume":"13","author":"S Bag","year":"2018","unstructured":"Bag, S., Azad, M.A., Hao, F.: PriVeto: a fully private two-round veto protocol. IET Inf. Secur. 13(4), 311\u2013320 (2018)","journal-title":"IET Inf. Secur."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Blazy, O., Chevalier, C.: Spreading alerts quietly: new insights from theory and practice. In: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, pp. 30:1\u201330:6. ACM (2018)","DOI":"10.1145\/3230833.3230841"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/11535218_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"D Boneh","year":"2005","unstructured":"Boneh, D., Gentry, C., Waters, B.: Collusion resistant broadcast encryption with short ciphertexts and private keys. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 258\u2013275. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_16"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/11734727_5","volume-title":"Information Security and Cryptology - ICISC 2005","author":"F Brandt","year":"2006","unstructured":"Brandt, F.: Efficient cryptographic protocol design based on distributed El Gamal encryption. In: Won, D.H., Kim, S. (eds.) ICISC 2005. LNCS, vol. 3935, pp. 32\u201347. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11734727_5"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/3-540-46035-7_21","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"E Bresson","year":"2002","unstructured":"Bresson, E., Chevassut, O., Pointcheval, D.: Dynamic group diffie-hellman key exchange under standard assumptions. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 321\u2013336. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_21"},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: unconditional sender and recipient untraceability. J. Cryptol. 1(1), 65\u201375 (1988)","journal-title":"J. Cryptol."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: Proceedings of the 28th Annual Symposium on Foundations of Computer Science, SFCS 1987, pp. 427\u2013438. IEEE Computer Society (1987)","DOI":"10.1109\/SFCS.1987.4"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-540-79263-5_27","volume-title":"Topics in Cryptology \u2013 CT-RSA 2008","author":"K Gj\u00f8steen","year":"2008","unstructured":"Gj\u00f8steen, K.: A latency-free election scheme. In: Malkin, T. (ed.) CT-RSA 2008. LNCS, vol. 4964, pp. 425\u2013436. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79263-5_27"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the 19th Annual Symposium on Theory of Computing, STOC 1987, pp. 218\u2013229. ACM (1987)","DOI":"10.1145\/28395.28420"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-540-27809-2_10","volume-title":"Financial Cryptography","author":"J Groth","year":"2004","unstructured":"Groth, J.: Efficient maximal privacy in boardroom voting and anonymous broadcast. In: Juels, A. (ed.) FC 2004. LNCS, vol. 3110, pp. 90\u2013104. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27809-2_10"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-04904-0_28","volume-title":"Security Protocols","author":"F Hao","year":"2009","unstructured":"Hao, F., Zieli\u0144ski, P.: A 2-Round anonymous veto protocol. In: Christianson, B., Crispo, B., Malcolm, J.A., Roe, M. (eds.) Security Protocols 2006. LNCS, vol. 5087, pp. 202\u2013211. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04904-0_28"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-27954-6_4","volume-title":"Topics in Cryptology \u2013 CT-RSA 2012","author":"J Herranz","year":"2012","unstructured":"Herranz, J., Laguillaumie, F., Libert, B., R\u00e0fols, C.: Short attribute-based signatures for threshold predicates. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol. 7178, pp. 51\u201367. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27954-6_4"},{"key":"13_CR16","unstructured":"Khader, D., Smyth, B., Ryan, P.Y.A., Hao, F.: A fair and robust voting system by broadcast. In: Proceedings of the 5th International Conference on Electronic Voting, EVOTE 2012, pp. 285\u2013299. Gesellschaft f\u00fcr Informatik (2012)"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-45126-6_22","volume-title":"Financial Cryptography","author":"A Kiayias","year":"2003","unstructured":"Kiayias, A., Yung, M.: Non-interactive zero-sharing with applications to private distributed decision making. In: Wright, R.N. (ed.) FC 2003. LNCS, vol. 2742, pp. 303\u2013320. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45126-6_22"},{"issue":"2\u20133","key":"13_CR18","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s10623-015-0079-1","volume":"77","author":"B Libert","year":"2015","unstructured":"Libert, B., Peters, T., Joye, M., Yung, M.: Linearly homomorphic structure-preserving signatures and their applications. Des. Codes Crypt. 77(2\u20133), 441\u2013477 (2015)","journal-title":"Des. Codes Crypt."},{"issue":"11","key":"13_CR19","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23rd Symposium on Foundations of Computer Science, SFCS 1982, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35423-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:45:32Z","timestamp":1709833532000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35423-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030354220","9783030354237"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35423-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"19 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hyderabad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.isical.ac.in\/~indocrypt2019\/#\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"90","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.67","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Please note that there were 110 submissions, but 20 were not peer-reviewed because they were withdrawn before the deadline or they violated the submission policy.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}