Complete Cryptosystems
Wednesday , 4 June, 2008, 1815 , b-it 2.1
Dima Grigoriev ( University of Rennes, France)
A complete public-key cryptosystem (with a bounded error) is constructed, so that if its break was possible then a break of an arbitrary one would be possible as well. Earlier complete one-way functions were known.