Provably-secure time-bound hierarchical key assignment schemes
Proceedings of the 13th ACM conference on Computer and communications security
Security under key-dependent inputs
Proceedings of the 14th ACM conference on Computer and communications security
How to Encrypt with a Malicious Random Number Generator
Fast Software Encryption
How to Encrypt with the LPN Problem
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
New constructions for provably-secure time-bound hierarchical key assignment schemes
Theoretical Computer Science
On the Equivalence of Several Security Notions of KEM and DEM
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Efficient and provably secure aggregation of encrypted data in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Folklore, practice and theory of robust combiners
Journal of Computer Security
On the Impossibility of Strong Encryption Over $\aleph_0$
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
On the security of the CCM encryption mode and of a slight variant
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Some (in)sufficient conditions for secure hybrid encryption
Information and Computation
A security framework for privacy-preserving data aggregation in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Efficient provably-secure hierarchical key assignment schemes
Theoretical Computer Science
Identity-based key agreement with unilateral identity privacy using pairings
ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
Isolating partial information of indistinguishable encryptions
EuroPKI'11 Proceedings of the 8th European conference on Public Key Infrastructures, Services, and Applications
On the privacy of concealed data aggregation
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Incorporating temporal capabilities in existing key management schemes
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Sharing many secrets with computational provable security
Information Processing Letters
Hi-index | 0.00 |
The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptography. Here, we focus on the case of private-key encryption. Extending security notions from the public-key setting, we define security in the sense of both indistinguishability and non-malleability against chosen-plaintext and chosen-ciphertext attacks, considering both non-adaptive (i.e., ``lunchtime'') and adaptive oracle access (adaptive here refers to an adversary's ability to interact with a given oracle even after viewing the challenge ciphertext). We then characterize the 18 resulting security notions in two ways. First, we construct a complete hierarchy of security notions; that is, for every pair of definitions we show whether one definition is stronger than the other, whether the definitions are equivalent, or whether they are incomparable. Second, we partition these notions of security into two classes (computational or information-theoretic) depending on whether one-way functions are necessary in order for encryption schemes satisfying the definition to exist. Perhaps our most surprising result is that security against adaptive chosen-plaintext attack is (polynomially) equivalent to security against non-adaptive chosen-plaintext attack. On the other hand, the ability of an adversary to mount a (non-adaptive) chosen-plaintext attack is the key feature distinguishing computational and information-theoretic notions of security. These results hold for all security notions considered here.