( en | de | ru )

 

Disambiguation of "Brakerski, Zvika"

Author of the publication

copydeleteadd this publication to your clipboard
Brief Announcement: Zero-Knowledge Protocols for Search Problems.

, and . ICALP, volume 107 of LIPIcs, page 105:1-105:5. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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.

No persons found for author name Brakerski, Zvika
add a person with the name Brakerski, Zvika
 

Other publications of authors with the same name

A Parallel Repetition Theorem for Leakage Resilience., and . TCC, volume 7194 of Lecture Notes in Computer Science, page 248-265. Springer, (2012)Targeted Homomorphic Attribute-Based Encryption., , , and . TCC (B2), volume 9986 of Lecture Notes in Computer Science, page 330-360. (2016)On Statistically Secure Obfuscation with Approximate Correctness., , and . CRYPTO (2), volume 9815 of Lecture Notes in Computer Science, page 551-578. Springer, (2016)Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts., and . CRYPTO (1), volume 9814 of Lecture Notes in Computer Science, page 190-213. Springer, (2016)Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions., , and . EUROCRYPT (2), volume 9666 of Lecture Notes in Computer Science, page 852-880. Springer, (2016)Efficient fully homomorphic encryption from (standard) LWE, and . SIAM Journal on Computing, 43 (2): 831--871 (2014)Fast Interactive Coding against Adversarial Noise., , and . J. ACM, 61 (6): 35:1-35:30 (2014)Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE., and . ITCS, volume 215 of LIPIcs, page 28:1-28:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On the computational hardness needed for quantum cryptography., , and . CoRR, (2022)On the Hardness of Average-Case k-SUM., , and . APPROX-RANDOM, volume 207 of LIPIcs, page 29:1-29:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)