David and goliath commitments: UC Computation for asymmetric parties using tamper-proof hardware

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

Volumn 4965 LNCS, Issue , 2008, Pages 527-544

  Moran, Tal ^a   Segev, Gil ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE; HOSPITALS; MATHEMATICAL MODELS; SECURITY OF DATA;

SECURITY PROPERTIES; TAMPER PROOF HARDWARE; UNIVERSAL COMPOSABILITY (UC);

COMPUTATION THEORY;

EID: 44449101614     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78967-3_30     Document Type: Conference Paper

References (22)

1. Barak, B., Canetti, R., Nielsen, J.B., Pass, R.: Universally composable protocols with relaxed set-up assumptions. In: Proceedings of the 45th Annual Symposium on Foundations of Computer Science, pp. 186-195 (2004)
2. Bennett, C.H., Brassard, G.: Quantum cryptography: Public key distribution and coin tossing. In: Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, pp. 175-179 (1984)
3. Bollobas, B.: Extremal Graph Theory. Courier Dover Publications (1978)
4. Brands, S.: Untraceable off-line cash in wallets with observers. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 302-318. Springer, Heidelberg (1994)
5. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, pp. 136-145 (2001); An updated version is available from the Cryptology ePrint Archive, Report 2000/067
6. Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally composable security with global setup. In: Proceedings of the 4th Theory of Cryptography Conference, pp. 61-85 (2007)
7. Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19-40. Springer, Heidelberg (2001)
8. Canetti, R., Kushilevitz, E., Lindell, Y.: On the limitations of universally composable two-party computation without set-up assumptions. Journal of Cryptology 19(2), 135-167 (2006)
9. Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: Proceedings of the 34th Annual ACM Symposium on the Theory of Computing, pp. 494-503 (2002)
10. Chandran, N., Goyal, V., Sahai, A.: Improved UC secure computation using tamper-proof hardware. Cryptology ePrint Archive, Report 2007/334 (2007)
11. Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89-105. Springer, Heidelberg (1993)
12. Cramer, R., Pedersen, T.P.: Improved privacy in wallets with observers. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 329-343. Springer, Heidelberg (1994)
13. Crépeau, C.: Efficient cryptographic protocols based on noisy channels. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 306-317. Springer, Heidelberg (1997)
14. Crépeau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions. In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pp. 42-52 (1988)
15. Damgård, I., Fehr, S., Morozov, K., Salvail, L.: Unfair noisy channels and oblivious transfer. In: Proceedings of the 1st Theory of Cryptography Conference, pp. 355-373 (2004)
16. Damgård, I., Kilian, J., Salvail, L.: On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 56-73. Springer, Heidelberg (1999)
17. Damgård, I., Nielsen, J.B., Wichs, D.: Universally composable multiparty computation with partially isolated parties. Cryptology ePrint Archive, Report 2007/332 (2007)
18. Groth, J., Ostrovsky, R.: Cryptography in the multi-string model. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 323-341. Springer, Heidelberg (2007)
19. Hofheinz, D., Müller-Quade, J., Unruh, D.: Universally composable zero-knowledge arguments and commitments from signature cards. In: Proceedings of the 5th Central European Conference on Cryptology (2005)
20. Katz, J.: Universally composable multi-party computation using tamper-proof hardware. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 115-128. Springer, Heidelberg (2007)
21. Moran, T., Naor, M.: Basing cryptographic protocols on tamper-evident seals. In: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, pp. 285-297 (2005)
22. Raz, R.: A parallel repetition theorem. SIAM Journal on Computing 27(3), 763-803 (1998)