Cryptography with Low Complexity

Project Information

CLC

Grant agreement ID: 639813

DOI 10.3030/639813

Project closed

EC signature date 15 April 2015

Start date 1 May 2015

End date 31 October 2021

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost € 1 265 750,00

EU contribution € 1 265 750,00

Coordinated by

TEL AVIV UNIVERSITY
Israel

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Conference proceedings (19)

Better secret sharing via robust conditional disclosure of secretsShare on

Author(s): Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter
Published in: 2020
Publisher: ACM Symposium on Theory of Computing
DOI: 10.1145/3357713.3384293

The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract)

Author(s): Benny Applebaum, Eliran Kachlon, Arpita Patra
Published in: 2020
Publisher: Springer
DOI: 10.1007/978-3-030-64378-2_20

Placing Conditional Disclosure of Secrets in the Communication Complexity Universe

Author(s): Applebaum, Benny ; Vasudevan, Prashant Nalini
Published in: 10th Innovations in Theoretical Computer Science Conference, 2018, ISBN 978-3-95977-095-8
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.itcs.2019.4

The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency

Author(s): Benny Applebaum, Eliran Kachlon, Arpita Patra
Published in: 2020
Publisher: IEEE
DOI: 10.1109/focs46700.2020.00121

Secret-Sharing Schemes for General and Uniform Access Structures.

Author(s): Benny Applebaum, Amos Beimel, Oriol Farràs, Oded Nir, Naty Peter
Published in: 2019
Publisher: Springer
DOI: 10.1007/978-3-030-17659-4_15

Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error

Author(s): Benny Applebaum; Eliran Kachlon
Published in: 60th {IEEE} Annual Symposium on Foundations of Computer Science, 2019
Publisher: {IEEE} Computer Society
DOI: 10.1109/focs.2019.00020

Separating Two-Round Secure Computation From Oblivious Transfer

Author(s): Benny Applebaum, Zvika Brakerski, Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan
Published in: 2020
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.itcs.2020.71

Upslices, Downslices, and Secret-Sharing with Complexity of 1.5n

Author(s): Benny Applebaum, Oded Nir
Published in: 2021
Publisher: Springer
DOI: 10.1007/978-3-030-84252-9_21

On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate

Author(s): Benny Applebaum, Barak Arkis
Published in: Theory of Cryptography - 16th International Conference, 2018
Publisher: Springer
DOI: 10.1007/978-3-030-03807-6_12

The Communication Complexity of Private Simultaneous Messages, Revisited

Author(s): Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz
Published in: 2018, Page(s) 261-286
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-78375-8_9

Low-Complexity Cryptographic Hash Functions

Author(s): Applebaum, Benny ; Haramaty-Krasne, Naama ; Ishai, Yuval ; Kushilevitz, Eyal ; Vaikuntanathan, Vinod
Published in: 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 2017, Page(s) 7:1--7:31, ISBN 978-3-95977-029-3
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ITCS.2017.7

Algebraic attacks against random local functions and their countermeasures

Author(s): Benny Applebaum, Shachar Lovett
Published in: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016, 2016, Page(s) 1087-1100, ISBN 9781-450341325
Publisher: ACM Press
DOI: 10.1145/2897518.2897554

Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations

Author(s): Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan
Published in: Annual International Cryptology Conference CRYPTO 2017: Advances in Cryptology – CRYPTO 2017, 2017, Page(s) 727-757
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-63688-7_24

Exponentially-Hard Gap-CSP and Local PRG via Local Hardcore Functions

Author(s): Benny Applebaum
Published in: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, Page(s) 836-847, ISBN 978-1-5386-3464-6
Publisher: IEEE
DOI: 10.1109/focs.2017.82

Secure Arithmetic Computation with Constant Computational Overhead

Author(s): Benny Applebaum, Ivan Damgård, Yuval Ishai, Michael Nielsen, Lior Zichron
Published in: Annual International Cryptology Conference CRYPTO 2017: Advances in Cryptology – CRYPTO 2017, 2017, Page(s) 223-254
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-63688-7_8

Perfect Secure Computation in Two Rounds

Author(s): Benny Applebaum, Zvika Brakerski, Rotem Tsabary
Published in: 2018
Publisher: Springer
DOI: 10.1007/978-3-030-03807-6_6

Degree 2 is Complete for the Round-Complexity of Malicious MPC

Author(s): Benny Applebaum, Zvika Brakerski, Rotem Tsabary
Published in: 2019
Publisher: Springer
DOI: 10.1007/978-3-030-17656-3_18

On Actively-Secure Elementary MPC Reductions

Author(s): Benny Applebaum, Aarushi Goel
Published in: 2021
Publisher: Springer
DOI: 10.1007/978-3-030-90459-3_24

On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs

Author(s): Benny Applebaum, Eyal Golombek
Published in: 2021
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.itc.2021.4

Peer reviewed articles (13)

The Communication Complexity of Private Simultaneous Messages, Revisited

Author(s): Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz
Published in: J. Cryptol., 2020, ISSN 1432-1378
Publisher: Springer
DOI: 10.1007/s00145-019-09334-y

Obfuscating Circuits Via Composite-Order Graded Encoding

Author(s): Benny Applebaum, Zvika Brakerski
Published in: J. Cryptol., 2021, ISSN 1432-1378
Publisher: Springer
DOI: 10.1007/s00145-021-09378-z

d -Uniform Secret Sharing and CDS with Constant Information Rate

Author(s): Benny Applebaum; Barak Arkis
Published in: ACM Transactions on Computation Theory, Issue 1, 2020, ISSN 1942-3454
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3417756

Algebraic Attacks against Random Local Functions and Their Countermeasures

Author(s): Benny Applebaum, Shachar Lovett
Published in: SIAM Journal on Computing, Issue 47/1, 2018, Page(s) 52-79, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/16M1085942

Cryptographic Hardness of Random Local Functions

Author(s): Benny Applebaum
Published in: computational complexity, Issue 25/3, 2016, Page(s) 667-722, ISSN 1016-3328
Publisher: Birkhauser Verlag
DOI: 10.1007/s00037-015-0121-8

From Private Simultaneous Messages to Zero-Information Arthur–Merlin Protocols and Back

Author(s): Benny Applebaum, Pavel Raykov
Published in: Journal of Cryptology, 2016, ISSN 0933-2790
Publisher: Springer Verlag
DOI: 10.1007/s00145-016-9239-3

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions

Author(s): Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang
Published in: computational complexity, Issue 25/2, 2016, Page(s) 349-418, ISSN 1016-3328
Publisher: Birkhauser Verlag
DOI: 10.1007/s00037-016-0128-9

Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings

Author(s): Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
Published in: Journal of Cryptology, 2016, ISSN 0933-2790
Publisher: Springer Verlag
DOI: 10.1007/s00145-016-9244-6

Arithmetic Cryptography

Author(s): Benny Applebaum, Jonathan Avron, Chris Brzuska
Published in: Journal of the ACM, Issue 64/2, 2017, Page(s) 1-74, ISSN 0004-5411
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3046675

Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations

Author(s): Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan
Published in: SIAM J. Comput., 2021, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/18m1217097

Perfect Secure Computation in Two Rounds

Author(s): Benny Applebaum, Zvika Brakerski, and Rotem Tsabary
Published in: SIAM J. Comput., 2021, ISSN 1095-7111
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m1272044

On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings

Author(s): Benny Applebaum, Pavel Raykov
Published in: Comput. Complex., 2018, ISSN 1016-3328
Publisher: Birkhauser Verlag
DOI: 10.1007/s00037-018-0170-x

Conditional Disclosure of Secrets in the Communication Complexity Universe

Author(s): Benny Applebaum, Prashant Nalini Vasudevan
Published in: J. Cryptol., 2021, ISSN 1432-1378
Publisher: Springer
DOI: 10.1007/s00145-021-09376-1

Book chapters (3)

On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings

Author(s): Benny Applebaum, Pavel Raykov
Published in: Advances in Cryptology – CRYPTO 2016, 2016, Page(s) 449-477, ISBN 978-3-662-53015-3
Publisher: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-53015-3_16

Fast Pseudorandom Functions Based on Expander Graphs

Author(s): Benny Applebaum, Pavel Raykov
Published in: Theory of Cryptography, 2016, Page(s) 27-56, ISBN 978-3-662-53641-4
Publisher: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-53641-4_2

Garbled Circuits as Randomized Encodings of Functions: a Primer

Author(s): Benny Applebaum
Published in: Tutorials on the Foundations of Cryptography, 2017, Page(s) 1-44
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-57048-8_1