This thesis is concerned with the design and analysis of practical provably-secure encryption schemes. We give several results that include new schemes with attractive tradeoffs between efficiency and security and new techniques for analyzing existing schemes. Our results are divided into three chapters, which we summarize below. The Twin Diffie-Hellman Problem. We describe techniques for analyzing encryption schemes based on the hardness of Diffie-Hellman-type problems. We apply our techniques to several specific cases of encryption, including identity-based encryption, to design a collection of encryption schemes that offer improved tradeoffs between efficiency and evidence for security over similar schemes. In addition to offering q...
The Diffie-Hellman (DH) problem is a problem that is assumed to be difficult to do, hence the securi...
We propose the first tight security proof for the ordinary two-message signed Diffie-Hellman key exc...
We present several new and fairly practical public-key encryption schemes and prove them secure agai...
This paper describes a Diffie-Hellman based encryption scheme, DHIES (formerly named DHES and DHAES...
The main contributions of this paper are twofold. On the one hand, the twin Diffie-Hellman (twin DH)...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
[[abstract]]The Diffie-Hellman (DH) problem is an important security assumption in modern cryptograp...
We provide a new definitional framework capturing the multi-user security of encryption schemes and ...
This thesis contributes two results to the research area of secure two-party computation. The first ...
In Why Textbook ElGamal and RSA Encryption are Insecure by Boneh, Joux, and Nguyen, several algorith...
The cryptosystem recently proposed by Cramer and Shoup [CS98] is a practical public key cryptosystem...
Abstract. The main contributions of this paper are twofold. On the one hand, the twin Diffie-Hellman...
We provide the first constructions of identity-based encryption and hierarchical identity-based encr...
Provable security is nowadays one of the major lines of research in Cryptography. It aims at providi...
Computer-aided verification provides effective means of analyzing the security of cryptographic prim...
The Diffie-Hellman (DH) problem is a problem that is assumed to be difficult to do, hence the securi...
We propose the first tight security proof for the ordinary two-message signed Diffie-Hellman key exc...
We present several new and fairly practical public-key encryption schemes and prove them secure agai...
This paper describes a Diffie-Hellman based encryption scheme, DHIES (formerly named DHES and DHAES...
The main contributions of this paper are twofold. On the one hand, the twin Diffie-Hellman (twin DH)...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
[[abstract]]The Diffie-Hellman (DH) problem is an important security assumption in modern cryptograp...
We provide a new definitional framework capturing the multi-user security of encryption schemes and ...
This thesis contributes two results to the research area of secure two-party computation. The first ...
In Why Textbook ElGamal and RSA Encryption are Insecure by Boneh, Joux, and Nguyen, several algorith...
The cryptosystem recently proposed by Cramer and Shoup [CS98] is a practical public key cryptosystem...
Abstract. The main contributions of this paper are twofold. On the one hand, the twin Diffie-Hellman...
We provide the first constructions of identity-based encryption and hierarchical identity-based encr...
Provable security is nowadays one of the major lines of research in Cryptography. It aims at providi...
Computer-aided verification provides effective means of analyzing the security of cryptographic prim...
The Diffie-Hellman (DH) problem is a problem that is assumed to be difficult to do, hence the securi...
We propose the first tight security proof for the ordinary two-message signed Diffie-Hellman key exc...
We present several new and fairly practical public-key encryption schemes and prove them secure agai...