A new public key cryptosystem is proposed and analyzed. The scheme is quite practical, and is provably secure against adaptive chosen ciphertext attack under standard intractability assumptions.… Expand

A general framework that allows one to construct secure encryption schemes in a generic fashion from language membership problems that satisfy certain technical requirements is introduced, as does the Cramer-Shoup scheme based on the Decision Diffie-Hellman assumption.Expand

A new public-key encryption scheme, along with several variants, is proposed and analyzed that appear to be the first public- key encryption schemes in the literature that are simultaneously practical and provably secure.Expand

An RSA threshold signature scheme that is unforgeable and robust in the random oracle model, assuming the RSA problem is hard and the size of an individual signature share is bounded by a constant times thesize of the RSA modulus.Expand

Lower bounds on the complexity of the discrete logarithm and related problems are proved that match the known upper bounds: any generic algorithm must perform Ω(p1/2) group operations, where p is the largest prime dividing the order of the group.Expand

Some of the algorithms and optimization techniques that are used in HElib for data movement, linear algebra, and other operations over this “platform” are described.Expand

We present a new protocol that allows two players to exchange digital signatures over the Internet in a fair way, so that either each player gets the other's signature, or neither player does. The… Expand

A set of optimistic fair exchange protocols which tolerate temporary failures in the communication channels to the third party, and a central feature of the protocols is that either player can asynchronously and unilaterally bring a protocol run to completion.Expand

This work shows how to build a certain “trapdoor test” that allows us to effectively answer decision oracle queries for the twin Diffie–Hellman problem without knowing any of the corresponding discrete logarithms, and presents a new variant of ElGamal encryption with very short ciphertexts, and with a very simple and tight security proof, in the random oracle model, under the assumption that the ordinary Diffie-Hell man problem is hard.Expand