128
click to vote
CTRSA
2006
Springer
15 years 7 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...
117
click to vote
CTRSA
2006
Springer
15 years 7 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...
107
click to vote
CTRSA
2006
Springer
15 years 7 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...
132
click to vote
CTRSA
2006
Springer
15 years 7 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...
169
click to vote
CTRSA
2006
Springer
15 years 7 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 ...