Shai Halevi (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Shai Halevi" in English language version.

refsWebsite

Global rank English rank

9iacr.org

5,032^nd place

3,357^th place

3wikidata.org

43^rd place

161^st place

3scholar.google.com

1,697^th place

1,040^th place

3youtube.com

9^th place

13^th place

2doi.org

2^nd place

2semanticscholar.org

11^th place

8^th place

2github.com

383^rd place

320^th place

1mathgenealogy.org

4,501^st place

3,002^nd place

1dblp.org

low place

1ibm.com

1,131^st place

850^th place

1psu.edu

207^th place

136^th place

1wired.com

193^rd place

152^nd place

1stackexchange.com

1,983^rd place

1,330^th place

1arxiv.org

69^th place

59^th place

1handle.net

102^nd place

76^th place

1web.archive.org

1^st place

1sourceforge.net

1,669^th place

1,290^th place

arxiv.org

Canetti, Ran; Goldreich, Oded; Halevi, Shai (July 2004). "The Random Oracle Methodology, Revisited". J ACM. 51 (4). ACM: 557–594. arXiv:cs/0010019. doi:10.1145/1008731.1008734. hdl:2144/39024. S2CID 47061960.

dblp.org

Shai Halevi at DBLP Bibliography Server

doi.org

Sanjam Garg; Craig Gentry; Shai Halevi; Mariana Raykova; Amit Sahai; Brent Waters (2013). "Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. IEEE. pp. 40–49. CiteSeerX 10.1.1.672.1968. doi:10.1109/FOCS.2013.13. ISBN 978-0-7695-5135-7. S2CID 15703414.
Canetti, Ran; Goldreich, Oded; Halevi, Shai (July 2004). "The Random Oracle Methodology, Revisited". J ACM. 51 (4). ACM: 557–594. arXiv:cs/0010019. doi:10.1145/1008731.1008734. hdl:2144/39024. S2CID 47061960.

github.com

Shai Halevi; Victor Shoup. "HElib: An Implementation of homomorphic encryption". GitHub. Retrieved 31 December 2014.
"HElib: homomorphic-encryption software library". GitHub. 21 December 2022.

handle.net

hdl.handle.net

Canetti, Ran; Goldreich, Oded; Halevi, Shai (July 2004). "The Random Oracle Methodology, Revisited". J ACM. 51 (4). ACM: 557–594. arXiv:cs/0010019. doi:10.1145/1008731.1008734. hdl:2144/39024. S2CID 47061960.

iacr.org

eprint.iacr.org

M. van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan. Fully Homomorphic Encryption over the Integers. In EUROCRYPT 2010 (Springer)
C. Gentry and S. Halevi. Implementing Gentry's fully-homomorphic encryption scheme. In EUROCRYPT 2011 (Springer)
C. Gentry and S. Halevi. Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits. In FOCS 2011 (IEEE)
C. Gentry, S. Halevi, and N. P. Smart. Fully Homomorphic Encryption with Polylog Overhead. In EUROCRYPT 2012 (Springer)
C. Gentry, S. Halevi, and N. P. Smart. Better Bootstrapping in Fully Homomorphic Encryption. In PKC 2012 (Springer)
C. Gentry, S. Halevi, and N. P. Smart. Homomorphic Evaluation of the AES Circuit. In CRYPTO 2012 (Springer)
S. Halevi and V. Shoup. Algorithms in HElib. In CRYPTO 2014
S. Halevi and V. Shoup. Bootstrapping for HElib. In Cryptology ePrint Archive

iacr.org

"IACR Board of Directors (2013)". International Association for Cryptologic Research. Archived from the original on June 15, 2013. Retrieved January 7, 2015.

ibm.com

researcher.watson.ibm.com

"Pat Goldberg Memorial Best Papers in CS, EE and Math". 25 July 2016.

mathgenealogy.org

Shai Halevi at the Mathematics Genealogy Project

psu.edu

citeseerx.ist.psu.edu

Sanjam Garg; Craig Gentry; Shai Halevi; Mariana Raykova; Amit Sahai; Brent Waters (2013). "Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. IEEE. pp. 40–49. CiteSeerX 10.1.1.672.1968. doi:10.1109/FOCS.2013.13. ISBN 978-0-7695-5135-7. S2CID 15703414.

scholar.google.com

Shai Halevi publications indexed by Google Scholar
Sanjam Garg, Craig Gentry, and Shai Halevi. Candidate Multilinear Maps from Ideal Lattices. In EUROCRYPT 2013 (Springer)
Canetti, Ran; Goldreich, Oded; Halevi, Shai (July 2004). "The Random Oracle Methodology, Revisited". J ACM. 51 (4). ACM: 557–594. arXiv:cs/0010019. doi:10.1145/1008731.1008734. hdl:2144/39024. S2CID 47061960.

semanticscholar.org

api.semanticscholar.org

Sanjam Garg; Craig Gentry; Shai Halevi; Mariana Raykova; Amit Sahai; Brent Waters (2013). "Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. IEEE. pp. 40–49. CiteSeerX 10.1.1.672.1968. doi:10.1109/FOCS.2013.13. ISBN 978-0-7695-5135-7. S2CID 15703414.
Canetti, Ran; Goldreich, Oded; Halevi, Shai (July 2004). "The Random Oracle Methodology, Revisited". J ACM. 51 (4). ACM: 557–594. arXiv:cs/0010019. doi:10.1145/1008731.1008734. hdl:2144/39024. S2CID 47061960.

sourceforge.net

"websubrev: Web Submission and Review Software". 13 June 2018.

stackexchange.com

crypto.stackexchange.com

"What are Cryptographic Multi-linear Maps?". 2014-05-13.

web.archive.org

"IACR Board of Directors (2013)". International Association for Cryptologic Research. Archived from the original on June 15, 2013. Retrieved January 7, 2015.

wikidata.org

Shai Halevi at the Mathematics Genealogy Project
Shai Halevi at DBLP Bibliography Server
Shai Halevi publications indexed by Google Scholar

wired.com

Klarreich, Erica (2014-02-03). "Cryptography Breakthrough Could Make Software Unhackable". Quanta Magazine.

youtube.com

Fully Homomorphic Encryption. Tutorial in the Winter School on Secure Computation and Efficiency, Bar-Ilan University, 2011.
Fully Homomorphic Encryption. Tutorial in CRYPTO 2011, UC Santa-Barbara
Fully Homomorphic Encryption. Invited lecture at the UCI Workshop on Lattices with Symmetry