Skip to main content
SpringerLink
Log in
Book cover

International Conference on Financial Cryptography and Data Security

FC 2014: Financial Cryptography and Data Security pp 51–63Cite as

Hawk and Aucitas: e-Auction Schemes from the Helios and Civitas e-Voting Schemes

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 8437))

Abstract

The cryptographic foundations of e-auction and e-voting schemes are similar, for instance, seminal works in both domains have applied mixnets, homomorphic encryption, and trapdoor bit-commitments. However, these developments have appeared independently and the two research communities are disjoint. In this paper, we demonstrate a relation between e-auction and e-voting: we present Hawk and Aucitas, two e-auction schemes derived from the Helios and Civitas e-voting schemes. Our results make progress towards the unification of the e-auction and e-voting domains.

See [16] for the long version of this paper.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    A price ceiling – that is, an upper bound on the price that may be offered by bidders – is common in e-auctions.

  2. 2.

    Our implementation is available from the following URL: http://bensmyth.com/publications/2014-Hawk-and-Aucitas-auction-schemes/.

References

  1. Abe, M., Suzuki, K.: \(M\)+1-st price auction using homomorphic encryption. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 115–124. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Abe, M., Suzuki, K.: Receipt-free sealed-bid auction. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol. 2433, pp. 191–199. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Adida, B., Marneffe, O., Pereira, O., Quisquater, J.: Electing a university president using open-audit voting: analysis of real-world use of helios. In: EVT/WOTE’09: Electronic Voting Technology Workshop/Workshop on Trustworthy Elections, USENIX Association (2009)

    Google Scholar 

  4. Bernhard, D., Cortier, V., Pereira, O., Smyth, B., Warinschi, B.: Adapting helios for provable ballot privacy. In: Atluri, V., Diaz, C. (eds.) ESORICS 2011. LNCS, vol. 6879, pp. 335–354. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  5. Bernhard, D., Pereira, O., Warinschi, B.: How not to prove yourself: pitfalls of the fiat-shamir heuristic and applications to helios. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 626–643. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  6. Chen, X., Lee, B., Kim, K.: Receipt-free electronic auction schemes using homomorphic encryption. In: Lim, J.-I., Lee, D.-H. (eds.) ICISC 2003. LNCS, vol. 2971, pp. 259–273. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Clarkson, M.R., Chong, S., Myers, A.C.: Civitas: toward a secure voting system. In: S&P’08: 29th Security and Privacy Symposium, pp. 354–368. IEEE Computer Society (2008)

    Google Scholar 

  8. Damgård, I., Jurik, M., Nielsen, J.B.: A generalization of Paillier’s public-key system with applications to electronic voting. Int. J. Inf. Secur. 9(6), 371–385 (2010)

    Article  Google Scholar 

  9. 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)

    Chapter  Google Scholar 

  10. Her, Y.S., Imamoto, K., Sakurai, K.: Analysis and comparison of cryptographic techniques in e-voting and e-auction. Technical report 10(2), Information Science and Electrical Engineering, Kyushu University, September 2005

    Google Scholar 

  11. Jakobsson, M., Juels, A.: Mix and match: secure function evaluation via ciphertexts (Extended Abstract). In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 162–177. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Jakobsson, M., Juels, A., Rivest, R.L.: Making mix nets robust for electronic voting by randomized partial checking. In: 11th USENIX Security Symposium, pp. 339–353 (2002)

    Google Scholar 

  13. Juels, A., Catalano, D., Jakobsson, M.: Coercion-resistant electronic elections. In: Chaum, D., Jakobsson, M., Rivest, R.L., Ryan, P.Y.A., Benaloh, J., Kutylowski, M., Adida, B. (eds.) Towards Trustworthy Elections. LNCS, vol. 6000, pp. 37–63. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  14. Lipmaa, H., Asokan, N., Niemi, V.: Secure vickrey auctions without threshold trust. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 87–101. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  15. Magkos, E., Alexandris, N., Chrissikopoulos, V.: A common security model for conducting e-Auctions and e-Elections. In: CSCC’02: 6th WSEAS International Multiconference on Circuits, Systems, Communications and Computers (2002). http://www.wseas.us/e-library/conferences/crete2002/papers/444-766.pdf

  16. McCarthy, A., Smyth, B., Quaglia, E.A.: Hawk and Aucitas: e-auction schemes from the Helios and Civitas e-voting schemes (2014). http://bensmyth.com/publications/2014-Hawk-and-Aucitas-auction-schemes/

  17. Peng, K., Boyd, C., Dawson, E., Viswanathan, K.: Efficient implementation of relative bid privacy in sealed-bid auction. In: Chae, K.-J., Yung, M. (eds.) WISA 2003. LNCS, vol. 2908, pp. 244–256. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  18. Smyth, B., Bernhard, D.: Ballot secrecy and ballot independence coincide. In: Crampton, J., Jajodia, S., Mayes, K. (eds.) ESORICS 2013. LNCS, vol. 8134, pp. 463–480. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  19. Zhou, X., Zheng, H.: Breaking bidder collusion in large-scale spectrum auctions. In: MobiHoc’10: 11th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 121–130. ACM Press (2010)

    Google Scholar 

Download references

Acknowledgements

We are particularly grateful to Florian Kerschbaum and the anonymous reviewers who read earlier versions of this paper and provided useful guidance. This work has been partly supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC project CRYSP (259639), the ANR-09-VERS-016 BEST project, and Campus France.

Author information

Authors and Affiliations

  1. INRIA Paris-Rocquencourt, Paris, France

    Adam McCarthy & Ben Smyth

  2. ENS, Paris, France

    Elizabeth A. Quaglia

Authors
  1. Adam McCarthy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ben Smyth
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Elizabeth A. Quaglia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ben Smyth .

Editor information

Editors and Affiliations

  1. Carnegie Mellon University, Pittsburgh, Pennsylvania, USA

    Nicolas Christin

  2. University of Calgary, Calgary, Alberta, Canada

    Reihaneh Safavi-Naini

Rights and permissions

Reprints and permissions

Copyright information

© 2014 International Financial Cryptography Association

About this paper

Cite this paper

McCarthy, A., Smyth, B., Quaglia, E.A. (2014). Hawk and Aucitas: e-Auction Schemes from the Helios and Civitas e-Voting Schemes. In: Christin, N., Safavi-Naini, R. (eds) Financial Cryptography and Data Security. FC 2014. Lecture Notes in Computer Science(), vol 8437. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45472-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-45472-5_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-45471-8

  • Online ISBN: 978-3-662-45472-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation