Please use this identifier to cite or link to this item:
http://lib.hpu.edu.vn/handle/123456789/21167| Title: | Cryptography in constant parallel time |
| Authors: | Applebaum, Benny |
| Keywords: | Cryptography Parallel time Information security |
| Issue Date: | 2014 |
| Publisher: | Springer-Verlag Berlin Heidelberg |
| Series/Report no.: | Information Security and Cryptography |
| 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. |
| URI: | https://lib.hpu.edu.vn/handle/123456789/21167 |
| ISBN: | 978-3-642-17366-0 978-3-642-17367-7 |
| Appears in Collections: | Technology |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 6_Cryptography_in_Constant_Parallel_Time.pdf Restricted Access | 2 MB | Adobe PDF | ![]() View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
