Sciweavers

48 search results - page 6 / 10
» A Public Key Encryption Scheme Secure against Key Dependent ...
Sort
View
DCC
2008
IEEE
14 years 7 months ago
Semantic security for the McEliece cryptosystem without random oracles
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 ...
Ryo Nojima, Hideki Imai, Kazukuni Kobara, Kirill M...
TCC
2009
Springer
153views Cryptology» more  TCC 2009»
14 years 8 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
TYPES
2004
Springer
14 years 24 days ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento
PKC
2009
Springer
102views Cryptology» more  PKC 2009»
14 years 8 months ago
A Practical Key Recovery Attack on Basic TCHo
TCHo is a public key encryption scheme based on a stream cipher component, which is particular suitable for low cost devices like RFIDs. In its basic version, TCHo offers no IND-CC...
Mathias Herrmann, Gregor Leander
JSS
2007
79views more  JSS 2007»
13 years 7 months ago
Security problems with improper implementations of improved FEA-M
This paper reports security problems with improper implementations of an improved version of FEA-M (fast encryption algorithm for multimedia). It is found that an implementation-d...
Shujun Li, Kwok-Tung Lo