FC
2010
Springer
14 years 15 days ago
2010
Springer
FC
2010
Springer
14 years 15 days ago
2010
Springer
Abstract. Distributed anonymous communication networks like Tor depend on volunteers to donate their resources. However, the efforts of Tor volunteers have not grown as fast as th...
FC
2010
Springer
14 years 15 days ago
2010
Springer
We present a new construction of divisible e-cash that makes use of 1) a new generation method of the binary tree of keys; 2) a new way of using bounded accumulators. The transacti...
FC
2010
Springer
14 years 15 days ago
2010
Springer
FC
2010
Springer
14 years 15 days ago
2010
Springer
We describe a method for identifying “typosquatting”, the intentional registration of misspellings of popular website addresses. We estimate that at least 938 000 typosquatting...
FC
2010
Springer
14 years 15 days ago
2010
Springer
—This paper discusses public-key authenticated key agreement protocols. First, we critically analyze several authenticated key agreement protocols and uncover various theoretical...
CRYPTO
2009
Springer
14 years 16 days ago
2009
Springer
The round complexity of interactive protocols is one of their most important complexity measures. In this work we prove that existing lower bounds for the round complexity of VSS c...
CTRSA
2007
Springer
14 years 16 days ago
2007
Springer
Privacy concerns in many aspects of electronic communication trigger the need to re-examine
CTRSA
2007
Springer
14 years 16 days ago
2007
Springer
Abstract. The task of developing protocols for humans to securely authenticate themselves to a remote server has been an interesting topic in cryptography as a replacement for the ...
CTRSA
2007
Springer
14 years 16 days ago
2007
Springer
At Financial Crypto 2006, Golle presented a novel framework for the privacy preserving computation of a stable matching (stable marriage). We show that the communication complexity...