Cryptography with Constant Input Locality.
Saved in:
| Title: | Cryptography with Constant Input Locality. |
|---|---|
| Authors: | Applebaum, Benny, Ishai, Yuval, Kushilevitz, Eyal |
| Source: | Advances in Cryptology - CRYPTO 2007; 2007, p92-110, 19p |
| Abstract: | We study the following natural question: Which cryptographic primitives (if any) can be realized by functions with constant input locality, namely functions in which every bit of the input influences only a constant number of bits of the output? This continues the study of cryptography in low complexity classes. It was recently shown (Applebaum et al., FOCS 2004) that, under standard cryptographic assumptions, most cryptographic primitives can be realized by functions with constant output locality, namely ones in which every bit of the output is influenced by a constant number of bits from the input. We (almost) characterize what cryptographic tasks can be performed with constant input locality. On the negative side, we show that primitives which require some form of non-malleability (such as digital signatures, message authentication, or non-malleable encryption) cannot be realized with constant input locality. On the positive side, assuming the intractability of certain problems from the domain of error correcting codes (namely, hardness of decoding a random linear code or the security of the McEliece cryptosystem), we obtain new constructions of one-way functions, pseudorandom generators, commitments, and semantically-secure public-key encryption schemes whose input locality is constant. Moreover, these constructions also enjoy constant output locality. Therefore, they give rise to cryptographic hardware that has constant-depth, constant fan-in and constant fan-out. As a byproduct, we obtain a pseudorandom generator whose output and input locality are both optimal (namely, 3). [ABSTRACT FROM AUTHOR] |
| Copyright of Advances in Cryptology - CRYPTO 2007 is the property of Springer Nature / Books and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Complementary Index |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: edb DbLabel: Complementary Index An: 76582141 RelevancyScore: 848 AccessLevel: 6 PubType: Book PubTypeId: book PreciseRelevancyScore: 847.899108886719 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Cryptography with Constant Input Locality. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Applebaum%2C+Benny%22">Applebaum, Benny</searchLink><br /><searchLink fieldCode="AR" term="%22Ishai%2C+Yuval%22">Ishai, Yuval</searchLink><br /><searchLink fieldCode="AR" term="%22Kushilevitz%2C+Eyal%22">Kushilevitz, Eyal</searchLink> – Name: TitleSource Label: Source Group: Src Data: Advances in Cryptology - CRYPTO 2007; 2007, p92-110, 19p – Name: Abstract Label: Abstract Group: Ab Data: We study the following natural question: Which cryptographic primitives (if any) can be realized by functions with constant input locality, namely functions in which every bit of the input influences only a constant number of bits of the output? This continues the study of cryptography in low complexity classes. It was recently shown (Applebaum et al., FOCS 2004) that, under standard cryptographic assumptions, most cryptographic primitives can be realized by functions with constant output locality, namely ones in which every bit of the output is influenced by a constant number of bits from the input. We (almost) characterize what cryptographic tasks can be performed with constant input locality. On the negative side, we show that primitives which require some form of non-malleability (such as digital signatures, message authentication, or non-malleable encryption) cannot be realized with constant input locality. On the positive side, assuming the intractability of certain problems from the domain of error correcting codes (namely, hardness of decoding a random linear code or the security of the McEliece cryptosystem), we obtain new constructions of one-way functions, pseudorandom generators, commitments, and semantically-secure public-key encryption schemes whose input locality is constant. Moreover, these constructions also enjoy constant output locality. Therefore, they give rise to cryptographic hardware that has constant-depth, constant fan-in and constant fan-out. As a byproduct, we obtain a pseudorandom generator whose output and input locality are both optimal (namely, 3). [ABSTRACT FROM AUTHOR] – Name: Abstract Label: Group: Ab Data: <i>Copyright of Advances in Cryptology - CRYPTO 2007 is the property of Springer Nature / Books and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=76582141 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/978-3-540-74143-5_6 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 19 StartPage: 92 Titles: – TitleFull: Cryptography with Constant Input Locality. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Applebaum, Benny – PersonEntity: Name: NameFull: Ishai, Yuval – PersonEntity: Name: NameFull: Kushilevitz, Eyal IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Text: 2007 Type: published Y: 2007 Identifiers: – Type: isbn-print Value: 9783540741428 Titles: – TitleFull: Advances in Cryptology - CRYPTO 2007 Type: main |
| ResultId | 1 |