File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-319-26617-6_4
- Scopus: eid_2-s2.0-84951873484
- WOS: WOS:000373730200004
- Find via
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: Lossy projective hashing and its applications
Title | Lossy projective hashing and its applications |
---|---|
Authors | |
Keywords | Deterministic public key Encryption Dual projective hashing Lossy encryption Lossy projective hashing Smooth projective hashing |
Issue Date | 2015 |
Publisher | Springer |
Citation | 16th International Conference on Cryptology in India, Bangalore, India, December 6-9, 2015. In Biryukov, A, Goyal, V (Eds), Progress in Cryptology - INDOCRYPT 2015 : 16th International Conference on Cryptology in India, Bangalore, India, December 6-9, 2015, Proceedings, p. 64-84. Cham, Switzerland: Springer, 2015 How to Cite? |
Abstract | In this paper, we introduce a primitive called lossy projective hashing. It is unknown before whether smooth projective hashing (Cramer-Shoup, Eurocrypt’02) can be constructed from dual projective hashing (Wee, Eurocrypt’12). The lossy projective hashing builds a bridge between dual projective hashing and smooth projective hashing. We give instantiations of lossy projective hashing from DDH, DCR, QR and general subgroup membership assumptions (including 2k-th residue, p-subgroup and higher residue assumptions). We also show how to construct lossy encryption and fully IND secure deterministic public key encryption from lossy projective hashing. – We give a construction of lossy projective hashing via dual projective hashing. We prove that lossy projective hashing can be converted to smooth projective hashing via pairwise independent hash functions, which in turn yields smooth projective hashing from dual projective hashing. – We propose a direct construction of lossy encryption via lossy projective hashing.Our construction is different from that given by Hemenway et al. (Eurocrypt 2011) via smooth projective hashing. In addition, we give a fully IND secure deterministic public key encryption via lossy projective hashing and one round UCE secure hash functions recently introduced by Bellare et al. (Crypto 2013). |
Persistent Identifier | http://hdl.handle.net/10722/312006 |
ISBN | |
ISSN | 2020 SCImago Journal Rankings: 0.249 |
ISI Accession Number ID | |
Series/Report no. | Lecture Notes in Computer Science ; 9462 LNCS sublibrary. SL 4, Security and Cryptology |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Xue, Haiyang | - |
dc.contributor.author | Liu, Yamin | - |
dc.contributor.author | Lu, Xianhui | - |
dc.contributor.author | Li, Bao | - |
dc.date.accessioned | 2022-04-06T04:31:58Z | - |
dc.date.available | 2022-04-06T04:31:58Z | - |
dc.date.issued | 2015 | - |
dc.identifier.citation | 16th International Conference on Cryptology in India, Bangalore, India, December 6-9, 2015. In Biryukov, A, Goyal, V (Eds), Progress in Cryptology - INDOCRYPT 2015 : 16th International Conference on Cryptology in India, Bangalore, India, December 6-9, 2015, Proceedings, p. 64-84. Cham, Switzerland: Springer, 2015 | - |
dc.identifier.isbn | 9783319266169 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10722/312006 | - |
dc.description.abstract | In this paper, we introduce a primitive called lossy projective hashing. It is unknown before whether smooth projective hashing (Cramer-Shoup, Eurocrypt’02) can be constructed from dual projective hashing (Wee, Eurocrypt’12). The lossy projective hashing builds a bridge between dual projective hashing and smooth projective hashing. We give instantiations of lossy projective hashing from DDH, DCR, QR and general subgroup membership assumptions (including 2k-th residue, p-subgroup and higher residue assumptions). We also show how to construct lossy encryption and fully IND secure deterministic public key encryption from lossy projective hashing. – We give a construction of lossy projective hashing via dual projective hashing. We prove that lossy projective hashing can be converted to smooth projective hashing via pairwise independent hash functions, which in turn yields smooth projective hashing from dual projective hashing. – We propose a direct construction of lossy encryption via lossy projective hashing.Our construction is different from that given by Hemenway et al. (Eurocrypt 2011) via smooth projective hashing. In addition, we give a fully IND secure deterministic public key encryption via lossy projective hashing and one round UCE secure hash functions recently introduced by Bellare et al. (Crypto 2013). | - |
dc.language | eng | - |
dc.publisher | Springer | - |
dc.relation.ispartof | Progress in Cryptology - INDOCRYPT 2015 : 16th International Conference on Cryptology in India, Bangalore, India, December 6-9, 2015, Proceedings | - |
dc.relation.ispartofseries | Lecture Notes in Computer Science ; 9462 | - |
dc.relation.ispartofseries | LNCS sublibrary. SL 4, Security and Cryptology | - |
dc.subject | Deterministic public key Encryption | - |
dc.subject | Dual projective hashing | - |
dc.subject | Lossy encryption | - |
dc.subject | Lossy projective hashing | - |
dc.subject | Smooth projective hashing | - |
dc.title | Lossy projective hashing and its applications | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/978-3-319-26617-6_4 | - |
dc.identifier.scopus | eid_2-s2.0-84951873484 | - |
dc.identifier.volume | 9462 | - |
dc.identifier.spage | 64 | - |
dc.identifier.epage | 84 | - |
dc.identifier.eissn | 1611-3349 | - |
dc.identifier.isi | WOS:000373730200004 | - |
dc.publisher.place | Cham, Switzerland | - |