File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-319-12280-9_3
- Scopus: eid_2-s2.0-84911418452
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: On the lossiness of 2k-th power and the instantiability of rabin-OAEP
Title | On the lossiness of 2k-th power and the instantiability of rabin-OAEP |
---|---|
Authors | |
Keywords | Lossy trapdoor function OAEP Rabin Φ-hiding |
Issue Date | 2014 |
Publisher | Springer |
Citation | 13th International Conference, CANS 2014, Heraklion, Crete, Greece, October 22-24, 2014. In Gritzalis, D, Kiayias, A, Askoxylakis, I (Eds), Cryptology and Network Security : 13th International Conference, CANS 2014, Heraklion, Crete, Greece, October 22-24, 2014, Proceedings, p. 34-49. Cham, Switzerland : Springer, 2014 How to Cite? |
Abstract | Seurin (PKC 2014) proposed the 2-Φ/4-hiding assumption which asserts the indistinguishability of Blum Numbers from pseudo Blum Numbers. In this paper, we investigate the lossiness of 2k-th power based on the 2k-Φ/4-hiding assumption, which is an extension of the 2-Φ/4-hiding assumption. And we prove that 2k-th power function is a lossy trapdoor permutation over Quadratic Residuosity group. This new lossy trapdoor function has 2k-bits lossiness for k-bits exponent, while the RSA lossy trapdoor function given by Kiltz et al. (Crypto 2010) has k-bits lossiness for k-bits exponent under Φ-hiding assumption in lossy mode. We modify the square function in Rabin-OAEP by 2k-th power and show the instantiability of this Modified Rabin-OAEP by the technique of Kiltz et al. (Crypto 2010). The Modified Rabin-OAEP is more efficient than the RSA-OAEP scheme for the same secure bits. With the secure parameter being 80 bits and the modulus being 2048 bits, Modified Rabin-OAEP can encrypt roughly 454 bits of message, while RSA-OAEP can roughly encrypt 274 bits. |
Persistent Identifier | http://hdl.handle.net/10722/311989 |
ISBN | |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
Series/Report no. | Lecture Notes in Computer Science ; 8813 LNCS sublibrary. SL 4, Security and Cryptology |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Xue, Haiyang | - |
dc.contributor.author | Li, Bao | - |
dc.contributor.author | Lu, Xianhui | - |
dc.contributor.author | Wang, Kunpeng | - |
dc.contributor.author | Liu, Yamin | - |
dc.date.accessioned | 2022-04-06T04:31:55Z | - |
dc.date.available | 2022-04-06T04:31:55Z | - |
dc.date.issued | 2014 | - |
dc.identifier.citation | 13th International Conference, CANS 2014, Heraklion, Crete, Greece, October 22-24, 2014. In Gritzalis, D, Kiayias, A, Askoxylakis, I (Eds), Cryptology and Network Security : 13th International Conference, CANS 2014, Heraklion, Crete, Greece, October 22-24, 2014, Proceedings, p. 34-49. Cham, Switzerland : Springer, 2014 | - |
dc.identifier.isbn | 9783319122793 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10722/311989 | - |
dc.description.abstract | Seurin (PKC 2014) proposed the 2-Φ/4-hiding assumption which asserts the indistinguishability of Blum Numbers from pseudo Blum Numbers. In this paper, we investigate the lossiness of 2k-th power based on the 2k-Φ/4-hiding assumption, which is an extension of the 2-Φ/4-hiding assumption. And we prove that 2k-th power function is a lossy trapdoor permutation over Quadratic Residuosity group. This new lossy trapdoor function has 2k-bits lossiness for k-bits exponent, while the RSA lossy trapdoor function given by Kiltz et al. (Crypto 2010) has k-bits lossiness for k-bits exponent under Φ-hiding assumption in lossy mode. We modify the square function in Rabin-OAEP by 2k-th power and show the instantiability of this Modified Rabin-OAEP by the technique of Kiltz et al. (Crypto 2010). The Modified Rabin-OAEP is more efficient than the RSA-OAEP scheme for the same secure bits. With the secure parameter being 80 bits and the modulus being 2048 bits, Modified Rabin-OAEP can encrypt roughly 454 bits of message, while RSA-OAEP can roughly encrypt 274 bits. | - |
dc.language | eng | - |
dc.publisher | Springer | - |
dc.relation.ispartof | Cryptology and Network Security : 13th International Conference, CANS 2014, Heraklion, Crete, Greece, October 22-24, 2014, Proceedings | - |
dc.relation.ispartofseries | Lecture Notes in Computer Science ; 8813 | - |
dc.relation.ispartofseries | LNCS sublibrary. SL 4, Security and Cryptology | - |
dc.subject | Lossy trapdoor function | - |
dc.subject | OAEP | - |
dc.subject | Rabin | - |
dc.subject | Φ-hiding | - |
dc.title | On the lossiness of 2k-th power and the instantiability of rabin-OAEP | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/978-3-319-12280-9_3 | - |
dc.identifier.scopus | eid_2-s2.0-84911418452 | - |
dc.identifier.volume | 8813 | - |
dc.identifier.spage | 34 | - |
dc.identifier.epage | 49 | - |
dc.identifier.eissn | 1611-3349 | - |
dc.publisher.place | Cham, Switzerland | - |