CryptoDB
One-Wayness Equivalent to General Factoring
Authors: | |
---|---|
Download: | |
Abstract: | This paper shows the first practical semantically secure public-key encryption scheme such that its one-wayness is equivalent to {\it general} factoring in the {\it standard} model (in the sense of IND-CPA). Next our proof technique is applied to Rabin-Paillier encryption scheme and a variant of RSA-Paillier encryption scheme to prove their exactly tight one-wayness. |
BibTeX
@misc{eprint-2005-12716, title={One-Wayness Equivalent to General Factoring}, booktitle={IACR Eprint archive}, keywords={public-key cryptography /}, url={http://eprint.iacr.org/2005/382}, note={A preliminary version was presented at ASIACRYPT 2003. kurosawa@cis.ibaraki.ac.jp 13081 received 20 Oct 2005, last revised 24 Oct 2005}, author={Kaoru Kurosawa and Tsuyoshi Takagi}, year=2005 }