@inproceedings{ab724df4d1ee4b07a72f776d1bb779bc,
title = "Cryptographic hardness of random local functions - Survey",
abstract = "Constant parallel-time cryptography allows performing complex cryptographic tasks at an ultimate level of parallelism, namely, by local functions that each of their output bits depend on a constant number of input bits. The feasibility of such highly efficient cryptographic constructions was widely studied in the last decade via two main research threads.",
author = "Benny Applebaum",
year = "2013",
doi = "10.1007/978-3-642-36594-2_33",
language = "الإنجليزيّة",
isbn = "9783642365935",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "599",
booktitle = "Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Proceedings",
note = "10th Theory of Cryptography Conference, TCC 2013 ; Conference date: 03-03-2013 Through 06-03-2013",
}