Name
Title | ||
|---|---|---|
Adversary-dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli. |
Abstract | ||
|---|---|---|
Lossy trapdoor functions LTDFs, proposed by Peikert and Waters STOC'08, are known to have a number of applications in cryptography. They have been constructed based on various assumptions, which include the quadratic residuosity QR and decisional composite residuosity DCR assumptions, which are factoring-based decision assumptions. However, there is no known construction of an LTDF based on the factoring assumption or other factoring-related search assumptions. In this paper, we first define a notion of adversary-dependent lossy trapdoor functions ad-LTDFs that is a weaker variant of LTDFs. Then we construct an ad-LTDF based on the hardness of factorizing RSA moduli of a special form called semi-smooth RSA subgroup SS moduli proposed by Groth TCC'05. Moreover, we show that ad-LTDFs can replace LTDFs in many applications. Especially, we obtain the first factoring-based deterministic encryption scheme that satisfies the security notion defined by Boldyreva et al. CRYPTO'08 without relying on a decision assumption. Besides direct applications of ad-LTDFs, by a similar technique, we construct a chosen ciphertext secure public key encryption scheme whose ciphertext overhead is the shortest among existing schemes based on the factoring assumption w.r.t. SS moduli. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-662-53008-5_1 | IACR Cryptology ePrint Archive |
DocType | Volume | ISSN |
Conference | 2016 | 0302-9743 |
Citations | PageRank | References |
1 | 0.36 | 23 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takashi Yamakawa | 1 | 12 | 9.35 |
| Shota Yamada 0001 | 2 | 51 | 3.05 |
| Goichiro Hanaoka | 3 | 910 | 101.53 |
| Noboru Kunihiro | 4 | 425 | 45.72 |