Sciweavers

163 search results - page 13 / 33
» Relaxing Chosen-Ciphertext Security
Sort
View
CODCRY
2009
Springer
111views Cryptology» more  CODCRY 2009»
14 years 2 months ago
On the Impossibility of Strong Encryption Over
We give two impossibility results regarding strong encryption over an infinite enumerable domain. The first one relates to statistically secure one-time encryption. The second on...
Raphael C.-W. Phan, Serge Vaudenay
SYNASC
2007
IEEE
142views Algorithms» more  SYNASC 2007»
14 years 2 months ago
An Extension of the RSA Trapdoor in a KEM/DEM Framework
A trapdoor based on an extension of the RSA trapdoor is proposed. The same function as in the RSA cryptosystem is used, i.e. x modn, but there is no restriction for the exponent t...
Bogdan Groza
ACNS
2008
Springer
252views Cryptology» more  ACNS 2008»
14 years 2 months ago
Generic Constructions of Stateful Public Key Encryption and Their Applications
We present generic constructions of stateful public key encryption (StPE). We build several new StPE schemes and explain existing ones using our generic constructions. Of the new ...
Joonsang Baek, Jianying Zhou, Feng Bao
TYPES
2004
Springer
14 years 1 months 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
CCS
2007
ACM
14 years 2 months ago
Provably secure ciphertext policy ABE
In ciphertext policy attribute-based encryption (CP-ABE), every secret key is associated with a set of attributes, and every ciphertext is associated with an access structure on a...
Ling Cheung, Calvin C. Newport