157 search results - page 8 / 32 » Universally Composable Signcryption |
CSFW
2009
IEEE
14 years 2 months ago
2009
IEEE
For most basic cryptographic tasks, such as public key encryption, digital signatures, authentication, key exchange, and many other more sophisticated tasks, ideal functionalities...
PAIRING
2009
Springer
14 years 2 months ago
2009
Springer
CISIM
2007
IEEE
14 years 2 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...
CRYPTO
2007
Springer
14 years 1 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...
TAMC
2007
Springer
14 years 1 months ago
2007
Springer
