Fiat-Shamir: from practice to theory R Canetti, Y Chen, J Holmgren, A Lombardi, GN Rothblum, RD Rothblum, ...
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
216 2019 Watermarking cryptographic capabilities A Cohen, J Holmgren, R Nishimaki, V Vaikuntanathan, D Wichs
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
134 * 2016 Succinct garbling and indistinguishability obfuscation for RAM programs R Canetti, J Holmgren, A Jain, V Vaikuntanathan
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015
132 * 2015 Cryptographic hashing from strong one-way functions (or: One-way product functions and their applications) J Holmgren, A Lombardi
2018 IEEE 59th annual symposium on Foundations of Computer Science (FOCS …, 2018
87 2018 Non-interactive delegation and batch NP verification from standard computational assumptions Z Brakerski, J Holmgren, Y Kalai
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
84 * 2017 Towards doubly efficient private information retrieval R Canetti, J Holmgren, S Richelson
Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore …, 2017
81 2017 Time-and space-efficient arguments from groups of unknown order AR Block, J Holmgren, A Rosen, RD Rothblum, P Soni
Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021
77 2021 Fully succinct garbled RAM R Canetti, J Holmgren
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
74 2016 Fiat-Shamir from simpler assumptions R Canetti, Y Chen, J Holmgren, A Lombardi, GN Rothblum, RD Rothblum
Cryptology ePrint Archive, 2018
70 2018 Automated color selection using semantic knowledge C Havasi, R Speer, J Holmgren
2010 AAAI Fall Symposium Series, 2010
60 2010 Succinct adaptive garbled RAM R Canetti, Y Chen, J Holmgren, M Raykova
Cryptology ePrint Archive, 2015
53 * 2015 Delegating computations with (almost) minimal time and space overhead J Holmgren, R Rothblum
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
43 2018 Fiat–shamir via list-recoverable codes (or: parallel repetition of gmw is not zero-knowledge) J Holmgren, A Lombardi, RD Rothblum
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
42 2021 Public-coin zero-knowledge arguments with (almost) minimal time and space overheads AR Block, J Holmgren, A Rosen, RD Rothblum, P Soni
Theory of Cryptography Conference, 168-197, 2020
37 2020 Indistinguishability obfuscation for RAM programs and succinct randomized encodings N Bitansky, R Canetti, S Garg, J Holmgren, A Jain, H Lin, R Pass, ...
SIAM Journal on Computing 47 (3), 1123-1210, 2018
27 2018 Counterexamples to the low-degree conjecture J Holmgren, AS Wein
arXiv preprint arXiv:2004.08454, 2020
25 2020 On the (in) security of Kilian-based SNARGs J Bartusek, L Bronfman, J Holmgren, F Ma, RD Rothblum
Theory of Cryptography Conference, 522-551, 2019
22 2019 On the complexity of decomposable randomized encodings, or: How friendly can a garbling-friendly PRF be? M Ball, J Holmgren, Y Ishai, T Liu, T Malkin
11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020
20 2020 PPAD is as Hard as LWE and Iterated SquaringN Bitansky, AR Choudhuri, J Holmgren, C Kamath, A Lombardi, O Paneth, ...
Theory of Cryptography Conference, 593-622, 2022
13 2022 Faster Sounder Succinct Arguments and J Holmgren, RD Rothblum
Annual International Cryptology Conference, 474-503, 2022
12 2022 
Ran CanettiProfessor of Computer Science, Boston UniversityПодтвержден адрес электронной почты в домене bu.edu