CTRSA
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In this paper, we first demonstrate a gap between the security of verifiably committed signatures in the two-party setting and the security of verifiably committed signat...
CTRSA
2006
Springer
13 years 8 months ago
2006
Springer
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...
CTRSA
2006
Springer
13 years 8 months ago
2006
Springer
Vaudenay recently proposed a message authentication protocol which is interactive and based on short authenticated strings (SAS). We study here SASbased non-interactive message aut...
CTRSA
2006
Springer
13 years 8 months ago
2006
Springer
This paper studies a new problem called fair identification: given two parties, how should they identify each other in a fair manner. More precisely, if both parties are honest the...
CTRSA
2006
Springer
13 years 8 months ago
2006
Springer
We describe several software side-channel attacks based on inter-process leakage through the state of the CPU's memory cache. This leakage reveals memory access patterns, whic...
CTRSA
2006
Springer
13 years 8 months ago
2006
Springer
The most important and expensive operation in a hyperelliptic curve cryptosystem (HECC) is scalar multiplication by an integer k, i.e., computing an integer k times a divisor D on ...
CTRSA
2006
Springer
13 years 8 months ago
2006
Springer
For years, the cryptographic community has searched for good nonlinear functions. Bent functions, almost perfect nonlinear functions, and similar constructions have been suggested ...
CTRSA
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In this paper we present a general framework for constructing efficient multicast cryptosystems with provable security and show that a line of previous work on multicast ...
CTRSA
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We present a non-interactive chosen ciphertext secure threshold encryption system. The proof of security is set in the standard model and does not use random oracles. Our...
CTRSA
2006
Springer
13 years 8 months ago
2006
Springer
In this paper we examine the strength of AES against the related-key impossible differential attack, following the work of Jakimoski and Desmedt [12]. We use several additional obs...