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

Conference contribution


Publication Details

Author(s): Benenson Z, Freiling F, Pfitzmann B, Rohner C, Waidner M
Title edited volumes: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher: Springer-verlag
Publishing place: Hamburg
Publication year: 2006
Title of series: LNCS 4357
Conference Proceedings Title: ESAS (Security and Privacy in Ad-Hoc and Sensor Networks, Third European Workshop)
Pages range: 165-178
ISSN: 0302-9743


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.


FAU Authors / FAU Editors

Benenson, Zinaida Dr.
Lehrstuhl für Informatik 1 (IT-Sicherheitsinfrastrukturen)
Freiling, Felix Prof. Dr.-Ing.
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: 

Last updated on 2018-28-12 at 13:53

Share link