Bootstrapping for BGV and BFV Revisited

Fully homomorphic encryption using ideal lattices

Craig Gentry · 2009 · 6.6K citations

Computing, Computer Engineering, Computer Science +12

(Leveled) fully homomorphic encryption without bootstrapping

Zvika Brakerski, Craig Gentry, Vinod Vaikuntanathan · 2012 · 1.7K citations

Computing, Computer Engineering, Computer Science +13

A secure and optimally efficient multi‐authority election scheme

Ronald Cramer, Rosario Gennaro, Berry Schoenmakers · European Transactions on Telecommunications · 1997 · 790 citations

Computing, Computer Science, Cryptography +13

Fully homomorphic SIMD operations

Nigel P. Smart, Fréderik Vercauteren · Designs Codes and Cryptography · 2012 · 644 citations · Full text

Computing, Computer Engineering, Computer Science +5

On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials

Michael S. Paterson, Larry J. Stockmeyer · SIAM Journal on Computing · 1973 · 306 citations

Computing, Computer Science, Mathematics +14