Sciweavers

135 search results - page 18 / 27
» Authentication and Key Agreement Protocols Preserving Anonym...
Sort
View
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
15 years 3 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
DAM
2006
97views more  DAM 2006»
14 years 11 months ago
Entity authentication schemes using braid word reduction
Abstract. Artin's braid groups currently provide a promising background for cryptographical applications, since the first cryptosystems using braids were introduced in [2, 3, ...
Hervé Sibert, Patrick Dehornoy, Marc Giraul...
SIGMOD
2004
ACM
133views Database» more  SIGMOD 2004»
15 years 12 months ago
Robust key establishment in sensor networks
Secure communication guaranteeing reliability, authenticity, and privacy in sensor networks with active adversaries is a challenging research problem since asymmetric key cryptosy...
Yongge Wang
SCN
2010
Springer
142views Communications» more  SCN 2010»
14 years 10 months ago
How to Pair with a Human
We introduce a protocol, that we call Human Key Agreement, that allows pairs of humans to establish a key in a (seemingly hopeless) case where no public-key infrastructure is avail...
Stefan Dziembowski
CRYPTO
2005
Springer
113views Cryptology» more  CRYPTO 2005»
15 years 5 months ago
Secure Communications over Insecure Channels Based on Short Authenticated Strings
Abstract. We propose a way to establish peer-to-peer authenticated communications over an insecure channel by using an extra channel which can authenticate very short strings, e.g....
Serge Vaudenay