{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T21:24:06Z","timestamp":1791321846255,"version":"4.3.1"},"reference-count":38,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"vor","delay-in-days":4029,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Trans Emerging Tel Tech"],"published-print":{"date-parts":[[1997,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper we present a new multi\u2010authority secret\u2010ballot election scheme that guarantees privacy, universal veriability, and robustness. It is the first scheme for which the performance is optimal in the sense that time and communication complexity is minimal both for the individual voters and the authorities. An interesting property of the scheme is that the t and communication complexity for the voter is <jats:italic>independent<\/jats:italic> of the number of authorities. A voter simply posts a <jats:italic>single<\/jats:italic> encrypted message accompanied by a compact proof that it contains a valid vote. Our result is complementary to the result by Cramer, Franklin, Schoenmakers, and Yung in the sense that in their scheme the work for voters is linear in the number of authorities but can be instantiated to yield information\u2010theoretic privacy, while in our scheme the voter's effort is independent of the number of authorities but always provides computational privacy\u2010protection. We will also point out that the majority proposed voting schemes provide computational privacy only (often without even considering the lack of information\u2010theoretic privacy), and that our new scheme is by far superior to those schemes.<\/jats:p>","DOI":"10.1002\/ett.4460080506","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T12:23:18Z","timestamp":1221222198000},"page":"481-490","source":"Crossref","is-referenced-by-count":221,"title":["A secure and optimally efficient multi\u2010authority election scheme"],"prefix":"10.1002","volume":"8","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rosario","family":"Gennaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Berry","family":"Schoenmakers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":"J.Cohen M.Fischer:A robust and verifiable cryptographically secure election scheme. In Proc. 26\u2010th IEEE Symposium on Foundations of Computer Science (FOCS \u203285). IEEE Computer Society 1985 p.372\u2013382.","DOI":"10.1109\/SFCS.1985.2"},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"J.Benaloh M.Yung:Distributing the power of a government to enhance the privacy of voters. In Proc. 5\u2010th ACM Symposium on Principles of Distributed Computing (PODC \u203286) New York 1986. A.C.M. p.52\u201362.","DOI":"10.1145\/10590.10595"},{"key":"e_1_2_1_4_2","unstructured":"J.Benaloh:Verifiable secret\u2010ballot elections. PhD thesis Yale University Department of Computer Science Department New Haven CT September1987."},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","unstructured":"J.Benaloh D.Tuinstra:Receipt\u2010free secret\u2010ballot elections. In Proc. 26\u2010th Symposium on Theory of Computing (STOC \u203294) New York 1994. A.C.M. p.544\u2013553.","DOI":"10.1145\/195058.195407"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"K.Sako J.Kilian:Receipt\u2010free mix\u2010type voting scheme\u2010a practical solution to the implementation of a voting booth. In Advances in Cryptology\u2010EUROCRYPT \u203295 Vol. 921 of Lecture Notes in Computer Science Berlin. Springer\u2010Verlag 1995 p.393\u2013403.","DOI":"10.1007\/3-540-49264-X_32"},{"key":"e_1_2_1_8_2","volume-title":"Unconditionally untraceable and fault\u2010tolerant broadcast and secret ballot election","author":"Pfitzmann B.","year":"1992"},{"key":"e_1_2_1_9_2","first-page":"72","volume-title":"Advances in Cryptology EUROCRYPT \u203296 of Lecture Notes in Computer Science","author":"Cramer R.","year":"1996"},{"key":"e_1_2_1_10_2","first-page":"174","volume-title":"Advances in Cryptology\u2010CRYPTO \u203294 of Lecture Notes in Computer Science","author":"Cramer R.","year":"1994"},{"key":"e_1_2_1_11_2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BFb0053433","volume-title":"Advances in Cryptology EUROCRYPT \u203294 of Lecture Notes in Computer Science","author":"Chen L.","year":"1995"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460050407"},{"key":"e_1_2_1_13_2","unstructured":"A.Herzberg M.Jakobsson S.Jarecki H.Krawczyk M.Yung:Proactive public\u2010key and signature schemes 1995. Manuscript."},{"key":"e_1_2_1_14_2","first-page":"141","volume-title":"Advances in Cryptology\u2010ASIACRYPT \u203294 of Lecture Notes in Computer Science","author":"Niemi V.","year":"1994"},{"key":"e_1_2_1_15_2","unstructured":"R.Canetti R.Gennaro:Incoercible multiparty computation. In 37\u2010th IEEE Symposium on Foundations of Computer Science (FOCS' 96) 1996. To appear."},{"key":"e_1_2_1_16_2","doi-asserted-by":"crossref","unstructured":"M.Reiter:Secure agreement protocols: Reliable and atomic group multicast in Rampart. 2\u2010nd ACM Conference on Computer and Communications Security Fairfax November1994.","DOI":"10.1145\/191177.191194"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60042-6_7"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057074"},{"key":"e_1_2_1_20_2","first-page":"522","volume-title":"Advances in Cryptology\u2010EUROCRYPT \u203291 of Lecture Notes in Computer Science","author":"Pedersen T.","year":"1991"},{"key":"e_1_2_1_21_2","doi-asserted-by":"crossref","unstructured":"T. P.Pedersen:Distributed Provers and Verifiable Secret Sharing Based on the Discrete Logarithm Problem. PhD thesis Aarhus University Computer Science Department Aarhus Denmark March1992.","DOI":"10.7146\/dpb.v21i388.6621"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_2_1_23_2","first-page":"89","volume-title":"Advances in Cryptology\u2010CRYPTO \u203292 of Lecture Notes in Computer Science","author":"Chaum D.","year":"1993"},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196725"},{"key":"e_1_2_1_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90042-9"},{"key":"e_1_2_1_26_2","first-page":"186","volume-title":"Advances in Cryptology\u2010CRYPTO \u203286 of Lecture Notes in Computer Science","author":"Fiat A.","year":"1987"},{"key":"e_1_2_1_27_2","first-page":"127","volume-title":"Advances in Cryptology\u2010EUROCRYPT \u203287 of Lecture Notes in Computer Science","author":"Chaum D.","year":"1988"},{"key":"e_1_2_1_28_2","first-page":"458","volume-title":"Advances in Cryptology\u2010EUROCRYPT \u203290 of Lecture Notes in Computer Science","author":"Chaum D.","year":"1991"},{"key":"e_1_2_1_29_2","first-page":"189","volume-title":"Advances in Cryptology\u2010CRYPTO \u203290 of Lecture Notes in Computer Science","author":"Boyar J.","year":"1991"},{"key":"e_1_2_1_30_2","first-page":"411","volume-title":"Advances in Cryptology\u2010CRYPTO \u203294 of Lecture Notes in Computer Science","author":"Sako K.","year":"1994"},{"key":"e_1_2_1_31_2","doi-asserted-by":"crossref","unstructured":"R.Gennaro:Achieving independence efficiently and securely. In Proc. 14\u2010th ACM Symposium on Principles of Distributed Computing (PODC \u203295) New York 1995. A.C.M.","DOI":"10.1145\/224964.224979"},{"key":"e_1_2_1_32_2","first-page":"673","volume-title":"Handbook of Theoretical Computer Science","author":"Lenstra A. K.","year":"1990"},{"key":"e_1_2_1_33_2","first-page":"157","volume-title":"Advances in Cryptology\u2010CRYPTO \u203296 of Lecture Notes in Computer Science","author":"Gennaro R.","year":"1996"},{"key":"e_1_2_1_34_2","doi-asserted-by":"crossref","unstructured":"R.Canetti C.Dwork M.Naor R.Ostrovsky:Deniable encryption 1996. Manuscript.","DOI":"10.1007\/BFb0052229"},{"key":"e_1_2_1_35_2","first-page":"339","volume-title":"Advances in Cryptology\u2010CRYPTO \u203295 of Lecture Notes in Computer Science","author":"Herzberg A.","year":"1995"},{"key":"e_1_2_1_36_2","doi-asserted-by":"crossref","unstructured":"Y.Frankel P.Gemmell P.McKenzie M.Yung:Proactive RSA 1996. Manuscript.","DOI":"10.1007\/BFb0052254"},{"key":"e_1_2_1_37_2","first-page":"248","volume-title":"Advances in Cryptology\u2010EUROCRYPT \u203293 of Lecture Notes in Computer Science","author":"Park C.","year":"1994"},{"key":"e_1_2_1_38_2","first-page":"332","volume-title":"Advances in Cryptology\u2010EUROCRYPT \u203294 of Lecture Notes in Computer Science","author":"Pfitzmann B.","year":"1995"},{"key":"e_1_2_1_39_2","first-page":"125","volume-title":"Advances in Cryptology\u2010ASIACRYPT \u203294 of Lecture Notes in Computer Science","author":"Michels M.","year":"1996"}],"container-title":["European Transactions on Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fett.4460080506","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/ett.4460080506","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T07:50:26Z","timestamp":1698479426000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/ett.4460080506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":38,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["10.1002\/ett.4460080506"],"URL":"https:\/\/doi.org\/10.1002\/ett.4460080506","archive":["Portico"],"relation":{},"ISSN":["1124-318X","1541-8251"],"issn-type":[{"value":"1124-318X","type":"print"},{"value":"1541-8251","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}