Sciweavers

252 search results - page 1 / 51
» How Secure is Deterministic Encryption
Sort
View
ASIACRYPT
2009
Springer
13 years 8 months ago
Hedged Public-Key Encryption: How to Protect against Bad Randomness
Abstract. Public-key encryption schemes rely for their IND-CPA security on per-message fresh randomness. In practice, randomness may be of poor quality for a variety of reasons, le...
Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas ...
AAECC
2009
Springer
138views Algorithms» more  AAECC 2009»
13 years 9 months ago
Efficient Constructions of Deterministic Encryption from Hybrid Encryption and Code-Based PKE
Abstract. We build on the new security notion for deterministic encryption (PRIV) and the PRIV-secure schemes presented by Bellare et al at Crypto'07. Our work introduces: 1) ...
Yang Cui, Kirill Morozov, Kazukuni Kobara, Hideki ...
CTRSA
2010
Springer
200views Cryptology» more  CTRSA 2010»
13 years 11 months ago
Resettable Public-Key Encryption: How to Encrypt on a Virtual Machine
Typical security models used for proving security of deployed cryptographic primitives do not allow adversaries to rewind or reset honest parties to an earlier state. Thus, it is c...
Scott Yilek
FSTTCS
2007
Springer
13 years 11 months ago
Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
Type systems for secure information flow aim to prevent a program from leaking information from variables that hold secret data to variables that hold public data. In this work we...
Judicaël Courant, Cristian Ene, Yassine Lakhn...
CRYPTO
2008
Springer
150views Cryptology» more  CRYPTO 2008»
13 years 6 months ago
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
Abstract. The study of deterministic public-key encryption was initiated by Bellare et al. (CRYPTO '07), who provided the "strongest possible" notion of security for...
Alexandra Boldyreva, Serge Fehr, Adam O'Neill