Sciweavers

229 search results - page 11 / 46
» Agreements Without Disagreements
Sort
View
BMCBI
2005
97views more  BMCBI 2005»
13 years 9 months ago
Comparative mapping of sequence-based and structure-based protein domains
Background: Protein domains have long been an ill-defined concept in biology. They are generally described as autonomous folding units with evolutionary and functional independenc...
Ya Zhang, John-Marc Chandonia, Chris H. Q. Ding, S...
ICC
2009
IEEE
132views Communications» more  ICC 2009»
14 years 4 months ago
A Chaotic Maps-Based Key Agreement Protocol that Preserves User Anonymity
—A key agreement protocol is a protocol whereby two or more communicating parties can agree on a key or exchange information over an open communication network in such a way that...
Huei-Ru Tseng, Rong-Hong Jan, Wuu Yang
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
14 years 1 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
AMC
2005
172views more  AMC 2005»
13 years 9 months ago
An efficient nonce-based authentication scheme with key agreement
In this paper, we propose a cost effective mutual authentication scheme with key agreement using smart cards. Our scheme is motivated by the scheme design in two articles publishe...
Yen-Cheng Chen, Lo-Yao Yeh
TIT
2008
187views more  TIT 2008»
13 years 9 months ago
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
Stefan Dziembowski, Ueli M. Maurer