Verifiable Agreement: Limits of Non-repudiation in Mobile Peer-to-Peer Ad Hoc Networks

Benenson Z, Freiling F, Pfitzmann B, Rohner C, Waidner M (2006)

Publication Type: Conference contribution

Publication year: 2006

Journal

Lecture Notes in Computer Science Springer Verlag

Publisher: Springer-verlag

Edited Volumes: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Series: LNCS 4357

City/Town: Hamburg

Pages Range: 165-178

Conference Proceedings Title: ESAS (Security and Privacy in Ad-Hoc and Sensor Networks, Third European Workshop)

Event location: Hamburg

DOI: 10.1007/11964254_15

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. © 2006 Springer-Verlag Berlin Heidelberg.

Authors with CRIS profile

Zinaida Benenson Lehrstuhl für Informatik 1 (IT-Sicherheitsinfrastrukturen) Felix Freiling Lehrstuhl für Informatik 1 (IT-Sicherheitsinfrastrukturen)

How to cite

APA:

Benenson, Z., Freiling, F., Pfitzmann, B., Rohner, C., & Waidner, M. (2006). Verifiable Agreement: Limits of Non-repudiation in Mobile Peer-to-Peer Ad Hoc Networks. In ESAS (Security and Privacy in Ad-Hoc and Sensor Networks, Third European Workshop) (pp. 165-178). Hamburg: Hamburg: Springer-verlag.

MLA:

Benenson, Zinaida, et al. "Verifiable Agreement: Limits of Non-repudiation in Mobile Peer-to-Peer Ad Hoc Networks." Proceedings of the 3rd European Workshop on Security and Privacy in Ad Hoc and Sensor Networks, ESAS 2006, Hamburg Hamburg: Springer-verlag, 2006. 165-178.

BibTeX: Download