255 search results - page 30 / 51 » Security of Encryption Schemes in Weakened Random Oracle Mod... |
108
click to vote
CRYPTO
2004
Springer
15 years 7 months ago
2004
Springer
Ordinarily, RSA and Rabin ciphertexts and signatures are log N bits, where N is a composite modulus; here, we describe how to “compress” Rabin ciphertexts and signatures (among...
102
Voted
CRYPTO
2001
Springer
15 years 6 months ago
2001
Springer
We propose the first forward-secure signature scheme for which both signing and verifying are as efficient as for one of the most efficient ordinary signature schemes (Guillou-Qui...
87
Voted
CRYPTO
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. The Full Domain Hash (FDH) scheme is a RSA-based signature scheme in which the message is hashed onto the full domain of the RSA function. The FDH scheme is provably secu...
104
Voted
CCS
2006
ACM
15 years 5 months ago
2006
ACM
We extend the definitional work of Dwork, Naor and Sahai from deniable authentication to deniable key-exchange protocols. We then use these definitions to prove the deniability fe...
119
Voted
PKC
2005
Springer
15 years 7 months ago
2005
Springer
RSA-KEM is a popular key encapsulation mechanism that combines the RSA trapdoor permutation with a key derivation function (KDF). Often the details of the KDF are viewed as orthogo...