Efficient lookup-table protocol in secure multiparty computation

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2012, Pages 189-200

  Launchbury, John ^a   Diatchki, Iavor S ^a   DuBuisson, Thomas ^a   Adams Moran, Andy ^a  

^a Galois Inc   (United States)

Author keywords

cloud; edsl; haskell; secure multiparty computation

Indexed keywords

ADVANCED ENCRYPTION STANDARD ALGORITHMS; BOOLEAN CIRCUIT; COMPUTATION OVERHEADS; EDSL; GENERAL PURPOSE; HASKELL; LOOK UP TABLE; PARALLELIZATIONS; SECURE MULTI-PARTY COMPUTATION;

ALGORITHMS; CLOUDS; COMPUTER PROGRAMMING LANGUAGES; DATA PRIVACY; FUNCTIONAL PROGRAMMING; OPTIMIZATION; TABLE LOOKUP;

CRYPTOGRAPHY;

EID: 84867553703     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2364527.2364556     Document Type: Conference Paper

References (16)

1. National Institute of Standards and Technology (NIST). FIPS 197: Advanced encryption standard, 2001. Available at http://csrc.nist.gov/publications/fips/ fips197/fips-197.pdf.
2. Lennart Augustsson, Mikael Rittri, and Dan Synek On Generating Unique Names. Journal of Functional Programming (1994), 4 : pp 117-123
3. D. Bogdanov, S. Laur, J.Willemson. Sharemind: a framework for fast privacy-preserving computations. In Proceedings of 13th European Symposium on Research in Computer Security, ESORICS 2008, LNCS, vol. 5283. Springer-Verlag, 2008.
4. P. Bogetoft, D. L. Christensen, I. Damgaard, M. Geisler, T. Jakobsen, M. Kroeigaard, J. D. Nielsen, J. B. Nielsen, K. Nielsen, J. Pagter, M. Schwartzbach, and T. Toft, Secure Multiparty Computation Goes Live. Financial Cryptography and Data Security, R. Dingledine and P. Golle (eds), LNCS Vol. 5628, Springer-Verlag 2009.
5. E. Barker and J. Kelsey. Recommendation for Random Number Generation Using Deterministic Random Bit Generators. NIST Special Publication 800-90A. http://csrc.nist.gov/publications/nistpubs/800-90A/SP800-90A.pdf
6. A.M. Bain, J.C. Mitchell, R. Sharma, D. Stefan and J. Zimmerman. A domain-specific language for computing on encrypted data. Invited Talk. In Foundations of Software Technology and Theoretical Computer Science, 2011.
7. I. Damgaard and M. Keller, Secure Multiparty AES, Financial Cryptography and Data Security, R. Sion (ed), LNCS Vol. 6052, Springer-Verlag 2010.
8. Two Methods of Rijndael Implementation in Reconfigurable Hardware, V. Fischer and M. Drutarovsk. Cryptographic Hardware and Embedded Systems (CHES 2001). LNCS Vol. 2162. Spring-Verlag 2001.
9. C. Gentry, Fully homomorphic encryption using ideal lattices. ACM Symposium on Theory of Computing (STOC 2009), 2009.
10. C. Gentry and S. Halevi. Implementing Gentrys fullyhomomorphic encryption scheme. Advances in Cryptology (Eurocrypt 2011), LNCS Voli. 6632, Springer-Verlag, 2011.
11. O. Goldreich, Foundations of Cryptography, Vol 2: Basic Applications. Cambridge University Press, 2004.
12. Y. Huang. D. Evans, J. Katz, L. Malka, Faster Secure Two-Party Computation Using Garbled Circuits. In 20th USENIX Security Symposium, San Francisco, 2011.
13. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella, FairPlay - a secure two party computation system. Proceedings of the 13th conference on USENIX Security Symposium - Vol. 13, 2004.
14. B. Pinkas, T. Schneider, N. P. Smart, and S. C. Williams. Secure Two-Party Computation is Practical. Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology. ASIACRYPT 09. Springer-Verlag 2009.
15. N. P. Smart and F. Vercauteren. Fully homomorphic SIMD operations. Manuscript at http://eprint.iacr.org/2011/133, 2011.
16. A. C. Yao. How to generate and exchange secrets. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986.