Cryptographic hardness of random local functions - Survey

Benny Applebaum

doi:10.1007/978-3-642-36594-2_33

Cryptographic hardness of random local functions - Survey

Benny Applebaum^*

^*Corresponding author for this work

School of Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 Scopus citations

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.

Original language	English
Title of host publication	Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Proceedings
Pages	599
Number of pages	1
DOIs	https://doi.org/10.1007/978-3-642-36594-2_33
State	Published - 2013
Event	10th Theory of Cryptography Conference, TCC 2013 - Tokyo, Japan Duration: 3 Mar 2013 → 6 Mar 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7785 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	10th Theory of Cryptography Conference, TCC 2013
Country/Territory	Japan
City	Tokyo
Period	3/03/13 → 6/03/13

Access to Document

10.1007/978-3-642-36594-2_33

Cite this

Applebaum, B. (2013). Cryptographic hardness of random local functions - Survey. In Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Proceedings (pp. 599). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7785 LNCS). https://doi.org/10.1007/978-3-642-36594-2_33

@inproceedings{c49b547a26cf4c428868339a7210f5a1,

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",

}

Applebaum, B 2013, Cryptographic hardness of random local functions - Survey. in Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7785 LNCS, pp. 599, 10th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, 3/03/13. https://doi.org/10.1007/978-3-642-36594-2_33

Cryptographic hardness of random local functions - Survey. / Applebaum, Benny.
Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Proceedings. 2013. p. 599 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7785 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Cryptographic hardness of random local functions - Survey

AU - Applebaum, Benny

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84873959443&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-36594-2_33

DO - 10.1007/978-3-642-36594-2_33

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84873959443

SN - 9783642365935

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 599

BT - Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Proceedings

T2 - 10th Theory of Cryptography Conference, TCC 2013

Y2 - 3 March 2013 through 6 March 2013

ER -

Cryptographic hardness of random local functions - Survey

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this