CRYPTO
2006
Springer
14 years 3 months ago
2006
Springer
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
ISW
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. We present a universally composable time-stamping scheme based on universal one-way hash functions. The model we use contains an ideal auditing functionality (implementab...
CRYPTO
2007
Springer
14 years 5 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...