( en | de | ru )

 

Disambiguation of "Applebaum, Benny"

Author of the publication

copydeleteadd this publication to your clipboard
Randomly Encoding Functions: A New Cryptographic Paradigm - (Invited Talk).

. ICITS, volume 6673 of Lecture Notes in Computer Science, page 25-31. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Benny Hartono

Benny Sebastian

Benny Dobbriner

Benny Bürger

Benny Pock

 

Other publications of authors with the same name

On Pseudorandom Generators with Linear Stretch in NC0., , and . Comput. Complex., 17 (1): 38-69 (2008)Semantic Security under Related-Key Attacks and Applications., , and . ICS, page 45-60. Tsinghua University Press, (2011)Cryptography in Constant Parallel Time.. Information Security and Cryptography Springer, (2014)Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract)., , and . TCC (2), volume 13748 of Lecture Notes in Computer Science, page 103-120. Springer, (2022)On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate., and . TCC (1), volume 11239 of Lecture Notes in Computer Science, page 317-344. Springer, (2018)On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs., and . ITC, volume 199 of LIPIcs, page 4:1-4:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Secret Sharing, Slice Formulas, and Monotone Real Circuits., , , , and . ITCS, volume 215 of LIPIcs, page 8:1-8:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Actively Secure Arithmetic Computation and VOLE with Constant Computational Overhead., and . EUROCRYPT (2), volume 14005 of Lecture Notes in Computer Science, page 190-219. Springer, (2023)Computationally Private Randomizing Polynomials and Their Applications., , and . CCC, page 260-274. IEEE Computer Society, (2005)The Cryptographic Hardness of Random Local Functions - Survey.. IACR Cryptology ePrint Archive, (2015)