Efficient Fully Homomorphic Encryption from (Standard) Z Brakerski, V Vaikuntanathan SIAM Journal on Computing 43 (2), 831-871, 2014 | 1814 | 2014 |

(Leveled) fully homomorphic encryption without bootstrapping Z Brakerski, C Gentry, V Vaikuntanathan ACM Transactions on Computation Theory (TOCT) 6 (3), 1-36, 2014 | 1189 | 2014 |

Fully homomorphic encryption from ring-LWE and security for key dependent messages Z Brakerski, V Vaikuntanathan Annual cryptology conference, 505-524, 2011 | 1142 | 2011 |

Fully homomorphic encryption without modulus switching from classical GapSVP Z Brakerski Annual Cryptology Conference, 868-886, 2012 | 843 | 2012 |

Classical hardness of learning with errors Z Brakerski, A Langlois, C Peikert, O Regev, D Stehlé Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 596 | 2013 |

Lattice-based FHE as secure as PKE Z Brakerski, V Vaikuntanathan Proceedings of the 5th conference on Innovations in theoretical computer …, 2014 | 306 | 2014 |

Overcoming the hole in the bucket: Public-key cryptography resilient to continual memory leakage Z Brakerski, YT Kalai, J Katz, V Vaikuntanathan 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 501-510, 2010 | 268 | 2010 |

Virtual black-box obfuscation for all circuits via generic graded encoding Z Brakerski, GN Rothblum Theory of Cryptography Conference, 1-25, 2014 | 243 | 2014 |

Packed ciphertexts in LWE-based homomorphic encryption Z Brakerski, C Gentry, S Halevi International Workshop on Public Key Cryptography, 1-13, 2013 | 212 | 2013 |

Circular and leakage resilient public-key encryption under subgroup indistinguishability Z Brakerski, S Goldwasser Annual Cryptology Conference, 1-20, 2010 | 195 | 2010 |

Hedged public-key encryption: How to protect against bad randomness M Bellare, Z Brakerski, M Naor, T Ristenpart, G Segev, H Shacham, ... International Conference on the Theory and Application of Cryptology and …, 2009 | 159 | 2009 |

Lattice-based fully dynamic multi-key FHE with short ciphertexts Z Brakerski, R Perlman Annual International Cryptology Conference, 190-213, 2016 | 127 | 2016 |

From selective to adaptive security in functional encryption P Ananth, Z Brakerski, G Segev, V Vaikuntanathan Annual Cryptology Conference, 657-677, 2015 | 124 | 2015 |

Obfuscating circuits via composite-order graded encoding B Applebaum, Z Brakerski Theory of Cryptography Conference, 528-556, 2015 | 104 | 2015 |

Function-private functional encryption in the private-key setting Z Brakerski, G Segev Journal of Cryptology 31 (1), 202-225, 2018 | 95 | 2018 |

Better security for deterministic public-key encryption: The auxiliary-input setting Z Brakerski, G Segev Journal of cryptology 27 (2), 210-247, 2014 | 92 | 2014 |

Constrained key-homomorphic PRFs from standard lattice assumptions Z Brakerski, V Vaikuntanathan Theory of Cryptography Conference, 1-30, 2015 | 83 | 2015 |

Circuit-ABE from LWE: unbounded attributes and semi-adaptive security Z Brakerski, V Vaikuntanathan Annual International Cryptology Conference, 363-384, 2016 | 78 | 2016 |

Black-box circular-secure encryption beyond affine functions Z Brakerski, S Goldwasser, YT Kalai Theory of Cryptography Conference, 201-218, 2011 | 76* | 2011 |

Obfuscating conjunctions Z Brakerski, GN Rothblum Journal of Cryptology 30 (1), 289-320, 2017 | 73 | 2017 |