{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,28]],"date-time":"2026-09-28T21:02:56Z","timestamp":1790629376790,"version":"4.1.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2010,9,30]],"date-time":"2010-09-30T00:00:00Z","timestamp":1285804800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s10207-010-0119-9","type":"journal-article","created":{"date-parts":[[2010,9,29]],"date-time":"2010-09-29T10:14:42Z","timestamp":1285755282000},"page":"371-385","source":"Crossref","is-referenced-by-count":132,"title":["A generalization of Paillier\u2019s public-key system with applications to electronic voting"],"prefix":"10.1007","volume":"9","author":[{"given":"Ivan","family":"Damg\u00e5rd","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mads","family":"Jurik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jesper Buus","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,9,30]]},"reference":[{"issue":"2","key":"119_CR1","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"Blum L., Blum M., Shub M.: A simple secure unpredictable pseudo-random number generator. SIAM J. Comput. 15(2), 364\u2013383 (1986)","journal-title":"SIAM J. Comput."},{"key":"119_CR2","doi-asserted-by":"crossref","unstructured":"Baudron, O., Fouque, P.-A., Pointcheval, D., Poupard, G., Stern, J.: Practical multi-candidate election scheme. In: Proceedings of PODC (2001)","DOI":"10.1145\/383962.384044"},{"key":"119_CR3","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.: Multiparty computation from threshold homomorphic encryption. In: Proceedings of EuroCrypt 2001, pp. 280\u2013300. Springer Verlag LNCS series 2045","DOI":"10.1007\/3-540-44987-6_18"},{"key":"119_CR4","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of partial knowledge. In: Proceedings of Crypto 94, pp. 174\u2013187. Springer Verlag LNCS series 839"},{"key":"119_CR5","doi-asserted-by":"crossref","unstructured":"Cramer, R., Dziembowski, S., Damg\u00e5rd, I., Hirt, M., Rabin, T.: Efficient multiparty computations secure against an adaptive adversary. In: Proceedings of EuroCrypt 99, pp. 311\u2013326. Springer Verlag LNCS series 1592","DOI":"10.1007\/3-540-48910-X_22"},{"key":"119_CR6","doi-asserted-by":"crossref","unstructured":"Catalano, D., Gennaro, R., Howgrave-Graham, N.: The bit security and Paillier\u2019s encryption scheme and its applications. In: Proceedings of EuroCrypt 2001, pp. 229\u2013243. Springer Verlag LNCS series 2045","DOI":"10.1007\/3-540-44987-6_15"},{"key":"119_CR7","doi-asserted-by":"crossref","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. In: Proceedings of EuroCrypt 97, pp. 103\u2013118. Springer Verlag LNCS series 1233","DOI":"10.1007\/3-540-69053-0_9"},{"key":"119_CR8","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: Proceedings of Public Key Cryptography 2001, pp. 119\u2013136. Springer Verlag LNCS series (1992)","DOI":"10.1007\/3-540-44586-2_9"},{"key":"119_CR9","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Koprowski, M.: Practical threshold RSA signatures without a trusted dealer. In: Proceedings of EuroCrypt 2001, pp. 152\u2013165. Springer Verlag LNCS series 2045","DOI":"10.1007\/3-540-44987-6_10"},{"key":"119_CR10","doi-asserted-by":"crossref","unstructured":"Fouque, P.-A., Poupard, G., Stern, J.: Sharing decryption in the context of voting or lotteries. In: Proceedings of Financial Crypto (2000)","DOI":"10.1007\/3-540-45472-1_7"},{"key":"119_CR11","unstructured":"Goldreich, O., Rosen, V.: On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators. Cryptology ePrint Archive, record 2000\/064, http:\/\/eprint.iacr.org\/ (2000, Dec)"},{"key":"119_CR12","doi-asserted-by":"crossref","unstructured":"Groth, J.: Extracting Witnesses from Proofs of Knowledge in the Random Oracle Model. Manuscript (2001, Dec), Eprint archive report nr. 2002\/002","DOI":"10.7146\/brics.v8i52.21713"},{"key":"119_CR13","doi-asserted-by":"crossref","unstructured":"Guillou, L., Quisquater, J.-J.: A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. In: Proceedings of EuroCrypt 88, pp. 123\u2013128. Springer Verlag LNCS series 330","DOI":"10.1007\/3-540-45961-8_11"},{"key":"119_CR14","doi-asserted-by":"crossref","unstructured":"Hirt, M., Sako, K.: Efficient receipt-free voting based on homomorphic encryption. In: Proceedings of EuroCrypt 2000, pp. 539\u2013556. Springer Verlag LNCS series 1807","DOI":"10.1007\/3-540-45539-6_38"},{"key":"119_CR15","unstructured":"Lipmaa, H., Asokan, N., Niemi, V.: Secure Vickrey Auctions without Threshold Trust. IACR Eprint archive, 2001\/95"},{"key":"119_CR16","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residue classes. In: Proceedings of EuroCrypt 99, pp. 223\u2013238. Springer Verlag LNCS series 1592","DOI":"10.1007\/3-540-48910-X_16"},{"key":"119_CR17","doi-asserted-by":"crossref","unstructured":"Shoup, V.: Practical threshold signatures. In: Proceedings of EuroCrypt 2000, pp. 207\u2013220. Springer Verlag LNCS series 1807","DOI":"10.1007\/3-540-45539-6_15"},{"key":"119_CR18","doi-asserted-by":"crossref","unstructured":"Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in a constant number of rounds. In: Proceedings of the ACM Symposium on Principles of Distributed Computation, pp. 201\u2013209 (1989)","DOI":"10.1145\/72981.72995"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-010-0119-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-010-0119-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-010-0119-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T00:14:22Z","timestamp":1559693662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-010-0119-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,30]]},"references-count":18,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["119"],"URL":"https:\/\/doi.org\/10.1007\/s10207-010-0119-9","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,30]]}}}