{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:16:06Z","timestamp":1740287766902,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642145766"},{"type":"electronic","value":"9783642145773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14577-3_20","type":"book-chapter","created":{"date-parts":[[2010,7,16]],"date-time":"2010-07-16T08:11:34Z","timestamp":1279267894000},"page":"257-271","source":"Crossref","is-referenced-by-count":2,"title":["Tree-Homomorphic Encryption and Scalable Hierarchical Secret-Ballot Elections"],"prefix":"10.1007","author":[{"given":"Aggelos","family":"Kiayias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Baudron, O., Fouque, P.-A., Pointcheval, D., Poupard, G., Stern, J.: Practical Multi-Candidate Election system. In: The Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC (2001)","DOI":"10.1145\/383962.384044"},{"key":"20_CR2","unstructured":"Benaloh, J.: Verifiable Secret-Ballot Elections, PhD Thesis, Yale University (1987)"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Benaloh, J., Yung, M.: Distributing the Power of a Government to Enhance the Privacy of Voters. In: The Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC (1986)","DOI":"10.1145\/10590.10595"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Benaloh, J., Tuinstra, D.: Receipt-Free Secret-Ballot Elections. In: STOC 1994 (1994)","DOI":"10.1145\/195058.195407"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Cohen (Benaloh), J.D., Fischer, M.G.: A Robust and Verifiable Cryptographically Secure Election Scheme. In: FOCS 1985 (1985)","DOI":"10.1109\/SFCS.1985.2"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-69053-0_9","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"R. Cramer","year":"1997","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A Secure and Optimally Efficient Multi-Authority Election Scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 103\u2013118. Springer, Heidelberg (1997)"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"R. Cramer","year":"1994","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Schoenmakers, B.: Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 174\u2013187. Springer, Heidelberg (1994)"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-68339-9_7","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"R. Cramer","year":"1996","unstructured":"Cramer, R., Franklin, M.K., Qchoenmakers, B., Yung, M.: Multi-Autority Secret-Ballot Elections with Linear Work. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 72\u201383. Springer, Heidelberg (1996)"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Jurik, M.: A Generalisation, a Simplification and Some Applications of Paillier\u2019s Probabilistic Public-Key System. In: Public Key Cryptography 2001, pp. 169\u2013136 (2001)","DOI":"10.1007\/3-540-44586-2_9"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Jurik, M.: Client\/Server Tradeoffs for Online Elections. In: Public Key Cryptography 2002, pp. 125\u2013140 (2002)","DOI":"10.1007\/3-540-45664-3_9"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-45067-X_30","volume-title":"Information Security and Privacy","author":"I. Damg\u00e5rd","year":"2003","unstructured":"Damg\u00e5rd, I., Jurik, M.: A Length-Flexible Threshold Cryptosystem with Applications. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol.\u00a02727, pp. 350\u2013364. Springer, Heidelberg (2003)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"DeMillo, R.A., Lynch, N.A., Merritt, M.: Cryptographic Protocols. In: STOC 1982, pp. 383\u2013400 (1982)","DOI":"10.1145\/800070.802214"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"De Santis, A., Di Crescenzo, G., Persiano, G., Yung, M.: On Monotone Formula Closure of SZK. In: FOCS 1994 (1994)","DOI":"10.1109\/SFCS.1994.365745"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Fouque, P.-A., Poupard, G., Stern, J.: Sharing Decryption in the Context of Voting or Lotteries. In: The Proceedings of Financial Cryptography 2000 (2000)","DOI":"10.1007\/3-540-45472-1_7"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Frankel, Y., Gemmell, P., Yung, M.: Witness-Based Cryptographic Program Checking and Robust Function Sharing. In: STOC 1996 (1996)","DOI":"10.1145\/237814.237998"},{"key":"20_CR17","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure Distributed Key Generation for Discrete-Log Based Cryptosystems. In: Eurocrypt 1991 (1991)"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Groth, J.: Efficient Maximal Privacy in Boardroom Voting and Anonymous Broadcast. In: Financial Cryptography 2004, pp. 90\u2013104 (2004)","DOI":"10.1007\/978-3-540-27809-2_10"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Yung, M.: Self-Tallying Elections and Perfect Ballot Secrecy. In: Proceedings of Public Key Cryptography 2002 (2002)","DOI":"10.1007\/3-540-45664-3_10"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Yung, M.: The Vector Ballot e-Voting Approach. In: Financial Cryptography 2004, pp. 72\u201389 (2004)","DOI":"10.1007\/978-3-540-27809-2_9"},{"key":"20_CR21","unstructured":"Merrit, M.: Cryptographic Protocols, Ph.D. Thesis, Georgia Institute of Technology (1983)"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Okamoto, T.: Receipt-Free Electronic Voting Schemes for Large Scale Elections. In: Workshop on Security Protocols (1997)","DOI":"10.1007\/BFb0028157"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks. In: The Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), vol.\u00a01291, pp. 51\u201321","DOI":"10.1145\/112600.112605"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, p. 223. Springer, Heidelberg (1999)"},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"T.P. Pedersen","year":"1991","unstructured":"Pedersen, T.P.: A threshold Cryptosystem without a Trusted Third Party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 522\u2013526. Springer, Heidelberg (1991)"},{"key":"20_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/3-540-49264-X_32","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"K. Sako","year":"1995","unstructured":"Sako, K., Kilian, J.: Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 393\u2013403. Springer, Heidelberg (1995)"},{"key":"20_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/3-540-48405-1_10","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"B. Schoenmakers","year":"1999","unstructured":"Schoenmakers, B.: A Simple Publicly Verifiable Secret Sharing Scheme and its Applications to Electronic Voting. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, p. 148. Springer, Heidelberg (1999)"},{"key":"20_CR28","first-page":"240","volume-title":"Proc. Symp. Pure Math.","author":"D. Shanks","year":"1971","unstructured":"Shanks, D.: Class number, a theory of factorization and genera. In: Proc. Symp. Pure Math., vol.\u00a050, pp. 240\u2013415. AMS, Providence (1971)"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Tsiounis, Y., Yung, M.: On the Security of ElGamal Based Encryption. In: Public Key Cryptography (1998)","DOI":"10.1007\/BFb0054019"},{"key":"20_CR30","unstructured":"Yung, M.: Tree-Homomorphic Encryption. In: DIMACS Workshop on Electronic Voting \u2013 Theory and Practice (2004)"}],"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-642-14577-3_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T23:49:20Z","timestamp":1740268160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14577-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145766","9783642145773"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14577-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}