133
click to vote
ASIACRYPT
2006
Springer
15 years 7 months ago
2006
Springer
There have been active discussions on how to derive a consistent cryptographic key from noisy data such as biometric templates, with the help of some extra information called a ske...
139
click to vote
ASIACRYPT
2006
Springer
15 years 7 months ago
2006
Springer
We consider the problem of cheating in secret sharing schemes, cheating in which individuals submit forged shares in the secret reconstruction phase in an effort to make another pa...
121
click to vote
ASIACRYPT
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. To prove or disprove the computational equivalence of solving the RSA problem and factoring integers is a longstanding open problem in cryptography. This paper provides s...
142
click to vote
ASIACRYPT
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we propose a new approach for constructing selectively convertible undeniable signature schemes, and present two efficient schemes based on RSA. Our approach allows ...