209 search results - page 10 / 42 » Secure Hash-and-Sign Signatures Without the Random Oracle |
CRYPTO
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. The study of deterministic public-key encryption was initiated by Bellare et al. (CRYPTO '07), who provided the "strongest possible" notion of security for...
ACISP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Digital signatures are often proven to be secure in the random oracle model while hash functions deviate more and more from this idealization. Liskov proposed to model a ...
EUROCRYPT
2004
Springer
13 years 11 months ago
2004
Springer
An extended abstract of this paper appears in C. Cachin and J. Camenisch, editors, Advances in Cryptology-EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages 22...
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
In this paper, we formally prove that padding the plaintext with a random bit-string provides the semantic security against chosen plaintext attack (IND-CPA) for the McEliece (and ...
CANS
2009
Springer
13 years 5 months ago
2009
Springer
Group signatures allow users to anonymously sign messages in the name of a group. Membership revocation has always been a critical issue in such systems. In 2004, Boneh and Shacham...