48 search results - page 10 / 10 » Merkle Puzzles are Optimal |
CRYPTO
2005
Springer
14 years 4 months ago
2005
Springer
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....
APPROX
2010
Springer
14 years 12 days ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
TBILLC
2005
Springer
14 years 4 months ago
2005
Springer
Case attraction has stood as a puzzling, and elusive, oddity of older Indo-European languages. This paper focuses on attraction in Ancient Greek, establishing both the regularity o...