Sciweavers

49 search results - page 4 / 10
» A Feebly Secure Trapdoor Function
Sort
View
ICICS
2004
Springer
13 years 11 months ago
On the Minimal Assumptions of Group Signature Schemes
Abstract. One of the central lines of cryptographic research is identifying the weakest assumptions required for the construction of secure primitives. In the context of group sign...
Michel Abdalla, Bogdan Warinschi
FOCS
2010
IEEE
13 years 3 months ago
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
We construct the first general secure computation protocols that require no trusted infrastructure other than authenticated communication, and that satisfy a meaningful notion of s...
Ran Canetti, Huijia Lin, Rafael Pass
PKC
2005
Springer
192views Cryptology» more  PKC 2005»
13 years 11 months ago
Securing RSA-KEM via the AES
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...
Jakob Jonsson, Matthew J. B. Robshaw
TCC
2009
Springer
153views Cryptology» more  TCC 2009»
14 years 6 months ago
On the (Im)Possibility of Key Dependent Encryption
We study the possibility of constructing encryption schemes secure under messages that are chosen depending on the key k of the encryption scheme itself. We give the following sep...
Iftach Haitner, Thomas Holenstein
PKC
2004
Springer
195views Cryptology» more  PKC 2004»
13 years 11 months ago
An RSA Family of Trap-Door Permutations with a Common Domain and Its Applications
Abstract. Bellare, Boldyreva, Desai, and Pointcheval [1] recently proposed a new security requirement of the encryption schemes called “keyprivacy.” It asks that the encryption...
Ryotaro Hayashi, Tatsuaki Okamoto, Keisuke Tanaka