Name
Title | ||
|---|---|---|
All-But-Many Lossy Trapdoor Functions under Decisional RSA Subgroup Assumption and Application |
Abstract | ||
|---|---|---|
Lossy trapdoor functions (LTDFs) were introduced by Peikert and Waters (STOC 2008) and have a number of applications in cryptography. All-but-many lossy trapdoor functions (ABM-LTDFs) are generalizations of LTDFs studied by Hofheinz (Eurocrypt 2012). Specially, using ABM-LTDFs to construct public key encryption (PKE) scheme with selective opening security has been proven feasible. Existing ABM-LTDFs were built on pairings, lattices and decisional composite residuosity (DCR) assumption. However, pairing-based ABM-LTDFs and DCR-based ABM-LTDFs rely on nonstandard assumptions. In this paper, we construct an ABM-LTDF under the decisional RSA subgroup (DRSA) assumption, and we employ it to construct PKE scheme with selective opening security. We also propose a construction of DCR-based ABM-LTDF relying on standard assumption in Appendix. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1093/comjnl/bxz008 | COMPUTER JOURNAL |
Keywords | Field | DocType |
Lossy trapdoor function,semi-smooth RSA subgroup modulus,decisional RSA subgroup assumption,decisional composite residuosity assumption | Lossy compression,Computer science,Theoretical computer science | Journal |
Volume | Issue | ISSN |
62 | 8 | 0010-4620 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nanyuan Cao | 1 | 0 | 0.34 |
| zhenfu cao | 2 | 10 | 8.69 |
| Zhen Liu | 3 | 32 | 1.61 |
| Xiaolei Dong | 4 | 5 | 4.56 |
| Xiaopeng Zhao | 5 | 0 | 0.34 |