Advertisement

TallyNetworks: Protecting Your Private Opinions with Edge-Centric Computing

  • Marc Ruiz Rodríguez
  • Pedro García López
  • Marc Sánchez-Artigas
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10104)

Abstract

In this paper we claim that your private opinions cannot be controlled by a single centralized entity. Some examples of this are user participation in open polls or rating (stars, like/dislike) services and persons in a community. To this aim, we present TallyNetworks, an edge-centric distributed overlay that aims to provide end-to-end verifiability of online opinions by leveraging the computing resources (TallyBoxes) of users and third-party organizations.

Thanks to blind signatures, pseudonyms and anonymous channels, we ensure that the edge nodes (TallyBoxes) are blind and guarantee anonymity and privacy. Thanks to a one-hop structured overlay and a global membership protocol using redundant broadcasting and syncing, we ensure that messages reach all nodes in the network (integrity, robustness), and that vote information can be obtained and checked from different points (end-to-end verifiability).

Keywords

Distribute Hash Table Blind Signature Packet Loss Ratio Authenticator Server Broadcast Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

Acknowledgments

This work has been partly funded by the EU project IOStack (H2020-644182) and Spanish research project Cloud Services and Community Clouds (TIN2013-47245-C2-2-R) funded by the Ministry of Science and Innovation.

References

  1. 1.
    Maymounkov, P., Mazières, D.: Kademlia: a peer-to-peer information system based on the XOR metric. In: Druschel, P., Kaashoek, F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 53–65. Springer, Heidelberg (2002). doi: 10.1007/3-540-45748-8_5 CrossRefGoogle Scholar
  2. 2.
    Czirkos, Z., Hosszú, G.: Solution for the broadcasting in the Kademlia peer-to-peer overlay. Comput. Netw. 57(8), 1853–1862 (2013)CrossRefGoogle Scholar
  3. 3.
    Peris, A.D., Hernández, J.M., Huedo, E.: Evaluation of alternatives for the broadcast operation in Kademlia under churn. Peer-to-Peer Netw. Appl. 1–15 (2015)Google Scholar
  4. 4.
    Ramirez, E., et al.: Data Brokers: A call for Transparency and Accountability. Federal Trade Commission, US, May 2014Google Scholar
  5. 5.
    Peng, K.: An efficient shuffling based eVoting scheme. J. Syst. Softw. 84(6), 906–922 (2011)CrossRefGoogle Scholar
  6. 6.
    Chaum, D.: Blind Signatures for Untraceable Payments. Advances in Cryptology. Springer, US (1983)CrossRefzbMATHGoogle Scholar
  7. 7.
    Radwin, M.J., Klein, P.: An untraceable, universally verifiable voting scheme. In: Seminar in Cryptology (1995)Google Scholar
  8. 8.
    Mu, Y., Varadharajan, V.: Anonymous secure e-voting over a network. In: Proceedings of 14th Annual IEEE Computer Security Applications Conference (1998)Google Scholar
  9. 9.
    Sanchez-Artigas, M., et al.: p2pWeb: an open, decentralized infrastructure of Web servers for sharing ephemeral Web content. Comput. Netw. 54(12), 1968–1985 (2010)CrossRefzbMATHGoogle Scholar
  10. 10.
    Chaum, D.: Security without identification: transaction systems to make big brother obsolete. Commun. ACM 28(10), 1030–1044 (1985)CrossRefGoogle Scholar
  11. 11.
    Gupta, A., Liskov, B., Rodrigues, R.: One hop lookups for peer-to-peer overlays. In: HotOS (2003)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Marc Ruiz Rodríguez
    • 1
  • Pedro García López
    • 1
  • Marc Sánchez-Artigas
    • 1
  1. 1.Universitat Rovira i VirgiliTarragonaSpain

Personalised recommendations