DC Field | Value | Language |
---|---|---|
dc.contributor.author | Choi, WonSeok | ko |
dc.contributor.author | Lee, ByeongHak | ko |
dc.contributor.author | Lee, Jooyoung | ko |
dc.date.accessioned | 2019-12-13T07:35:03Z | - |
dc.date.available | 2019-12-13T07:35:03Z | - |
dc.date.created | 2019-11-14 | - |
dc.date.created | 2019-11-14 | - |
dc.date.created | 2019-11-14 | - |
dc.date.created | 2019-11-14 | - |
dc.date.created | 2019-11-14 | - |
dc.date.created | 2019-11-14 | - |
dc.date.issued | 2019-12-09 | - |
dc.identifier.citation | 25th Annual International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT), pp.175 - 195 | - |
dc.identifier.uri | http://hdl.handle.net/10203/268945 | - |
dc.description.abstract | One of natural ways of constructing a pseudorandom function from a pseudorandom permutation is to simply truncate the output of the permutation. When n is the permutation size and m is the number of truncated bits, the resulting construction is known to be indistinguishable from a random function up to 2(n+m/2) queries, which is tight. In this paper, we study the indifferentiability of a truncated random permutation where a fixed prefix is prepended to the inputs. We prove that this construction is (regularly) indifferentiable from a public random function up to min{2(n+m/3), 2(m), 2(l)} queries, while it is publicly indifferentiable up to min{max{2(n+m/3), 2(n2)}, 2(l)} queries, where l is the size of the fixed prefix. Furthermore, the regular indifferentiability bound is proved to be tight when m + l << n. Our results significantly improve upon the previous bound of min{2(m/2), 2(l)} given by Dodis et al. (FSE 2009), allowing us to construct, for instance, an n/2-to-n/2 bit random function that makes a single call to an n-bit permutation, achieving n/2-bit security. | - |
dc.language | English | - |
dc.publisher | International Association for Cryptologic Research (IACR) | - |
dc.title | Indifferentiability of Truncated Random Permutations | - |
dc.type | Conference | - |
dc.identifier.wosid | 000585084500007 | - |
dc.identifier.scopusid | 2-s2.0-85076681489 | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 175 | - |
dc.citation.endingpage | 195 | - |
dc.citation.publicationname | 25th Annual International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT) | - |
dc.identifier.conferencecountry | JA | - |
dc.identifier.conferencelocation | Kobe Portopia Hotel | - |
dc.identifier.doi | 10.1007/978-3-030-34578-5_7 | - |
dc.contributor.localauthor | Lee, Jooyoung | - |
dc.contributor.nonIdAuthor | Choi, WonSeok | - |
dc.contributor.nonIdAuthor | Lee, ByeongHak | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.