Lossy encryption: Constructions from general assumptions and efficient selective opening chosen ciphertext security

Brett Hemenway Benoit Libert 1 Rafail Ostrovsky 2 Damien Vergnaud 3
1 Groupe Crypto
ICTEAM - Institute of Information and Communication Technologies, Electronics and Applied Mathematics
3 CASCADE - Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities
DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR 8548
Abstract : Lossy encryption was originally studied as a means of achieving efficient and composable oblivious transfer. Bellare, Hofheinz and Yilek showed that lossy encryption is also selective opening secure. We present new and general constructions of lossy encryption schemes and of cryptosystems secure against selective opening adversaries. We show that every re-randomizable encryption scheme gives rise to efficient encryptions secure against a selective opening adversary. We show that statistically-hiding 2-round Oblivious Transfer implies Lossy Encryption and so do smooth hash proof systems. This shows that private information retrieval and homomorphic encryption both imply Lossy Encryption, and thus Selective Opening Secure Public Key Encryption. Applying our constructions to well-known cryptosystems, we obtain selective opening secure commitments and encryptions from the Decisional Diffie-Hellman, Decisional Composite Residuosity and Quadratic Residuosity assumptions. In an indistinguishability-based model of chosen-ciphertext selective opening security, we obtain secure schemes featuring short ciphertexts under standard number theoretic assumptions. In a simulation-based definition of chosen-ciphertext selective opening security, we also handle non-adaptive adversaries by adapting the Naor-Yung paradigm and using the perfect zeroknowledge proofs of Groth, Ostrovsky and Sahai.
Type de document :
Communication dans un congrès
Abderrahmane Nitaj; David Pointcheval. ASIACRYPT 2011 - 17th International Conference on the Theory and Application of Cryptology and Information Security, Jul 2011, Dakar, Senegal. Springer, 7073, pp.70-88, LNCS - Lecture Notes in Computer Science
Liste complète des métadonnées

https://hal.inria.fr/hal-01110204
Contributeur : Brigitte Briot <>
Soumis le : mardi 27 janvier 2015 - 16:29:41
Dernière modification le : vendredi 25 mai 2018 - 12:02:05

Identifiants

  • HAL Id : hal-01110204, version 1

Collections

Relations

Citation

Brett Hemenway, Benoit Libert, Rafail Ostrovsky, Damien Vergnaud. Lossy encryption: Constructions from general assumptions and efficient selective opening chosen ciphertext security. Abderrahmane Nitaj; David Pointcheval. ASIACRYPT 2011 - 17th International Conference on the Theory and Application of Cryptology and Information Security, Jul 2011, Dakar, Senegal. Springer, 7073, pp.70-88, LNCS - Lecture Notes in Computer Science. 〈hal-01110204〉

Partager

Métriques

Consultations de la notice

171