155 search results - page 25 / 31 » Cryptographic Protocol Analysis of AN.ON |
160
click to vote
MYCRYPT
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we produce a practical and efficient algorithm to find a decomposition of type n = k i=1 2si 3ti , si, ti ∈ N ∪ {0} with k ≤ c + o(1) ¡ log n log log n ....
177
click to vote
CHES
2008
Springer
15 years 8 months ago
2008
Springer
Dynamically reconfigurable systems are known to have many advantages such as area and power reduction. The drawbacks of these systems are the reconfiguration delay and the overhead...
172
click to vote
CRYPTO
2005
Springer
15 years 11 months ago
2005
Springer
Anonymous channels are necessary for a multitude of privacy-protecting protocols. Onion routing is probably the best known way to achieve anonymity in practice. However, the crypto...
155
click to vote
SENSYS
2005
ACM
15 years 11 months ago
2005
ACM
Wireless sensor networks based on highly resource-constrained devices require symmetric cryptography in order to make them secure. Integral to this is the exchange of unique symme...
157
click to vote
ACNS
2005
Springer
15 years 11 months ago
2005
Springer
Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established prot...