Cryptography with Low Complexity

Better secret sharing via robust conditional disclosure of secretsShare on

Autorzy: Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter
Opublikowane w: 2020
Wydawca: 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)

Autorzy: Benny Applebaum, Eliran Kachlon, Arpita Patra
Opublikowane w: 2020
Wydawca: Springer
DOI: 10.1007/978-3-030-64378-2_20

Placing Conditional Disclosure of Secrets in the Communication Complexity Universe

Autorzy: Applebaum, Benny ; Vasudevan, Prashant Nalini
Opublikowane w: 10th Innovations in Theoretical Computer Science Conference, 2018, ISBN 978-3-95977-095-8
Wydawca: 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

Autorzy: Benny Applebaum, Eliran Kachlon, Arpita Patra
Opublikowane w: 2020
Wydawca: IEEE
DOI: 10.1109/focs46700.2020.00121

Secret-Sharing Schemes for General and Uniform Access Structures.

Autorzy: Benny Applebaum, Amos Beimel, Oriol Farràs, Oded Nir, Naty Peter
Opublikowane w: 2019
Wydawca: Springer
DOI: 10.1007/978-3-030-17659-4_15

Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error

Autorzy: Benny Applebaum; Eliran Kachlon
Opublikowane w: 60th {IEEE} Annual Symposium on Foundations of Computer Science, 2019
Wydawca: {IEEE} Computer Society
DOI: 10.1109/focs.2019.00020

Separating Two-Round Secure Computation From Oblivious Transfer

Autorzy: Benny Applebaum, Zvika Brakerski, Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan
Opublikowane w: 2020
Wydawca: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.itcs.2020.71

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

Autorzy: Benny Applebaum, Oded Nir
Opublikowane w: 2021
Wydawca: 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

Autorzy: Benny Applebaum, Barak Arkis
Opublikowane w: Theory of Cryptography - 16th International Conference, 2018
Wydawca: Springer
DOI: 10.1007/978-3-030-03807-6_12

The Communication Complexity of Private Simultaneous Messages, Revisited

Autorzy: Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz
Opublikowane w: 2018, Strona(/y) 261-286
Wydawca: Springer International Publishing
DOI: 10.1007/978-3-319-78375-8_9

Low-Complexity Cryptographic Hash Functions

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

Algebraic attacks against random local functions and their countermeasures

Autorzy: Benny Applebaum, Shachar Lovett
Opublikowane w: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016, 2016, Strona(/y) 1087-1100, ISBN 9781-450341325
Wydawca: ACM Press
DOI: 10.1145/2897518.2897554

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

Autorzy: Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan
Opublikowane w: Annual International Cryptology Conference CRYPTO 2017: Advances in Cryptology – CRYPTO 2017, 2017, Strona(/y) 727-757
Wydawca: Springer International Publishing
DOI: 10.1007/978-3-319-63688-7_24

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

Autorzy: Benny Applebaum
Opublikowane w: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, Strona(/y) 836-847, ISBN 978-1-5386-3464-6
Wydawca: IEEE
DOI: 10.1109/focs.2017.82

Secure Arithmetic Computation with Constant Computational Overhead

Autorzy: Benny Applebaum, Ivan Damgård, Yuval Ishai, Michael Nielsen, Lior Zichron
Opublikowane w: Annual International Cryptology Conference CRYPTO 2017: Advances in Cryptology – CRYPTO 2017, 2017, Strona(/y) 223-254
Wydawca: Springer International Publishing
DOI: 10.1007/978-3-319-63688-7_8

Perfect Secure Computation in Two Rounds

Autorzy: Benny Applebaum, Zvika Brakerski, Rotem Tsabary
Opublikowane w: 2018
Wydawca: Springer
DOI: 10.1007/978-3-030-03807-6_6

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

Autorzy: Benny Applebaum, Zvika Brakerski, Rotem Tsabary
Opublikowane w: 2019
Wydawca: Springer
DOI: 10.1007/978-3-030-17656-3_18

On Actively-Secure Elementary MPC Reductions

Autorzy: Benny Applebaum, Aarushi Goel
Opublikowane w: 2021
Wydawca: Springer
DOI: 10.1007/978-3-030-90459-3_24

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

Autorzy: Benny Applebaum, Eyal Golombek
Opublikowane w: 2021
Wydawca: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.itc.2021.4

The Communication Complexity of Private Simultaneous Messages, Revisited

Autorzy: Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz
Opublikowane w: J. Cryptol., 2020, ISSN 1432-1378
Wydawca: Springer
DOI: 10.1007/s00145-019-09334-y

Obfuscating Circuits Via Composite-Order Graded Encoding

Autorzy: Benny Applebaum, Zvika Brakerski
Opublikowane w: J. Cryptol., 2021, ISSN 1432-1378
Wydawca: Springer
DOI: 10.1007/s00145-021-09378-z

d -Uniform Secret Sharing and CDS with Constant Information Rate

Autorzy: Benny Applebaum; Barak Arkis
Opublikowane w: ACM Transactions on Computation Theory, Numer 1, 2020, ISSN 1942-3454
Wydawca: Association for Computing Machinary, Inc.
DOI: 10.1145/3417756

Algebraic Attacks against Random Local Functions and Their Countermeasures

Autorzy: Benny Applebaum, Shachar Lovett
Opublikowane w: SIAM Journal on Computing, Numer 47/1, 2018, Strona(/y) 52-79, ISSN 0097-5397
Wydawca: Society for Industrial and Applied Mathematics
DOI: 10.1137/16M1085942

Cryptographic Hardness of Random Local Functions

Autorzy: Benny Applebaum
Opublikowane w: computational complexity, Numer 25/3, 2016, Strona(/y) 667-722, ISSN 1016-3328
Wydawca: Birkhauser Verlag
DOI: 10.1007/s00037-015-0121-8

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

Autorzy: Benny Applebaum, Pavel Raykov
Opublikowane w: Journal of Cryptology, 2016, ISSN 0933-2790
Wydawca: Springer Verlag
DOI: 10.1007/s00145-016-9239-3

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

Autorzy: Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang
Opublikowane w: computational complexity, Numer 25/2, 2016, Strona(/y) 349-418, ISSN 1016-3328
Wydawca: Birkhauser Verlag
DOI: 10.1007/s00037-016-0128-9

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

Autorzy: Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
Opublikowane w: Journal of Cryptology, 2016, ISSN 0933-2790
Wydawca: Springer Verlag
DOI: 10.1007/s00145-016-9244-6

Arithmetic Cryptography

Autorzy: Benny Applebaum, Jonathan Avron, Chris Brzuska
Opublikowane w: Journal of the ACM, Numer 64/2, 2017, Strona(/y) 1-74, ISSN 0004-5411
Wydawca: Association for Computing Machinary, Inc.
DOI: 10.1145/3046675

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

Autorzy: Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan
Opublikowane w: SIAM J. Comput., 2021, ISSN 0097-5397
Wydawca: Society for Industrial and Applied Mathematics
DOI: 10.1137/18m1217097

Perfect Secure Computation in Two Rounds

Autorzy: Benny Applebaum, Zvika Brakerski, and Rotem Tsabary
Opublikowane w: SIAM J. Comput., 2021, ISSN 1095-7111
Wydawca: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m1272044

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

Autorzy: Benny Applebaum, Pavel Raykov
Opublikowane w: Comput. Complex., 2018, ISSN 1016-3328
Wydawca: Birkhauser Verlag
DOI: 10.1007/s00037-018-0170-x

Conditional Disclosure of Secrets in the Communication Complexity Universe

Autorzy: Benny Applebaum, Prashant Nalini Vasudevan
Opublikowane w: J. Cryptol., 2021, ISSN 1432-1378
Wydawca: Springer
DOI: 10.1007/s00145-021-09376-1

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

Autorzy: Benny Applebaum, Pavel Raykov
Opublikowane w: Advances in Cryptology – CRYPTO 2016, 2016, Strona(/y) 449-477, ISBN 978-3-662-53015-3
Wydawca: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-53015-3_16

Fast Pseudorandom Functions Based on Expander Graphs

Autorzy: Benny Applebaum, Pavel Raykov
Opublikowane w: Theory of Cryptography, 2016, Strona(/y) 27-56, ISBN 978-3-662-53641-4
Wydawca: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-53641-4_2

Garbled Circuits as Randomized Encodings of Functions: a Primer

Autorzy: Benny Applebaum
Opublikowane w: Tutorials on the Foundations of Cryptography, 2017, Strona(/y) 1-44
Wydawca: Springer International Publishing
DOI: 10.1007/978-3-319-57048-8_1

Publikacje

Udostępnij tę stronę

Pobierz