Sciweavers

20813 search results - page 3918 / 4163
» Introduction to Computer Networking
Sort
View
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
15 years 10 months ago
On Expected Constant-Round Protocols for Byzantine Agreement
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
Jonathan Katz, Chiu-Yuen Koo
DSD
2006
IEEE
98views Hardware» more  DSD 2006»
15 years 10 months ago
Profiling Bluetooth and Linux on the Xilinx Virtex II Pro
In this paper, we present profiling results of the Bluetooth standard implemented on the Xilinx Virtex II Pro device. The investigation is performed in two stages. First, we solel...
Filipa Duarte, Stephan Wong
ECML
2006
Springer
15 years 10 months ago
Deconvolutive Clustering of Markov States
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
Ata Kabán, Xin Wang
EUROPKI
2006
Springer
15 years 10 months ago
On the Resilience of Key Agreement Protocols to Key Compromise Impersonation
Abstract. Key agreement protocols are a fundamental building block for ensuring authenticated and private communications between two parties over an insecure network. This paper fo...
Maurizio Adriano Strangio
FC
2006
Springer
109views Cryptology» more  FC 2006»
15 years 10 months ago
A Private Stable Matching Algorithm
Existing stable matching algorithms reveal the preferences of all participants, as well as the history of matches made and broken in the course of computing a stable match. This in...
Philippe Golle
« Prev « First page 3918 / 4163 Last » Next »