Resettably secure computation

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

Volumn 5479 LNCS, Issue , 2009, Pages 54-71

  Goyal, Vipul ^a   Sahai, Amit ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLACK BOXES; CRYPTOGRAPHIC PROTOCOLS; INITIAL STATE; MULTIPARTY COMPUTATION; PROTOCOL EXECUTION; SECURE COMPUTATION; SIMULATION-BASED; TWO-PARTY COMPUTATION; WITNESS INDISTINGUISHABILITY; ZERO KNOWLEDGE;

SMART CARDS;

CRYPTOGRAPHY;

EID: 67650699638     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01001-9_3     Document Type: Conference Paper

References (24)

1. [Bar01] Barak, B.: How to go beyond the black-box simulation barrier. In: FOCS, pp. 106-115 (2001) (Pubitemid 33068371)
2. [BGGL01] Barak, B., Goldreich, O., Goldwasser, S., Lindell, Y.: Resettably-sound zero-knowledge and its applications. In: FOCS, pp. 116-125 (2001) (Pubitemid 33068372)
3. [BMR90] Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: STOC, pp. 503-513. ACM, New York (1990)
4. [Can00] Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology: the journal of the International Association for Cryptologic Research 13(1), 143-202 (2000)
5. [CF01] Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19-40. Springer, Heidelberg (2001) (Pubitemid 33317906)
6. [CGGM00] Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zeroknowledge (extended abstract). In: STOC, pp. 235-244 (2000)
7. [CGS08] Chandran, N., Goyal, V., Sahai, A.: New constructions for UC secure computation using tamper-proof hardware. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 545-562. Springer, Heidelberg (2008) (Pubitemid 351762849)
8. [CKL06] Canetti, R., Kushilevitz, E., Lindell, Y.: On the limitations of universally composable two-party computation without set-up assumptions. J. Cryptology 19(2), 135-167 (2006) (Pubitemid 43255771)
9. [DL07] Deng, Y., Lin, D.: Instance-depenDent verifiable random functions and their application to simultaneous resettability. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 148-168. Springer, Heidelberg (2007)
10. [DN00] Dwork, C., Naor, M.: Zaps and their applications. In: FOCS, pp. 283-293 (2000) (Pubitemid 32075898)
11. [DNS98] Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. In: STOC, pp. 409-418 (1998)
12. [Dwo08] Dwork, C.: Differential privacy: A survey of results. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 1-19. Springer, Heidelberg (2008)
13. [GMW87] Goldreich, O., Micali, S.,Wigderson, A.: How to play any mental game. In: STOC 1987: Proceedings of the 19th annual ACM conference on Theory of computing, pp. 218-229. ACM Press, New York (1987)
14. [GS08] Goyal, V., Sahai, A.: Resolving the simultaneous resettability conjecture and a new non-black-box simulation strategy. Cryptology ePrint Archive, Report 2008/545 (2008), http://eprint.iacr.org/
15. Katz, J.: Universally composable multi-party computation using tamperproof hardware. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 115-128. Springer, Heidelberg (2007)
16. [KP01] Kilian, J., Petrank, E.: Concurrent and resettable zero-knowledge in polyloalgorithm rounds. In: STOC, pp. 560-569 (2001)
17. [Lin03] Lindell, Y.: Bounded-concurrent secure two-party computation without setup assumptions. In: STOC, pp. 683-692. ACM Press, New York (20
18. [Lin04] Lindell, Y.: Lower bounds for concurrent self composition. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 203-222. Springer, Heidelberg (2004)
19. [MP06] Micali, S., Pass, R.: Local zero knowledge. In: Kleinberg, J.M. (ed.) STOC, pp. 306-315. ACM, New York (2006) (Pubitemid 44306564)
20. [PRS02] Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: FOCS, pp. 366-375 (2002
21. [Sah99] Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: FOCS, pp. 543-553 (1999) (Pubitemid 30539953)
22. [Sha79] Shamir, A.: How to share a secret. Commun. ACM 22(11), 612-613 (1979)
23. [Yao86] Yao, A.C.-C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162-167. IEEE, Los Alamitos (1986)
24. [YZ07] Yung, M., Zhao, Y.: Generic and practical resettable zero-knowledge in the bare public-key model. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 129-147. Springer, Heidelberg (2007)