Sciweavers

362 search results - page 28 / 73
» Abstraction in Cryptography
Sort
View
ACNS
2009
Springer
162views Cryptology» more  ACNS 2009»
14 years 4 months ago
Secure Hamming Distance Based Computation and Its Applications
Abstract. This paper examines secure two-party computation of functions which depend only on the Hamming distance of the inputs of the two parties. We present efficient protocols f...
Ayman Jarrous, Benny Pinkas
CSR
2009
Springer
14 years 4 months ago
A Feebly Secure Trapdoor Function
Abstract. In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are pro...
Edward A. Hirsch, Sergey I. Nikolenko
FC
2009
Springer
93views Cryptology» more  FC 2009»
14 years 4 months ago
Detecting Denial of Service Attacks in Tor
Abstract. Tor is currently one of the more popular systems for anonymizing near real-time communications on the Internet. Recently, Borisov et al. proposed a denial of service base...
Norman Danner, Danny Krizanc, Marc Liberatore
IMA
2009
Springer
113views Cryptology» more  IMA 2009»
14 years 4 months ago
On Linear Cryptanalysis with Many Linear Approximations
Abstract. In this paper we present a theoretical framework to quantify the information brought by several linear approximations of a blockcipher without putting any restriction on ...
Benoît Gérard, Jean-Pierre Tillich
SACRYPT
2009
Springer
162views Cryptology» more  SACRYPT 2009»
14 years 4 months ago
Practical Pseudo-collisions for Hash Functions ARIRANG-224/384
Abstract. In this paper we analyse the security of the SHA-3 candidate ARIRANG. We show that bitwise complementation of whole registers turns out to be very useful for constructing...
Jian Guo, Krystian Matusiewicz, Lars R. Knudsen, S...