nach oben

Erschienen in:

2016 | OriginalPaper | Buchkapitel

On the Possibility of Non-interactive E-Voting in the Public-Key Setting

verfasst von : Rosario Giustolisi, Vincenzo Iovino, Peter B. Rønne

Erschienen in: Financial Cryptography and Data Security

Verlag: Springer Berlin Heidelberg

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

In 2010 Hao, Ryan and Zielinski proposed a simple decentralized e-voting protocol that only requires 2 rounds of communication. Thus, for k elections their protocol needs 2k rounds of communication. Observing that the first round of their protocol is aimed to establish the public-keys of the voters, we propose an extension of the protocol as a non-interactive e-voting scheme in the public-key setting (NIVS) in which the voters, after having published their public-keys, can use the corresponding secret-keys to participate in an arbitrary number of one-round elections.

We first construct a NIVS with a standard tally function where the number of votes for each candidate is counted.

Further, we present constructions for two alternative types of elections. Specifically in the first type (dead or alive elections) the tally shows if at least one voter cast a vote for the candidate. In the second one (elections by unanimity), the tally shows if all voters cast a vote for the candidate.

Our constructions are based on bilinear groups of prime order.

As definitional contribution we provide formal computational definitions for privacy and verifiability of NIVSs. We conclude by showing intriguing relations between our results, secure computation, electronic exams and conference management systems.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Vorheriges Kapitel Selene: Voting with Transparent Verifiability and Coercion-Mitigation

Nächstes Kapitel Efficiency Comparison of Various Approaches in E-Voting Protocols

In the following the term \(\mathbf {e}(g^{v_j},\mathsf {Hash}(\mathcal {I},\mathsf{id}))\) could be replaced without loss of generality by \(\mathbf {e}(g^{v_j},g)\).

For instance a value z splits two vectors \((x_1,x_2)\) and \((y_1,y_2)\) under a function f if \(f(x_1,z)\ne f(y_1,z)\) or \(f(z,x_2)\ne f(z,y_2)\). Two vectors are splittable if there exists a value z that splits them.

Precisely, whereas it would be difficult to find an input that splits the two challenge vectors under the functionality (as it accounts to forge a signature), such splitting inputs exist and thus the security of MIFE is vacuous.

In the sequel, we use the expression “all except negligible fraction of...” to mean that the statement holds for all except negligible fraction of the randomness values which the object is computed from. For instance, by “for all except negligible fraction of \((\mathsf{Pk}_i,\mathsf{Sk}_i)_{i\in [n]-\{j\}}\) such that for all \(i\in [n]-\{j\}\) \((\mathsf{Pk}_i,\mathsf{Sk}_i)\leftarrow \mathsf{KeyGen}(\mathsf{pp})\)...” we mean that for all except negligible fraction of the randomness values \(r\in \{0,1\}^\lambda \), for \((\mathsf{Pk}_i,\mathsf{Sk}_i)_{i\in [n]-\{j\}}\) such that for all \(i\in [n]-\{j\}\) \((\mathsf{Pk}_i,\mathsf{Sk}_i)\leftarrow \mathsf{KeyGen}(\mathsf{pp};r)\)...

Note that our definition of zero-knowledgeness is multi-theorem and adaptive like in [BFW15].

[BF01]

Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)CrossRef

[BFM88]

Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications (extended abstract). In: 20th Annual ACM Symposium on Theory of Computing, pp. 103–112. ACM Press (1988)

[BFW15]

Bernhard, D., Fischlin, M., Warinschi, B.: Adaptive proofs of knowledge in the random oracle model. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 629–649. Springer, Heidelberg (2015)

[BIPT11]

Braghin, S., Iovino, V., Persiano, G., Trombetta, A.: Secure and policy-private resource sharing in an online social network. In: PASSAT/SocialCom 2011, Privacy, Security, Risk and Trust (PASSAT), 2011 IEEE Third International Conference on and 2011 IEEE Third International Conference on Social Computing (SocialCom), Boston, MA, USA, 9–11 October 2011, pp. 872–875 (2011)

[Boy08]

Boyen, X.: The uber-assumption family. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 39–56. Springer, Heidelberg (2008)CrossRef

[BR93]

Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Ashby, V. (ed.) ACM CCS 93: 1st Conference on Computer and Communications Security, pp. 62–73. ACM Press, November 1993

[CDS94]

Cramer, R., Damgård, I.B., Schoenmakers, B.: Proof of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174–187. Springer, Heidelberg (1994)

[CI11]

De Caro, A., Iovino, V.: JPBC: Java pairing based cryptography. In: Proceedings of the 16th IEEE Symposium on Computers and Communications, ISCC 2011, Kerkyra, Corfu, Greece, June 28 - July 1, 2011, pp. 850–855 (2011)

[DH76]

Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644–654 (1976)MathSciNetCrossRefMATH

[FLS90]

Feige, U., Lapidot, D., Shamir, A.: Multiple non-interactive zero knowledge proofs based on a single random string (extended abstract). In: 31st Annual Symposium on Foundations of Computer Science, pp. 308–317. IEEE Computer Society Press, October 1990

[FS87]

Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)

[GGG+14]

Goldwasser, S., Gordon, S.D., Goyal, V., Jain, A., Katz, J., Liu, F.-H., Sahai, A., Shi, E., Zhou, H.-S.: Multi-input functional encryption. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 578–602. Springer, Heidelberg (2014)CrossRef

[GGHR14]

Garg, S., Gentry, C., Halevi, S., Raykova, M.: Two-round secure MPC from indistinguishability obfuscation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 74–94. Springer, Heidelberg (2014)CrossRef

[GIR15]

Giustolisi, R., Iovino, V., Rønne, P.B.: On the possibility of non-interactive e-voting in the public-key setting. Cryptology ePrint Archive, Report 2015/1119 (2015). http://eprint.iacr.org/

[Gol04]

Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)CrossRefMATH

[Hal]

Halevi, S.: Web submission and review softwares. http://people.csail.mit.edu/shaih/websubrev/

[HRZ10]

Hao, F., Ryan, P.Y.A., Zielinski, P.: Anonymous voting by two-round public discussion. IET Inf. Secur. 4(2), 62–67 (2010)CrossRef

[IZ15]

Iovino, V., Żebroski, K.: Simulation-based secure functional encryption in the random oracle model. In: Lauter, K., Rodríguez-Henríquez, F. (eds.) LatinCrypt 2015. LNCS, vol. 9230, pp. 21–39. Springer, Heidelberg (2015)CrossRef

[Jou04]

Joux, A.: A one round protocol for tripartite Diffie-Hellman. J. Cryptol. 17(4), 263–276 (2004)MathSciNetCrossRefMATH

[KSRH12]

Khader, D., Smyth, B., Ryan, P.Y.A., Hao, F.: A fair and robust voting system by broadcast. In: 5th International Conference on Electronic Voting 201, (EVOTE 2012), Co-organized by the Council of Europe, Gesellschaft für Informatik and E-Voting.CC, July 11–14, 2012, Castle Hofen, Bregenz, Austria, pp. 285–299 (2012)

[Lyn]

Lynn, B.: Pairing-based cryptography library. https://crypto.stanford.edu/pbc/

[MPR06]

Micali, S., Pass, R., Rosen, A.: Input-indistinguishable computation. In: 47th Annual Symposium on Foundations of Computer Science, pp. 367–378. IEEE Computer Society Press, October 2006

[Yao82]

Yao, A.C.: Protocols for secure computations (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, pp. 160–164. IEEE Computer Society Press, November 1982

Titel: On the Possibility of Non-interactive E-Voting in the Public-Key Setting
verfasst von: Rosario Giustolisi
Vincenzo Iovino
Peter B. Rønne
Verlag: Springer Berlin Heidelberg
Buch: Financial Cryptography and Data Security
Print ISBN: 978-3-662-53356-7

Electronic ISBN: 978-3-662-53357-4

Copyright-Jahr: 2016
DOI: https://doi.org/10.1007/978-3-662-53357-4_13

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"