Verifiable agreement: limits of non-repudiation in mobile peer-to-peer ad hoc networks

Authors:
Zinaida Benenson;Felix C. Freiling;Birgit Pfitzmann;Christian Rohner;Michael Waidner
Affiliations:
Department of Information Technology, Uppsala University;Computer Science Department, University of Mannheim;IBM Research, Zurich Research Lab;Department of Information Technology, Uppsala University;IBM Research, Zurich Research Lab
Venue:
ESAS'06 Proceedings of the Third European conference on Security and Privacy in Ad-Hoc and Sensor Networks
Year:
2006

Citing 19
Cited 0

Asynchronous consensus and broadcast protocols

Journal of the ACM (JACM)
Multi party computations: past and present

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
The Weak Byzantine Generals Problem

Journal of the ACM (JACM)
Key Agreement in Dynamic Peer Groups

IEEE Transactions on Parallel and Distributed Systems
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
The quest for security in mobile ad hoc networks

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Abuse-Free Multi-party Contract Signing

Proceedings of the 13th International Symposium on Distributed Computing
Round-Optimal and Abuse Free Optimistic Multi-party Contract Signing

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Consensus Problem in Unreliable Distributed Systems (A Brief Survey)

Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Verifiable transaction atomicity for electronic payment protocols

ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Efficient player-optimal protocols for strong and differential consensus

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Pilot: Probabilistic Lightweight Group Communication System for Ad Hoc Networks

IEEE Transactions on Mobile Computing
An Efficient Group Key Agreement Protocol for Ad Hoc Networks

WOWMOM '05 Proceedings of the First International IEEE WoWMoM Workshop on Trust, Security and Privacy for Ubiquitous Computing - Volume 03
Group management for mobile Ad Hoc networks: design, implementation and experiment

Proceedings of the 6th international conference on Mobile data management
Authentication protocols for ad hoc networks: taxonomy and research issues

Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks
Key agreement in ad hoc networks

Computer Communications
Securing ad hoc networks

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

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.