Welcome to the resource topic for 2013/569
Title:
More Efficient Cryptosystems From k^{th}-Power Residues
Authors: Zhenfu Cao, Xiaolei Dong, Licheng Wang, Jun Shao
Abstract:At Eurocrypt 2013, Joye and Libert proposed a method for constructing public key cryptosystems (PKCs) and lossy trapdoor functions (LTDFs) from (2^\alpha)^{th}-power residue symbols. Their work can be viewed as non-trivial extensions of the well-known PKC scheme due to Goldwasser and Micali, and the LTDF scheme due to Freeman et al., respectively. In this paper, we will demonstrate that this kind of work can be extended \emph{more generally}: all related constructions can work for any k^{th}-power residues if k only contains small prime factors, instead of (2^\alpha)^{th}-power residues only. The resultant PKCs and LTDFs are more efficient than that from Joye-Libert method in terms of decryption speed with the same message length.
ePrint: https://eprint.iacr.org/2013/569
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .