Information-flow types for homomorphic encryptions

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2011, Pages 351-360

  Fournet, Cédric ^a   Planul, Jérémy ^b   Rezk, Tamara ^c  

^a MICROSOFT RESEARCH   (United States)

^b MSR INRIA   (United States)

^c INRIA   (France)

Author keywords

Confidentiality; Cryptography; Integrity; Non interference; Secure information flow; Type systems

Indexed keywords

CONFIDENTIALITY; INTEGRITY; NON INTERFERENCE; SECURE INFORMATION FLOW; TYPE SYSTEMS;

CRYPTOGRAPHY; IMAGE QUALITY;

SECURITY OF DATA;

EID: 80755168343     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2046707.2046747     Document Type: Conference Paper

References (24)

1. A. Askarov, D. Hedin, and A. Sabelfeld. Cryptographically-masked flows. In Proceedings of the 13th International Static Analysis Symposium, LNCS, 2006. Springer-Verlag.
2. J. C. Benaloh. Secret sharing homomorphisms: Keeping shares of a secret sharing. In A. M. Odlyzko, editor, CRYPTO, volume 263 of LNCS, pages 251-260. Springer, 1986.
3. M. Blaze, G. Bleumer, and M. Strauss. Divertible protocols and atomic proxy cryptography. In EUROCRYPT, pages 127-144, 1998. (Pubitemid 128081481)
4. D. Boneh, E.-J. Goh, and K. Nissim. Evaluating 2-DNF formulas on ciphertexts. In Theory of Cryptography (TCC), number 3378 in LNCS, pages 325-341. Springer, Feb. 2005. (Pubitemid 41231172)
5. V. Cortier, S. Delaune, and P. Lafourcade. A survey of algebraic properties used in cryptographic protocols. Journal of Computer Security, 14(1):1-43, 2006. (Pubitemid 43177436)
6. G. Danezis and C. Diaz. Space-efficient private search with applications to rateless codes. In Financial cryptography and data security: 11th international conference, FC 2007, and 1st International Workshop on Usable Security, USEC 2007, 2007.
7. S. Delaune, P. Lafourcade, D. Lugiez, and R. Treinen. Symbolic protocol analysis in presence of a homomorphism operator and exclusive or. In M. Bugliesi, B. Preneel, V. Sassone, and I. Wegener, editors, ICALP (2), volume 4052 of LNCS, pages 132-143. Springer, 2006. (Pubitemid 44121006)
8. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In CRYPTO, pages 10-18, 1984.
9. C. Fournet and T. Rezk. Cryptographically sound implementations for typed information-flow security. In 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'08), pages 323-335, Jan. 2008.
10. C. Fournet, G. le Guernic, and T. Rezk. A security-preserving compiler for distributed programs: From information-flow policies to cryptographic mechanisms. In ACM Conference on Computer and Communications Security, pages 432-441, Nov. 2009.
11. C. Gentry. Fully homomorphic encryption using ideal lattices. In ACM symposium on Theory of computing (STOC), pages 169-178, 2009.
12. J. A. Goguen and J. Meseguer. Security policies and security models. In IEEE Symposium on Security and Privacy, pages 11-20, 1982.
13. S. Goldwasser and S. Micali. Probabilistic encryption & how to play mental poker keeping secret all partial information. In ACM symposium on Theory of computing (STOC), pages 365-377, 1982.
14. W. Henecka, S. Kögl, A.-R. Sadeghi, T. Schneider, and I. Wehrenberg. TASTY: tool for automating secure two-party computations. In 17th ACM Conference on Computer and Communications Security, pages 451-462, Oct. 2010.
15. J. Katz and L. Malka. Secure text processing with applications to private DNA matching. In 17th ACM Conference on Computer and Communications Security, pages 485-492, Oct. 2010.
16. P. Lafourcade. Vérification des protocoles cryptographiques en présence de théories équationnelles. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, Sept. 2006.
17. P. Laud. Semantics and program analysis of computationally secure information flow. In 10th European Symposium on Programming (ESOP), volume 2028 of LNCS. Springer, Apr. 2001.
18. P. Laud. On the computational soundness of cryptographically-masked flows. In 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'08), pages 337-348, Jan. 2008.
19. P. Laud and V. Vene. A type system for computationally secure information flow. In Fundamentals of Computation Theory, LNCS, pages 365-377. Springer, 2005. (Pubitemid 41449464)
20. A. C. Myers, A. Sabelfeld, and S. Zdancewic. Enforcing robust declassification and qualified robustness. Journal of Computer Security, 14(2):157-196, 2006.
21. R. Ostrovsky and W. E. Skeith III. Private searching on streaming data. In V. Shoup, editor, Advances in Cryptology-CRYPTO 2005, volume 3621 of LNCS, pages 223-240, 2005. (Pubitemid 43902116)
22. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In EUROCRYPT, pages 223-238, 1999.
23. N. Smart and F. Vercauteren. Fully homomorphic encryption with relatively small key and ciphertext sizes. Public Key Cryptography-PKC 2010, pages 420-443, 2010.
24. G. Smith and R. Alpízar. Secure information flow with random assignment and encryption. In FMSE '06: fourth ACM workshop on Formal methods in security, pages 33-44, 2006. (Pubitemid 47154949)