Rate-limited secure function evaluation: Definitions and constructions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7778 LNCS, Issue , 2013, Pages 461-478

  Dagdelen, Özgür ^a   Mohassel, Payman ^b   Venturi, Daniele ^c  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF CALGARY   (Canada)

^c AARHUS UNIVERSITY   (Denmark)

Author keywords

foundations; oblivious polynomial evaluation; oracle attacks; secure function evaluation; secure metering

Indexed keywords

CLIENT-SERVER APPLICATIONS; GENERAL APPROACH; OBLIVIOUS POLYNOMIAL EVALUATION; ORACLE ATTACKS; SECURE FUNCTION EVALUATION; SECURE METERING; SERVICE PROVIDER; STEPPING STONE; THE STANDARD MODEL;

FOUNDATIONS; PROGRAM COMPILERS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84873949927     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-36362-7_28     Document Type: Conference Paper

References (30)

1. Barni, M., Failla, P., Kolesnikov, V., Lazzeretti, R., Sadeghi, A.-R., Schneider, T.: Secure Evaluation of Private Linear Branching Programs with Medical Applications. In: Backes, M., Ning, P. (eds.) ESORICS 2009. LNCS, vol. 5789, pp. 424-439. Springer, Heidelberg (2009)
2. Beaver, D., Goldwasser, S.: Multiparty Computation with Faulty Majority. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 589-590. Springer, Heidelberg (1990)
3. Beimel, A., Nissim, K., Omri, E.: Distributed private data analysis: On simultaneously solving how and what. CoRR, abs/1103.2626 (2011)
4. Bellare, M., Goldreich, O., Goldwasser, S.: Incremental Cryptography: The Case of Hashing and Signing. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 216-233. Springer, Heidelberg (1994)
5. Bogdanov, D., Laur, S., Willemson, J.: Sharemind: A Framework for Fast Privacy-Preserving Computations. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol. 5283, pp. 192-206. Springer, Heidelberg (2008)
6. Bogdanov, D., Talviste, R., Willemson, J.: Deploying secure multiparty computation for financial data analysis. Technical report, Cryptology ePrint, 2011/662
7. Bogetoft, P., Christensen, D.L., Damgård, I., Geisler, M., Jakobsen, T., Krøigaard, M., Nielsen, J.D., Nielsen, J.B., Nielsen, K., Pagter, J., Schwartzbach, M., Toft, T.: Secure Multiparty Computation Goes Live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 325-343. Springer, Heidelberg (2009)
8. Chaum, D., Crépeau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: ACM Symposium on Theory of Computing, pp. 11-19. ACM (1988)
9. Chaum, D., van Heijst, E., Pfitzmann, B.: Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 470-484. Springer, Heidelberg (1992)
10. Cramer, R., Damgård, I., Schoenmakers, B.: Proof of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174-187. Springer, Heidelberg (1994)
11. Dagdelen, Ö., Mohassel, P., Venturi, D.: Rate-Limited Secure Function Evaluation: Definitions and Constructions. Cryptology ePrint, Report 201X/XXX
12. Damgård, I., Geisler, M., Krøigaard, M., Nielsen, J.B.: Asynchronous Multiparty Computation: Theory and Implementation. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 160-179. Springer, Heidelberg (2009)
13. Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword Search and Oblivious Pseudorandom Functions. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 303-324. Springer, Heidelberg (2005) (Pubitemid 41231171)
14. Gennaro, R., Hazay, C., Sorensen, F.: Automata evaluation and text search protocols with simulation based security. Cryptology ePrint, Report 2010/484
15. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: ACM Symposium on Theory of Computing, pp. 218-229. ACM (1987)
16. Hazay, C., Lindell, Y.: Efficient oblivious polynomial evaluation with simulation-based security. Technical report, Cryptology ePrint, Report 2009/459
17. Hazay, C., Lindell, Y.: Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 155-175. Springer, Heidelberg (2008)
18. Hazay, C., Nissim, K.: Efficient Set Operations in the Presence of Malicious Adversaries. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 312-331. Springer, Heidelberg (2010)
19. Hazay, C., Toft, T.: Computationally Secure Pattern Matching in the Presence of Malicious Adversaries. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 195-212. Springer, Heidelberg (2010)
20. Henecka, W., Kogl, S., Sadeghi, A.-R., Schneider, T., Wehrenberg, I.: TASTY: tool for automating secure two-party computations. In: ACM CCS 2007 (2010)
21. Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: USENIX Security (2011)
22. Ishai, Y., Paskin, A.: Evaluating Branching Programs on Encrypted Data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 575-594. Springer, Heidelberg (2007)
23. Jarecki, S., Shmatikov, V.: Efficient Two-Party Secure Computation on Committed Inputs. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 97-114. Springer, Heidelberg (2007)
24. Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - a secure two-party computation system. In: USENIX Security (2004)
25. Mardziel, P., Hicks, M., Katz, J., Srivatsa, M.: Knowledge-oriented secure multiparty computation. In: ACM SIGPLAN - PLAS (June 2012)
26. McGregor, A., Mironov, I., Pitassi, T., Reingold, O., Talwar, K., Vadhan, S.: The limits of two-party differential privacy. ECCC 18:106 (2011)
27. Ogata, W., Kurosawa, K.: Oblivious keyword search. Technical report, Cryptology ePrint, Report 2002/182
28. Troncoso-Pastoriza, J., Katzenbeisser, S., Celik, M.: Privacy preserving error resilient DNA searching through oblivious automata. In: ACM CCS, pp. 519-528 (2007)
29. Yao, A.C.: Protocols for secure computations (extended abstract). In: FOCS, pp. 160-164 (1982)
30. Yao, A.C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162-167 (1986)