| dc.contributor.author | Applebaum, Benny | en_US |
| dc.date.accessioned | 2016-06-10T08:32:15Z | |
| dc.date.available | 2016-06-10T08:32:15Z | |
| dc.date.issued | 2014 | en_US |
| dc.identifier.isbn | 978-3-642-17366-0 | en_US |
| dc.identifier.isbn | 978-3-642-17367-7 | en_US |
| dc.identifier.other | HPU1160115 | en_US |
| dc.identifier.uri | https://lib.hpu.edu.vn/handle/123456789/21167 | |
| dc.description.abstract | Locally computable (NC0) functions are "simple" functions for which every bit of the output can be computed by reading a small number of bits of their input. The study of locally computable cryptography attempts to construct cryptographic functions that achieve this strong notion of simplicity and simultaneously provide a high level of security. Such constructions are highly parallelizable and they can be realized by Boolean circuits of constant depth. | en_US |
| dc.format.extent | 204 p. | en_US |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | en_US |
| dc.publisher | Springer-Verlag Berlin Heidelberg | en_US |
| dc.relation.ispartofseries | Information Security and Cryptography | en_US |
| dc.subject | Cryptography | en_US |
| dc.subject | Parallel time | en_US |
| dc.subject | Information security | en_US |
| dc.title | Cryptography in constant parallel time | en_US |
| dc.type | Book | en_US |
| dc.size | 2,003KB | en_US |
| dc.department | English resources | en_US |
