Sciweavers

252 search results - page 3 / 51
» How Secure is Deterministic Encryption
Sort
View
FSE
2008
Springer
110views Cryptology» more  FSE 2008»
13 years 9 months ago
How to Encrypt with a Malicious Random Number Generator
Chosen-plaintext attacks on private-key encryption schemes are currently modeled by giving an adversary access to an oracle that encrypts a given message m using random coins that ...
Seny Kamara, Jonathan Katz
PKC
1999
Springer
102views Cryptology» more  PKC 1999»
13 years 12 months ago
How to Enhance the Security of Public-Key Encryption at Minimum Cost
This paper presents a simple and efficient conversion from a semantically secure public-key encryption scheme against passive adversaries to a non-malleable (or semantically secure...
Eiichiro Fujisaki, Tatsuaki Okamoto
CCS
2011
ACM
12 years 7 months ago
How to break XML encryption
XML Encryption was standardized by W3C in 2002, and is implemented in XML frameworks of major commercial and open-source organizations like Apache, redhat, IBM, and Microsoft. It ...
Tibor Jager, Somorovsky Juraj
FSE
2004
Springer
167views Cryptology» more  FSE 2004»
14 years 1 months ago
Nonce-Based Symmetric Encryption
Symmetric encryption schemes are usually formalized so as to make the encryption operation a probabilistic or state-dependent function E of the message M and the key K: the user su...
Phillip Rogaway
CORR
2010
Springer
102views Education» more  CORR 2010»
13 years 7 months ago
How to prevent type-flaw and multi-protocol attacks on security protocols under Exclusive-OR
Type-flaw attacks and multi-protocol attacks on security protocols have been frequently reported in the literature. Heather et al. and Guttman et al. proved that these could be pr...
Sreekanth Malladi