Garbled computation in cloud

Future Generation Computer Systems

Volumn 62, Issue , 2016, Pages 54-65

  Wang, Yongge ^a   Malluhi, Qutaibah M ^b   Khan, Khaled MD ^b,c  

^a UNIVERSITY OF NORTH CAROLINA AT CHARLOTTE   (United States)

^b Qatar University   (Qatar)

^c QATAR UNIVERSITY   (Qatar)

Author keywords

Cloud computing; Garbled circuits; Reusable garbled computation

Indexed keywords

CLOUD COMPUTING; DATA HANDLING; DATA PRIVACY;

APPROPRIATE TECHNIQUES; COMPUTATION ENVIRONMENTS; COMPUTATION TECHNIQUES; DATA ENCRYPTION; FULLY HOMOMORPHIC ENCRYPTION; GARBLED CIRCUITS; MODERN TECHNOLOGIES; PERFECT FORWARD SECRECY;

CRYPTOGRAPHY;

EID: 84950159689     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.future.2015.11.004     Document Type: Article

References (25)

1. [1] D. Borthakur, The hadoop distributed file system: Architecture and design. Hadoop Project Website, 11:21, 2007.
2. [2] Yao, A., How to generate and exchange secrets. Proc. 27th IEEE FOCS, 1986, IEEE, 162–167.
3. [3] Goldwasser, S., Kalai, Y., Popa, R., Vaikuntanathan, V., Zeldovich, N., Reusable garbled circuits and succinct functional encryption. Proc. 45th STOC, 2013, ACM, 555–564.
4. [4] Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B., Candidate indistinguishability obfuscation and functional encryption for all circuits. Proc. IEEE 54th FOCS, 2013, IEEE, 40–49.
5. [5] Brakerski, Z., Rothblum, G., Virtual black-box obfuscation for all circuits via generic graded encoding. Theory of Cryptography, 2014, Springer, 1–25.
6. [6] Barak, B., Garg, S., Kalai, Y.T., Paneth, O., Sahai, A., Protecting obfuscation against algebraic attacks. EUROCRYPT 2014, 2014, Springer, 221–238.
7. [7] Pass, R., Seth, K., Telang, S., Indistinguishability obfuscation from semantically-secure multilinear encodings. CRYPTO 2014, 2014, Springer.
8. [8] C. Gentry, Fully homomorphic encryption using ideal lattices, in: Proc. ACM STOC 2009, 2009, pp. 169–178.
9. [9] Gorbunov, S., Vaikuntanathan, V., Wee, H., Attribute-based encryption for circuits. Proc. 45th ACM STOC, 2013, ACM, 545–554.
10. [10] Garg, S., Gentry, C., Halevi, S., Sahai, A., Waters, B., Attribute-based encryption for circuits from multilinear maps. Proc. CRYPTO 2013, 2013, Springer, 479–499.
11. [11] Goldwasser, S., Kalai, Y., Popa, R., Vaikuntanathan, V., Zeldovich, N., How to run Turing machines on encrypted data. Proc. CRYPTO 2013, 2013, Springer, 536–553.
12. [12] Garg, S., Gentry, C., Sahai, A., Waters, B., Witness encryption and its applications. Proc. 45th ACM STOC, 2013, ACM, 467–476.
13. [13] Bitansky, N., Canetti, R., Chiesa, A., Tromer, E., Recursive composition and bootstrapping for snarks and proof-carrying data. Proc. 45th ACM STOC, 2013, ACM, 111–120.
14. [14] Halevi, S., Shoup, V., Algorithms in helib. Proc. Crypto 2014 LNCS, vol. 8616, 2014, 554–571.
15. [15] Halevi, S., Shoup, V., Bootstrapping for HElib. EUROCRYPT 2015, 2015, Springer, 641–670.
16. [16] L. Ducas, D. Micciancio, FHE bootstrapping in less than a second. IACR ePrint 2014/816, 2014.
17. [17] Lindell, Y., Pinkas, B., A proof of security of Yao's protocol for two-party computation. J. Cryptol. 22:2 (2009), 161–188.
18. [18] Bellare, M., Hoang, V., Rogaway, P., Foundations of garbled circuits. Proc. 2012 ACM CCS, 2012, ACM, 784–796.
19. [19] Y. Wang, Random linear code based public key encryption scheme RLCE, 2016, pp. 1–12. Cryptology ePrint Archive: Report 2015/298. Available at https://eprint.iacr.org/2015/298.pdf.
20. [20] Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S., Yang, K., On the (im) possibility of obfuscating programs. Proc. CRYPTO 2001, 2001, Springer, 1–18.
21. [21] Goldwasser, S., Kalai, Y., On the impossibility of obfuscation with auxiliary input. Proc. 46th IEEE FOCS, 2005, IEEE, 553–562.
22. [22] Wee, H., On obfuscating point functions. Proc. 37 ACM STOC, 2005, ACM, 523–532.
23. [23] B. Kreuter, A. Shelat, C. Shen, Billion-gate secure computation with malicious adversaries, in: USENIX Security Symposium, 2012, pp. 285–300.
24. [24] Kolesnikov, V., Schneider, T., A practical universal circuit construction and secure evaluation of private functions. Financial Cryptography, 2008, Springer, 83–97.
25. [25] Valiant, L., Universal circuits. Proc. 8th ACM STOC, 1976, ACM, 196–203.