APPLICABILITY OF MULTIPARTY COMPUTATION SCHEMES FORWIRELESS SENSOR NETWORKS - Position Paper

Manuel Koschuch, Matthias Hudler, Michael Krüger, Peter Lory, Jürgen Wenzl

2010

Abstract

Wireless Sensor Networks pose special requirements to the deployed security algorithms, due to their unique properties: a single sensor node has great restrictions in terms of computing power, available memory and available energy. It is nevertheless desirable for the messages exchanged over the air interface to be secure against eavesdropping and forging. Since a single sensor node can be captured and removed very easily and almost undetectable, cryptographic schemes that do not rely on a single master secret present in every node, like those based on, for example, multiparty computations, seem to be a promising alternative in this setting. We are currently investigating the applicability of a modified implementation of the Gennaro-Rabin-Rabin multiparty multiplication protocol for sensor networks, with a special focus on the number of messages that have to be exchanged and the additional load put on every node by this protocol. This paper gives a short overview of our work and lists some preliminary results.

References

  1. Cramer, R. and Damga°rd, I. (2005). Multiparty computation, an introduction. In Catalano, D., Cramer, R., Damga°rd, I., Di Crescenco, G., Pointcheval, D., and Takagi, T., editors, Contemporary Cryptology, Advanced Courses in Mathematics CRM Barcelona, pages 41-87. Birkhäuser, Basel.
  2. Gennaro, R., Rabin, M. O., and Rabin, T. (1998). Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In Proceedings of the 17th ACM Symposium on Principles of Distributed Computing (PODC'98).
  3. Knuth, D. (1998). The Art of Computer Programming, volume 2. Addison-Wesley, Reading.
  4. Lory, P. (2007). Reducing the complexity in the distributed multiplication protocol of two polynomially shared values. In Proceedings of the 21st International Conference on Advanced Information Networking and Applications (AINA'2007), volume 1, pages 404-408. IEEE Computer Society.
  5. Lory, P. (2009). Secure distributed multiplication of two polynomially shared values: Enhancing the efficiency of the protocol. In Proceedings of the Third International Conference on Emerging Security Information, Systems and Technologies (SECURWARE 2009), pages 486-491. IEEE Computer Society.
  6. Merwe, J. V. D., Dawoud, D., and McDonald, S. (2007). A survey on peer-to-peer key management for mobile ad hoc networks. ACM Computing Surveys (CSUR), 39(1):1-45.
  7. Shamir, A. (1979). How to share a secret. Communications of the ACM, 22(11):612-613.
  8. Wenzl, J. (2010). Laufzeitanalyse dreier Versionen eines Mehrparteien-Multiplikationsprotokolls. Regensburger Diskussionsbeiträge zur Wirtschaftswissenschaft 440, Institut für Wirtschaftsinformatik, Universität Regensburg.
Download


Paper Citation


in Harvard Style

Koschuch M., Hudler M., Krüger M., Lory P. and Wenzl J. (2010). APPLICABILITY OF MULTIPARTY COMPUTATION SCHEMES FORWIRELESS SENSOR NETWORKS - Position Paper . In Proceedings of the International Conference on Data Communication Networking and Optical Communication Systems - Volume 1: DCNET, (ICETE 2010) ISBN 978-989-8425-25-6, pages 125-128. DOI: 10.5220/0003032901250128


in Bibtex Style

@conference{dcnet10,
author={Manuel Koschuch and Matthias Hudler and Michael Krüger and Peter Lory and Jürgen Wenzl},
title={APPLICABILITY OF MULTIPARTY COMPUTATION SCHEMES FORWIRELESS SENSOR NETWORKS - Position Paper},
booktitle={Proceedings of the International Conference on Data Communication Networking and Optical Communication Systems - Volume 1: DCNET, (ICETE 2010)},
year={2010},
pages={125-128},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003032901250128},
isbn={978-989-8425-25-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Data Communication Networking and Optical Communication Systems - Volume 1: DCNET, (ICETE 2010)
TI - APPLICABILITY OF MULTIPARTY COMPUTATION SCHEMES FORWIRELESS SENSOR NETWORKS - Position Paper
SN - 978-989-8425-25-6
AU - Koschuch M.
AU - Hudler M.
AU - Krüger M.
AU - Lory P.
AU - Wenzl J.
PY - 2010
SP - 125
EP - 128
DO - 10.5220/0003032901250128