Universally Composable Incoercibility

  • Dominique Unruh
  • Jörn Müller-Quade
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6223)


We present the UC/c framework, a general definition for secure and incoercible multi-party protocols. Our framework allows to model arbitrary reactive protocol tasks (by specifying an ideal functionality) and comes with a universal composition theorem. We show that given natural setup assumptions, we can construct incoercible two-party protocols realising arbitrary functionalities (with respect to static adversaries).


Incoercibility universal composability voting 


  1. 1.
    Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC 1988, pp. 1–10. ACM, New York (1988)CrossRefGoogle Scholar
  2. 2.
    Benaloh, J., Tuinstra, D.: Receipt-free secret-ballot elections (extended abstract). In: STOC 1994, pp. 544–553. ACM, New York (1994)CrossRefGoogle Scholar
  3. 3.
    Bohli, J.M., Müller-Quade, J., Röhrich, S.: Bingo voting: Secure and coercion-free voting using a trusted random number generator. In: Alkassar, A., Volkamer, M. (eds.) VOTE-ID 2007. LNCS, vol. 4896, pp. 111–124. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  4. 4.
    Canetti, R., Gennaro, R.: Incoercible multiparty computation. In: FOCS 1996, p. 504. IEEE, Los Alamitos (1996)Google Scholar
  5. 5.
    Canetti, R.: Security and composition of multi-party cryptographic protocols. Journal of Cryptology 3(1), 143–202 (2000)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS 2001, pp. 136–145. IEEE, Los Alamitos (2001); Full version is IACR ePrint 2000/067 Google Scholar
  7. 7.
    Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally composable security with global setup. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 61–85. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  8. 8.
    Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively secure multi-party computation. In: STOC 1995, pp. 639–648. ACM Press, New York (1995)Google Scholar
  9. 9.
    Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: STOC 2002, pp. 494–503. ACM, New York (2002)CrossRefGoogle Scholar
  10. 10.
    Chaum, D.: Secret-ballot receipts: True voter-verifiable elections. IEEE Security & Privacy 2(1), 38–47 (2004)CrossRefGoogle Scholar
  11. 11.
    Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols. In: STOC 1988, pp. 11–19. ACM Press, New York (1988)CrossRefGoogle Scholar
  12. 12.
    Chaum, D., Ryan, P.Y.A., Schneider, S.A.: A practical voter-verifiable election scheme. In: di Vimercati, S.d.C., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 118–139. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  13. 13.
    Delaune, S., Kremer, S., Ryan, M.D.: Verifying privacy-type properties of electronic voting protocols. Journal of Computer Security 17(4), 435–487 (2009)Google Scholar
  14. 14.
    Forsyth, F.: The Deceiver. Bantam Books (1991),
  15. 15.
    Goldreich, O.: Foundations of Cryptography (Basic Applications), vol. 2. Cambridge University Press, Cambridge (2004)zbMATHGoogle Scholar
  16. 16.
    Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC 1987, pp. 218–229 (1987)Google Scholar
  17. 17.
    Herzberg, A.: Rumpsession. Crypto 1991 (1991)Google Scholar
  18. 18.
    Hofheinz, D., Unruh, D., Müller-Quade, J.: Universally composable zero-knowledge arguments and commitments from signature cards. In: Tatra. Mt. Math. Pub., pp. 93–103 (2007)Google Scholar
  19. 19.
    Juels, A., Catalano, D., Jakobsson, M.: Coercion-resistant electronic elections. In: 4nd ACM Workshop on Privacy in the Electronic Society (WPES), pp. 61–70. ACM Press, New York (2005)Google Scholar
  20. 20.
    Moran, T., Naor, M.: Receipt-free universally-verifiable voting with everlasting privacy. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 373–392. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  21. 21.
    Unruh, D., Müller-Quade, J.: Universally composable incoercibility. IACR ePrint 2009/520 (October 2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Dominique Unruh
    • 1
  • Jörn Müller-Quade
    • 2
  1. 1.Saarland University 
  2. 2.Karlsruhe Institute of Technology (KIT) 

Personalised recommendations