Abstract
We introduce verifiable agreement as a fundamental service for securing mobile peer-to-peer ad hoc networks, and investigate its solvability. Verifiability of a protocol result means that the participants can prove that the protocol reached a particular result to any third party (the verifier) which was not present in the network at the time of the protocol execution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aboudagga, N., Refaei, M.T., Eltoweissy, M., DaSilva, L.A., Quisquater, J.-J.: Authentication protocols for ad hoc networks: taxonomy and research issues. In: Q2SWinet 2005: Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks, pp. 96–104. ACM Press, New York (2005)
Asokan, N., Baum-Waidner, B., Schunter, M., Waidner, M.: Optimistic synchronous multi-party contract signing. Technical Report Research Report RZ 3089, IBM Zurich Research Laboratory (1998)
Asokan, N., Ginzboorg, P.: Key-agreement in ad-hoc networks. Computer Communications 23(17), 1627–1637 (2000)
Augot, D., Bhaskar, R., Issarny, V., Sacchetti, D.: An efficient group key agreement protocol for ad hoc networks. In: First International IEEE WoWMoM Workshop on Trust, Security and Privacy for Ubiquitous Computing (2005)
Baum-Waidner, B., Waidner, M.: Round-optimal and abuse-free multi-party contract signing. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, Springer, Heidelberg (2000)
Ben-Or, M., Goldreich, O., Micali, S., Rivest, R.L.: A fair protocol for signing contracts. IEEE Transactions on Information Theory 36(1) (1990)
Blum, M.: Three applications of the oblivious transfer. Technical report, Department of EECS, University of California, Berkeley, CA (1981)
Bracha, G., Toueg, S.: Asynchronous consensus and broadcast protocols. J. ACM 32(4) (1985)
Fischer, M.J.: The consensus problem in unreliable distributed systems (a brief survey). In: Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory, London, UK, pp. 127–140. Springer, Heidelberg (1983)
Fitzi, M., Garay, J.A.: Efficient player-optimal protocols for strong and differential consensus. In: PODC 2003: Proceedings of the twenty-second annual symposium on Principles of distributed computing, pp. 211–220. ACM Press, New York (2003)
Garay, J.A., MacKenzie, P.D.: Abuse-free multi-party contract signing. In: Proceedings of the 13th International Symposium on Distributed Computing, London, UK, pp. 151–165. Springer, Heidelberg (1999)
Goldwasser, S.: Multi party computations: past and present. In: PODC 1997: Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, pp. 1–6. ACM Press, New York (1997)
Hirt, M., Maurer, U.: Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In: PODC 1997: Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, pp. 25–34. ACM Press, New York (1997)
Hubaux, J.-P., Buttyan, L., Capkun, S.: The quest for security in mobile ad hoc networks. In: MobiHoc 2001: Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing, pp. 146–155. ACM Press, New York (2001)
Kursawe, K.: Distributed Trust. PhD thesis, Department of Computer Science, Saarland University (2001)
Lamport, L.: The weak byzantine generals problem. J. ACM 30(3), 668–676 (1983)
Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382–401 (1982)
Liu, J., Sacchetti, D., Sailhan, F., Issarny, V.: Group management for mobile ad hoc networks: design, implementation and experiment. In: MDM 2005: Proceedings of the 6th international conference on Mobile data management, pp. 192–199. ACM Press, New York (2005)
Luo, J., Eugster, P.T., Hubaux, J.-P.: Pilot: Probabilistic lightweight group communication system for ad hoc networks. IEEE Transactions on Mobile Computing 3(2), 164–179 (2004)
Pease, M., Shostak, R., Lamport, L.: Reaching agreement in presense of faults. Journal of the ACM 27(2), 228–234 (1980)
Steiner, M., Tsudik, G., Waidner, M.: Key agreement in dynamic peer groups. IEEE Trans. Parallel Distrib. Syst. 11(8), 769–780 (2000)
Tang, L.: Verifiable transaction atomicity for electronic payment protocols. In: ICDCS 1996: Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS 1996), IEEE Computer Society, Washington (1996)
Zhou, J., Onieva, J., Lopez, J.: A synchronous multi-party contract signing protocol improving lower bound of steps. In: SEC 2006: 21st IFIP International Information Security Conference (May 2006)
Zhou, L., Haas, Z.J.: Securing ad hoc networks. IEEE Network 13(6), 24–30 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benenson, Z., Freiling, F.C., Pfitzmann, B., Rohner, C., Waidner, M. (2006). Verifiable Agreement: Limits of Non-repudiation in Mobile Peer-to-Peer Ad Hoc Networks. In: Buttyán, L., Gligor, V.D., Westhoff, D. (eds) Security and Privacy in Ad-Hoc and Sensor Networks. ESAS 2006. Lecture Notes in Computer Science, vol 4357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11964254_15
Download citation
DOI: https://doi.org/10.1007/11964254_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69172-3
Online ISBN: 978-3-540-69173-0
eBook Packages: Computer ScienceComputer Science (R0)