Sciweavers

5374 search results - page 366 / 1075
» The induction of communication protocols
Sort
View
COMCOM
2008
80views more  COMCOM 2008»
15 years 7 months ago
Transforming general networks into feed-forward by using turn-prohibition
The issue of breaking cycles in communication networks is an important topic for several reasons. For instance, it is required when transparent bridges are filling the forwarding ...
Juan Echagüe, Jesús E. Villadangos, Vi...
APLAS
2010
ACM
15 years 7 months ago
Typechecking Higher-Order Security Libraries
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
Karthikeyan Bhargavan, Cédric Fournet, Nata...
PODC
2009
ACM
16 years 7 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
PERCOM
2007
ACM
16 years 6 months ago
Towards an Open Source Toolkit for Ubiquitous Device Authentication
Most authentication protocols designed for ubiquitous computing environments try to solve the problem of intuitive, scalable, secure authentication of wireless communication. Due ...
Rene Mayrhofer
ISW
2005
Springer
16 years 11 days ago
Constant Round Dynamic Group Key Agreement
We present a fully symmetric constant round authenticated group key agreement protocol in dynamic scenario. Our proposed scheme achieves forward secrecy and is provably secure und...
Ratna Dutta, Rana Barua