Controlled functional encryption

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2014, Pages 1280-1291

  Naveed, Muhammad ^a   Agrawal, Shashank ^a   Prabhakaran, Manoj ^a   Wang, Xiaofeng ^b   Ayday, Erman ^c   Hubaux, Jean Pierre ^c   Gunter, Carl A ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b INDIANA UNIVERSITY   (United States)

^c EPFL   (Switzerland)

Author keywords

Computation over encrypted data; Fine grained data control; Functional encryption

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY;

APPLICATION SCENARIO; DATA CONTROL; ENCRYPTED DATA; FUNCTIONAL ENCRYPTIONS; GARBLED CIRCUITS; PUBLIC-KEY ENCRYPTION; SECURE MULTI-PARTY COMPUTATION; USABILITY REQUIREMENTS;

FUNCTION EVALUATION;

EID: 84910663111     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2660267.2660291     Document Type: Conference Paper

References (61)

1. Cancer facts and statistics. http://www.cancer.org/research/cancerfactsstatistics/.
2. A combinational multiplier using the xilinx spartan ii fpga. http://ecen3233.okstate.edu/PDF/Labs/Combinational%20Multiplier.pdf .
3. Fast facts on US hospitals. http://www.aha.org/research/rc/stat-studies/fast-facts.shtml.
4. Havasupai tribe and the lawsuit settlement aftermath. http://genetics.ncai.org/case-study/havasupai-Tribe.cfm.
5. Indian tribe wins fight to limit research of its dna. http://www.nytimes.com/2010/04/22/us/22dna.html?pagewanted=all&-r=1&.
6. List of genetic diseases with associated genes and snp's. http://www.eupedia.com/genetics/genetic-diseases.shtml.
7. Tpm reset attack. http://www.cs.dartmouth.edu/~pkilab/sparks/.
8. S. Agrawal, S. Gurbanov, V. Vaikuntanathan, and H. Wee. Functional encryption: New perspectives and lower bounds. In Crypto, 2013.
9. M. J. Atallah and J. Li. Secure outsourcing of sequence comparisons. International Journal of Information Security, 4(4):277-287, 2005.
10. E. Ayday, J. L. Raisaro, and J.-P. Hubaux. Privacy-enhancing technologies for medical tests using genomic data. In NDSS, 2013.
11. E. Ayday, J. L. Raisaro, P. J. McLaren, J. Fellay, and J.-P. Hubaux. Privacy-preserving computation of disease risk by using genomic, clinical, and environmental data. In HealthTech, 2013.
12. E. Ayday, J. L. Raisaro, J. Rougemont, and J.-P. Hubaux. Protecting and evaluating genomic privacy in medical tests and personalized medicine. In WPES, 2013.
13. P. Baldi, R. Baronio, E. De Cristofaro, P. Gasti, and G. Tsudik. Countering gattaca: efficient and secure testing of fully-sequenced human genomes. In CCS, pages 691-702, 2011.
14. M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations among notions of security for public-key encryption schemes. In CRYPTO '98, number 1462, pages 26-45.
15. M. Bellare, V. T. Hoang, and P. Rogaway. Foundations of garbled circuits. In CCS, pages 784-796, 2012.
16. M. Bellare and P. Rogaway. Optimal asymmetric encryption. In EUROCRYPT, pages 92-111, 1995.
17. J. Bethencourt, A. Sahai, and B. Waters. Ciphertext-policy attribute-based encryption. In IEEE S&P, pages 321-334, 2007.
18. M. Blanton, M. J. Atallah, K. B. Frikken, and Q. Malluhi. Secure and efficient outsourcing of sequence comparisons. In ESORICS, pages 505-522. 2012.
19. D. Boneh, A. Sahai, and B. Waters. Functional encryption: Definitions and challenges. In TCC, pages 253-273, 2011.
20. F. Bruekers, S. Katzenbeisser, K. Kursawe, and P. Tuyls. Privacy-preserving matching of DNA profiles. IACR Cryptology ePrint Archive, 2008:203, 2008.
21. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In FOCS, pages 136-145, 2001.
22. H. Carter, C. Amrutkar, I. Dacosta, and P. Traynor. For your phone only: custom protocols for efficient secure function evaluation on mobile devices. SCN, 2013.
23. H. Carter, B. Mood, P. Traynor, and K. Butler. Secure outsourced garbled circuit evaluation for mobile devices. In USENIX Security, pages 289-304, 2013.
24. K.-M. Chung, J. Katz, and H.-S. Zhou. Functional encryption from (small) hardware tokens. In ASIACRYPT, pages 120-139. 2013.
25. E. De Cristofaro, S. Faber, P. Gasti, and G. Tsudik. Genodroid: are privacy-preserving genomic tests ready for prime time? In WPES, pages 97-108, 2012.
26. D. Eppstein, M. T. Goodrich, and P. Baldi. Privacy-enhanced methods for comparing compressed DNA sequences. arXiv preprint arXiv:1107.3593, 2011.
27. E. Fujisaki, T. Okamoto, D. Pointcheval, and J. Stern. RSA-OAEP is secure under the RSA assumption. In CRYPTO, number 2139, pages 260-274. Jan. 2001.
28. S. Garg, C. Gentry, S. Halevi, M. Raykova, A. Sahai, and B. Waters. Candidate indistinguishability obfuscation and functional encryption for all circuits. STOC, pages 40-49, 2013.
29. S. Garg, C. Gentry, S. Halevi, A. Sahai, and B. Waters. Attribute-based encryption for circuits from multilinear maps. In CRYPTO 2013, number 8043, pages 479-499. 2013.
30. S. Goldwasser, Y. Kalai, R. A. Popa, V. Vaikuntanathan, and N. Zeldovich. Reusable garbled circuits and succinct functional encryption. In STOC, pages 555-564, 2013.
31. S. Gorbunov, V. Vaikuntanathan, and H. Wee. Functional encryption with bounded collusions from multiparty computation. In CRYPTO, 2012.
32. S. Gorbunov, V. Vaikuntanathan, and H. Wee. Functional encryption with bounded collusions via multi-party computation. In CRYPTO, pages 162-179. 2012.
33. S. Gorbunov, V. Vaikuntanathan, and H. Wee. Attribute-based encryption for circuits. In STOC, pages 545-554, 2013.
34. V. Goyal, O. Pandey, A. Sahai, and B. Waters. Attribute-based encryption for fine-grained access control of encrypted data. In CCS, pages 89-98, 2006.
35. Y. Huang, D. Evans, and J. Katz. Private set intersection: Are garbled circuits better than custom protocols. In NDSS, 2012.
36. Y. Huang, D. Evans, J. Katz, and L. Malka. Faster secure two-party computation using garbled circuits. In USENIX Security, volume 201, 2011.
37. Y. Huang, J. Katz, and D. Evans. Quid-pro-quo-tocols: Strengthening semi-honest protocols with dual execution. In IEEE S&P, pages 272-284, 2012.
38. Y. Huang, J. Katz, and D. Evans. Efficient secure two-party computation using symmetric cut-and-choose. In CRYPTO, pages 18-35. 2013.
39. Y. Ishai. Randomization techniques for secure computation. Secure Multi-Party Computation, 10:222-248, 2013.
40. S. Jha, L. Kruger, and V. Shmatikov. Towards practical privacy for genomic computation. In IEEE S&P, pages 216-230, 2008.
41. A. Joux. Faster index calculus for the medium prime case application to 1175-bit and 1425-bit finite fields. In EUROCRYPT, pages 177-193, 2013.
42. S. Kamara, P. Mohassel, and M. Raykova. Outsourcing multi-party computation. IACR Cryptology ePrint Archive, 2011:272, 2011.
43. S. Kamara, P. Mohassel, and B. Riva. Salus: a system for server-aided secure function evaluation. In CCS, pages 797-808, 2012.
44. J. Katz, A. Sahai, and B. Waters. Predicate encryption supporting disjunctions, polynomial equations, and inner products. In EUROCRYPT, pages 146-162, 2008.
45. B. Kreuter, B. Mood, A. Shelat, and K. Butler. Pcf: A portable circuit format for scalable two-party secure computation. USENIX Security, 2013.
46. B. Kreuter, A. Shelat, and C.-H. Shen. Billion-gate secure computation with malicious adversaries. In USENIX Security, pages 14-14, 2012.
47. Y. Lindell. Fast cut-and-choose based protocols for malicious and covert adversaries. In CRYPTO, pages 1-17. 2013.
48. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay-secure two-party computation system. In USENIX Security, pages 287-302, 2004.
49. A. Manichaikul, J. C. Mychaleckyj, S. S. Rich, K. Daly, M. Sale, and W.-M. Chen. Robust relationship inference in genome-wide association studies. Bioinformatics, 26(22):2867-2873, 2010.
50. V. Nikolaenko, S. Ioannidis, U. Weinsberg, M. Joye, N. Taft, and D. Boneh. Privacy-preserving matrix factorization. In CCS, pages 801-812, 2013.
51. V. Nikolaenko, U. Weinsberg, S. Ioannidis, M. Joye, D. Boneh, and N. Taft. Privacy-preserving ridge regression on hundreds of millions of records. In IEEE S&P, pages 334-348, 2013.
52. T. Okamoto and K. Takashima. Fully secure functional encryption with general relations from the decisional linear assumption. In CRYPTO 2010, number 6223, pages 191-208. 2010.
53. A. O'Neill. Definitional issues in functional encryption. Cryptology ePrint Archive, Report 2010/556, 2010.
54. C. Peikert, V. Vaikuntanathan, and B. Waters. A framework for efficient and composable oblivious transfer. In CRYPTO 2008, number 5157, pages 554-571. 2008.
55. M. Prabhakaran and M. Rosulek. Rerandomizable rcca encryption. In CRYPTO, pages 517-534, 2007.
56. A. Sahai and H. Seyalioglu. Worry-free encryption: functional encryption with public keys. In CCS, pages 463-472, 2010.
57. A. Sahai and B. Waters. Fuzzy identity-based encryption. In EUROCRYPT, pages 457-473, 2005.
58. D. Szajda, M. Pohl, J. Owen, B. G. Lawson, and V. Richmond. Toward a practical data privacy scheme for a distributed implementation of the smith-waterman genome sequence comparison algorithm. In NDSS, 2006.
59. R. Wang, X. Wang, Z. Li, H. Tang, M. K. Reiter, and Z. Dong. Privacy-preserving genomic computation through program specialization. In CCS, pages 338-347, 2009.
60. A. C.-C. Yao. How to generate and exchange secrets. In FOCS, pages 162-167, 1986.
61. S. Zahur and D. Evans. Circuit structures for improving efficiency of security and privacy tools. In IEEE S&P, pages 493-507, 2013.