Fetching the paper…
Reading the bibliography…
It has been a long standing problem to securely outsource computation tasks to an untrusted party with integrity and confidentiality guarantees.
R. L. Rivest, L. Adleman, and M. L. Dertouzos, “On data banks and privacy homomorphisms,” Foundations of secure computation , vol. 4, no. 11, pp. 169–180, 1978
1978
Earlier work this paper cites.
C.-K. Luk, R. Cohn, R. Muth, H. Patil, A. Klauser, G. Lowney, S. Wallace, V. J. Reddi, and K. Hazelwood, “Pin: building customized program analysis tools with dynamic instrumentation,” in Acm sigplan notices , vol. 40, no. 6. ACM, 2005, pp. 190–200
2005
Earlier work this paper cites.
C. Gentry, “Fully homomorphic encryption using ideal lattices,” in Proceedings of the 41st annual ACM symposium on Symposium on theory of computing-STOC’09 . ACM Press, 2009, pp. 169–169
2009
Earlier work this paper cites.
B. Coppens, I. Verbauwhede, K. D. Bosschere, and B. D. Sutter, “Practical mitigations for timing-based side-channel attacks on modern x86 processors,” in IEEE Symposium on Security and Privacy (SP) , 2009
2009
Earlier work this paper cites.
N. P. Smart and F. Vercauteren, “Fully homomorphic encryption with relatively small key and ciphertext sizes,” in International Workshop on Public Key Cryptography . Springer, 2010, pp. 420–443
2010
Earlier work this paper cites.
D. Stehlé and R. Steinfeld, “Faster fully homomorphic encryption,” in International Conference on the Theory and Application of Cryptology and Information Security . Springer, 2010, pp. 377–394
2010
Earlier work this paper cites.
C. Gentry and S. Halevi, “Implementing gentry’s fully-homomorphic encryption scheme,” in Annual international conference on the theory and applications of cryptographic techniques . Springer, 2011, pp. 129–148
2011
Earlier work this paper cites.
C. Gentry and S. Halevi, “Fully homomorphic encryption without squashing using depth-3 arithmetic circuits,” in Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on . IEEE, 2011, pp. 107–109
2011
Earlier work this paper cites.
Z. Brakerski and V. Vaikuntanathan, “Fully homomorphic encryption from ring-lwe and security for key dependent messages,” in Annual cryptology conference . Springer, 2011, pp. 505–524
2011
Earlier work this paper cites.
J. Fan and F. Vercauteren, “Somewhat practical fully homomorphic encryption.” IACR Cryptology ePrint Archive , vol. 2012, p. 144, 2012
2012
Earlier work this paper cites.
C. Gentry, S. Halevi, and N. P. Smart, “Better bootstrapping in fully homomorphic encryption,” in International Workshop on Public Key Cryptography . Springer, 2012, pp. 1–16
2012
Earlier work this paper cites.
——, “Fully homomorphic encryption with polylog overhead,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques . Springer, 2012, pp. 465–482
2012
Earlier work this paper cites.
Z. Brakerski, “Fully homomorphic encryption without modulus switching from classical gapsvp,” in Advances in cryptology–crypto 2012 . Springer, 2012, pp. 868–886
2012
Earlier work this paper cites.
F. McKeen, I. Alexandrovich, A. Berenzon, C. V. Rozas, H. Shafi, V. Shanbhogue, and U. R. Savagaonkar, “Innovative instructions and software model for isolated execution.” HASP@ ISCA , vol. 10, 2013
2013
Earlier work this paper cites.
C. Gentry, A. Sahai, and B. Waters, “Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based,” in Advances in Cryptology–CRYPTO 2013 . Springer, 2013, pp. 75–92
2013
Earlier work this paper cites.
Z. Brakerski, C. Gentry, and V. Vaikuntanathan, “(leveled) fully homomorphic encryption without bootstrapping,” ACM Transactions on Computation Theory (TOCT) , vol. 6, no. 3, p. 13, 2014
2014
Earlier work this paper cites.
——, “Efficient fully homomorphic encryption from (standard) lwe,” SIAM Journal on Computing , vol. 43, no. 2, pp. 831–871, 2014
2014
Earlier work this paper cites.
Z. D. Stephens, S. Y. Lee, F. Faghri, R. H. Campbell, C. Zhai, M. J. Efron, R. Iyer, M. C. Schatz, S. Sinha, and G. E. Robinson, “Big data: astronomical or genomical?” PLoS Biol , vol. 13, no. 7, p. e1002195, 2015
2015
Earlier work this paper cites.
Y. Xu, W. Cui, and M. Peinado, “Controlled-channel attacks: Deterministic side channels for untrusted operating systems,” in IEEE Symposium on Security and Privacy (SP) . IEEE, 2015, pp. 640–656
2015
Earlier work this paper cites.
S. Halevi and V. Shoup, “Bootstrapping for helib,” in Annual International conference on the theory and applications of cryptographic techniques . Springer, 2015, pp. 641–670
2015
Earlier work this paper cites.
W. Dai and B. Sunar, “cuhe: A homomorphic encryption accelerator library,” in International Conference on Cryptography and Information Security in the Balkans . Springer, 2015, pp. 169–186
2015
Earlier work this paper cites.
L. Ducas and D. Micciancio, “Fhew: bootstrapping homomorphic encryption in less than a second,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques . Springer, 2015, pp. 617–640
2015
Earlier work this paper cites.
M. Andrysco, D. Kohlbrenner, K. Mowery, R. Jhala, S. Lerner, and H. Shacham, “On subnormal floating point and abnormal timing,” in IEEE Symposium on Security and Privacy (SP) . IEEE, 2015, pp. 623–639
2015
Earlier work this paper cites.
F. Schuster, M. Costa, C. Fournet, C. Gkantsidis, M. Peinado, G. Mainar-Ruiz, and M. Russinovich, “Vc3: Trustworthy data analytics in the cloud using sgx,” in IEEE Symposium on Security and Privacy (SP) . IEEE, 2015, pp. 38–54
2015
Earlier work this paper cites.
I. Chillotti, N. Gama, M. Georgieva, and M. Izabachène, “Tfhe: Fast fully homomorphic encryption library over the torus,” 2016
2016
Earlier work this paper cites.
O. Ohrimenko, F. Schuster, C. Fournet, A. Mehta, S. Nowozin, K. Vaswani, and M. Costa, “Oblivious multi-party machine learning on trusted processors.” in USENIX Security Symposium , 2016, pp. 619–636
2016
Cited alongside, same era.
I. Chillotti, N. Gama, M. Georgieva, and M. Izabachene, “Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds,” in International Conference on the Theory and Application of Cryptology and Information Security . Springer, 2016, pp. 3–33
2016
Cited alongside, same era.
P. Pessl, D. Gruss, C. Maurice, M. Schwarz, and S. Mangard, “Drama: Exploiting dram addressing for cross-cpu attacks.” in USENIX Security Symposium , 2016, pp. 565–581
2016
Cited alongside, same era.
D. Evtyushkin and D. Ponomarev, “Covert channels through random number generator: Mechanisms, capacity estimation and mitigations,” in Proceedings of the 2016 ACM SIGSAC conference on computer and communications security . ACM, 2016, pp. 843–857
2016
2017
Later among the works it cites.
2017
Later among the works it cites.
B. Fisch, D. Vinayagamurthy, D. Boneh, and S. Gorbunov, “Iron: functional encryption using intel sgx,” in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security . ACM, 2017, pp. 765–782
2017
Later among the works it cites.
C. Wang, Y. Jiang, N. Mohammed, F. Chen, X. Jiang, M. M. Al Aziz, M. N. Sadat, and S. Wang, “Scotch: Secure counting of encrypted genomic data using a hybrid approach,” in AMIA Annual Symposium Proceedings , vol. 2017. American Medical Informatics Association, 2017, p. 1744
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
F. Chen, M. Dow, S. Ding, Y. Lu, X. Jiang, H. Tang, and S. Wang, “Premix: Privacy-preserving estimation of individual admixture,” in AMIA Annual Symposium Proceedings , vol. 2016. American Medical Informatics Association, 2016, p. 1747
2016
Cited alongside, same era.
F. Chen, S. Wang, X. Jiang, S. Ding, Y. Lu, J. Kim, S. C. Sahinalp, C. Shimizu, J. C. Burns, V. J. Wright et al. , “Princess: Privacy-protecting rare disease international network collaboration via encryption through software guard extensions,” Bioinformatics , vol. 33, no. 6, pp. 871–878, 2016
2016
Cited alongside, same era.
D. Gupta, B. Mood, J. Feigenbaum, K. Butler, and P. Traynor, “Using intel software guard extensions for efficient two-party secure function evaluation,” in International Conference on Financial Cryptography and Data Security . Springer, 2016, pp. 302–318
2016
Cited alongside, same era.
K. A. Küçük, A. Paverd, A. Martin, N. Asokan, A. Simpson, and R. Ankele, “Exploring the use of intel sgx for secure many-party applications,” in Proceedings of the 1st Workshop on System Software for Trusted Execution . ACM, 2016, p. 5
2016
Cited alongside, same era.
W. Wang, G. Chen, X. Pan, Y. Zhang, X. Wang, V. Bindschaedler, H. Tang, and C. A. Gunter, “Leaky cauldron on the dark land: Understanding memory side-channel hazards in sgx,” in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security . ACM, 2017, pp. 2421–2434
2017
Cited alongside, same era.
D. Cousins, Y. Polyakov, K. Rohloff, G. Ryan, G. Sahu, H. Sajjadpour, and E. Savas, “The palisade lattice crypto library,” 2017
2017
Cited alongside, same era.
J. Van Bulck, N. Weichbrodt, R. Kapitza, F. Piessens, and R. Strackx, “Telling your secrets without page faults: Stealthy page table-based attacks on enclaved execution,” in Proceedings of the 26th USENIX Security Symposium. USENIX Association , 2017
2017
Cited alongside, same era.
A. Moghimi, G. Irazoqui, and T. Eisenbarth, “Cachezoom: How sgx amplifies the power of cache attacks,” in International Conference on Cryptographic Hardware and Embedded Systems . Springer, 2017, pp. 69–90
2017
Cited alongside, same era.
“Towards an open-source, formally-verified secure enclave,” https://keystone-enclave.org/files/dawn-nsf-2018-v5.pdf , accessed Aug. 5, 2018
2018
Later among the works it cites.
M. Taassori, A. Shafiee, and R. Balasubramonian, “Vault: Reducing paging overheads in sgx with efficient integrity verification structures,” in Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems . ACM, 2018, pp. 665–678
2018
Later among the works it cites.
K. Laine, “Simple encrypted arithmetic library-seal (v2.3.1),” Technical report, Tech. Rep., 2018
2018
Later among the works it cites.
“Idash privacy & security workshop 2017,” http://www.humangenomeprivacy.org/2017/ , accessed Aug. 5, 2018
2018
Later among the works it cites.
J. H. Cheon, K. Han, A. Kim, M. Kim, and Y. Song, “Bootstrapping for approximate homomorphic encryption,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques . Springer, 2018, pp. 360–384
2018
Later among the works it cites.
“Intel 64 and IA-32 architectures optimization reference manual,” https://software.intel.com/sites/default/files/managed/9e/bc/64-ia-32-architectures-optimization-manual.pdf , 2018, order Number: 248966-040, April 2018
2018
Later among the works it cites.
A. Al Badawi, Y. Polyakov, K. M. M. Aung, B. Veeravalli, and K. Rohloff, “Implementation and performance evaluation of rns variants of the bfv homomorphic encryption scheme.” IACR Cryptology ePrint Archive , vol. 2018, p. 589, 2018
2018
Later among the works it cites.
A. Al Badawi, B. Veeravalli, C. F. Mun, and K. M. M. Aung, “High-performance fv somewhat homomorphic encryption on gpus: An implementation using cuda,” IACR Transactions on Cryptographic Hardware and Embedded Systems , vol. 2018, no. 2, pp. 70–95, 2018
2018
Later among the works it cites.
B. Gras, K. Razavi, H. Bos, and C. Giuffrida, “Translation leak-aside buffer: Defeating cache side-channel protections with TLB attacks,” in 27th { \{ USENIX } \} Security Symposium ( { \{ USENIX } \} Security 18) . USENIX Association, 2018
2018
Later among the works it cites.
A. Moghimi, T. Eisenbarth, and B. Sunar, “Memjam: A false dependency attack against constant-time crypto implementations in sgx,” in Cryptographers’ Track at the RSA Conference . Springer, 2018, pp. 21–44
2018
Later among the works it cites.
S. van Schaik, C. Giuffrida, H. Bos, and K. Razavi, “Malicious management unit: Why stopping cache attacks in software is harder than you think,” in 27th USENIX Security Symposium (USENIX Security 18) . Baltimore, MD: USENIX Association, 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
J. V. Bulck, M. Minkin, O. Weisse, D. Genkin, B. Kasikci, F. Piessens, M. Silberstein, T. F. Wenisch, Y. Yarom, and R. Strackx, “Foreshadow: Extracting the keys to the intel SGX kingdom with transient out-of-order execution,” in 27th USENIX Security Symposium (USENIX Security 18) . Baltimore, MD: USENIX Association, 2018, p. 991–1008. [Online]. Available: https://www.usenix.org/conference/usenixsecurity18/presentation/bulck
2018
Later among the works it cites.
C. Priebe, K. Vaswani, and M. Costa, “Enclavedb: A secure database using sgx,” in IEEE Symposium on Security and Privacy (SP) , May 2018, pp. 264–278. [Online]. Available: doi.ieeecomputersociety.org/10.1109/SP.2018.00025
2018
Later among the works it cites.
Y. Jiang, J. Hamer, C. Wang, X. Jiang, M. Kim, Y. Song, Y. Xia, N. Mohammed, M. N. Sadat, and S. Wang, “Securelr: Secure logistic regression model via a hybrid cryptographic protocol,” IEEE/ACM Transactions on Computational Biology and Bioinformatics , 2018
2018
Later among the works it cites.
M. N. Sadat, X. Jiang, M. M. Al Aziz, S. Wang, and N. Mohammed, “Secure and efficient regression analysis using a hybrid cryptographic framework: Development and evaluation,” JMIR medical informatics , vol. 6, no. 1, 2018
2018
Later among the works it cites.
M. N. Sadat, M. M. Al Aziz, N. Mohammed, F. Chen, X. Jiang, and S. Wang, “Safety: Secure gwas in federated environment through a hybrid solution,” IEEE/ACM Transactions on Computational Biology and Bioinformatics , 2018
2018
Later among the works it cites.
M. Yan, R. Sprabery, B. Gopireddy, C. Fletcher, R. Campbell, and J. Torrellas, “Attack directories, not caches: Side channel attacks in a non-inclusive world,” in To appear in 2019 IEEE Symposium on Security and Privacy (SP) . IEEE
2019
Closest in time.