Sciweavers

252 search results - page 2 / 51
» How Secure is Deterministic Encryption
Sort
View
CRYPTO
2011
Springer
235views Cryptology» more  CRYPTO 2011»
12 years 5 months ago
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
Deterministic public-key encryption, introduced by Bellare, Boldyreva, and O’Neill (CRYPTO ’07), provides an alternative to randomized public-key encryption in various scenari...
Zvika Brakerski, Gil Segev
SACRYPT
2004
Springer
143views Cryptology» more  SACRYPT 2004»
13 years 11 months ago
Blockwise Adversarial Model for On-line Ciphers and Symmetric Encryption Schemes
Abstract. This paper formalizes the security adversarial games for online symmetric cryptosystems in a unified framework for deterministic and probabilistic encryption schemes. On...
Pierre-Alain Fouque, Antoine Joux, Guillaume Poupa...
CRYPTO
2006
Springer
109views Cryptology» more  CRYPTO 2006»
13 years 9 months ago
Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
There are several candidate semantically secure encryption schemes, yet in many applications non-malleability of encryptions is crucial. We show how to transform any semantically s...
Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan
FSE
2007
Springer
104views Cryptology» more  FSE 2007»
13 years 11 months ago
How to Enrich the Message Space of a Cipher
Abstract. Given (deterministic) ciphers E and E that can encipher messages of l and n bits, respectively, we construct a cipher E∗ = XLS[E, E] that can encipher messages of l + s...
Thomas Ristenpart, Phillip Rogaway