11 search results - page 1 / 3 » A Framework for Universally Composable Non-committing Blind ... |
ASIACRYPT
2009
Springer
13 years 11 months ago
2009
Springer
A universally composable (UC) blind signature functionality requres users to commit to the message to be blindly signed. It is thereby impossible to realize in the plain model. Th...
CRYPTO
2006
Springer
13 years 8 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, ...
IJACT
2008
13 years 4 months ago
2008
: Fair exchange protocols allow both or neither of two parties to obtain the other's items, and this property is essential in e-commerce. In this paper, we construct an optimi...
CISIM
2007
IEEE
13 years 11 months ago
2007
IEEE
The standard digital signature scheme can be easily subject to key exposure problem In order to overcome this problem; a feasible and effective approach is employed by key-evolving...
INDOCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
We propose a scheme for electronic cash based on symmetric primitives. The scheme is secure in the framework for universal composability assuming the existence of a symmetric CCA2-...