Sciweavers

328 search results - page 3 / 66
» Simple Termination Revisited
Sort
View
ASE
2005
96views more  ASE 2005»
13 years 5 months ago
A Termination Detection Protocol for Use in Mobile Ad Hoc Networks
As devices become smaller and wireless networking technologies improve, the popularity of mobile computing continues to rise. In today's world, many consider devices such as c...
Gruia-Catalin Roman, Jamie Payton
PODC
2009
ACM
14 years 6 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
TISSEC
2010
115views more  TISSEC 2010»
13 years 10 days ago
A Simple and Generic Construction of Authenticated Encryption with Associated Data
We revisit the problem of constructing a protocol for performing authenticated encryption with associated data (AEAD). A technique is described which combines a collision resistant...
Palash Sarkar
BIRTHDAY
2007
Springer
13 years 11 months ago
The Hydra Battle Revisited
Showing termination of the Battle of Hercules and Hydra is a challenge. We present the battle both as a rewrite system and as an arithmetic while program, provide proofs of their t...
Nachum Dershowitz, Georg Moser
APAL
2008
111views more  APAL 2008»
13 years 5 months ago
Cut elimination for a simple formulation of epsilon calculus
A simple cut elimination proof for arithmetic with epsilon symbol is used to establish termination of a modified epsilon substitution process. This opens a possibility of extensio...
Grigori Mints