Common Contracts
1 similar null contracts
Dario Fiore1yy and Rosario Gennaro2August 29th, 2010
The novelty of our protocol is that it can be implemented over any cyclic group of prime order, where the Diffie-Hellman problem is supposed to be hard. It does not require the computation of expensive bilinear maps, or additional assumptions such as factoring or RSA.
