Journal ArticleDOI
Tag-KEM/DEM: A New Framework for Hybrid Encryption
Reads0
Chats0
TLDR
In this paper, the generic construction of hybrid encryption schemes is presented, which produces more efficient schemes than the ones known before, and it allows immediate conversion from a class of threshold public-key encryption to a threshold hybrid one without considerable overhead.Abstract:
This paper presents a novel framework for the generic construction of hybrid encryption schemes which produces more efficient schemes than the ones known before. A previous framework introduced by Shoup combines a key encapsulation mechanism (KEM) and a data encryption mechanism (DEM). While it is sufficient to require both components to be secure against chosen ciphertext attacks (CCA-secure), Kurosawa and Desmedt showed a particular example of KEM that is not CCA-secure but can be securely combined with a specific type of CCA-secure DEM to obtain a more efficient, CCA-secure hybrid encryption scheme. There are also many other efficient hybrid encryption schemes in the literature that do not fit into Shoup’s framework. These facts serve as motivation to seek another framework.
The framework we propose yields more efficient hybrid scheme, and in addition provides insightful explanation about existing schemes that do not fit into the previous framework. Moreover, it allows immediate conversion from a class of threshold public-key encryption to a threshold hybrid one without considerable overhead, which may not be possible in the previous approach.read more
Citations
More filters
Journal ArticleDOI
Secure Integration of Asymmetric and Symmetric Encryption Schemes
TL;DR: In this paper, a generic transformation from weak asymmetric and symmetric encryption schemes to an asymmetric encryption scheme that is chosen-ciphertext secure in the random oracle model is presented.
Journal ArticleDOI
A survey of certificateless encryption schemes and security models
TL;DR: A survey of the literature on certificateless encryption can be found in this paper, where the authors examine the security models that have been proposed to prove the security of CCE schemes and propose a new nomenclature for these models.
Book ChapterDOI
All-But-Many lossy trapdoor functions
TL;DR: In this article, a generalization of lossy trapdoor functions (LTFs) is proposed, called all-but-many LTFs, which are parametrized with tags.
Book ChapterDOI
Tightly CCA-Secure Encryption Without Pairings
TL;DR: This work constructs the first tightly simulation-sound designated-verifier NIZK for linear languages without pairings, and using pairings can turn the construction into a highly optimized publicly verifiable NizK with tight simulation- soundness.
Book ChapterDOI
Chameleon-Hashes with Ephemeral Trapdoors
TL;DR: The notion of chameleon-hash functions with ephemeral trapdoors was introduced in this paper, where the trapdoors are chosen by the party computing a hash value and the holder of the main trapdoor is then unable to find a second pre-image of the hash value unless also provided with the ephemera trapdoor used to compute the value.
References
More filters
Proceedings ArticleDOI
Random oracles are practical: a paradigm for designing efficient protocols
Mihir Bellare,Phillip Rogaway +1 more
TL;DR: It is argued that the random oracles model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice, and yields protocols much more efficient than standard ones while retaining many of the advantages of provable security.
Proceedings ArticleDOI
How to play ANY mental game
TL;DR: This work presents a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest.
Proceedings Article
How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority
TL;DR: Permission to copy without fee all or part of this material is granted provided that the copies are not made or Idistributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machimery.
Proceedings ArticleDOI
Completeness theorems for non-cryptographic fault-tolerant distributed computation
TL;DR: In this article, the authors show that every function of n inputs can be efficiently computed by a complete network of n processors in such a way that if no faults occur, no set of size t can be found.
Book ChapterDOI
Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles
Dan Boneh,Xavier Boyen +1 more
TL;DR: The first secure IBE scheme without random oracles was presented in this article, where the adversary must commit ahead of time to the identity that it intends to attack, whereas in the standard model the adversary is allowed to choose this identity adaptively.
Related Papers (5)
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
Ronald Cramer,Victor Shoup +1 more
Random oracles are practical: a paradigm for designing efficient protocols
Mihir Bellare,Phillip Rogaway +1 more