메뉴 건너뛰기




Volumn 5677 LNCS, Issue , 2009, Pages 541-558

Privacy-enhancing auctions using rational cryptography

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATED CHANNEL; CRYPTOGRAPHIC ASSUMPTIONS; CRYPTOGRAPHIC PROTOCOLS; EXPECTED UTILITY; LARGE CLASS; MULTI-ITEM; NASH EQUILIBRIUM; PRIVACY CONCERNS; UTILITY MODEL;

EID: 70350342512     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03356-8_32     Document Type: Conference Paper
Times cited : (9)

References (21)
  • 1
    • 33748686155 scopus 로고    scopus 로고
    • Abraham, I., Dolev, D., Gonen, R., Halpern, J.: Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In: PODC 2006, pp. 53-62. ACM, New York (2006)
    • Abraham, I., Dolev, D., Gonen, R., Halpern, J.: Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In: PODC 2006, pp. 53-62. ACM, New York (2006)
  • 2
    • 33750056675 scopus 로고    scopus 로고
    • Bogetoft, P., Damgård, I., Jakobsen, T., Nielsen, K., Pagter, J., Toft, T.: A practical implementation of secure auctions based on multiparty integer computation. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, 4107, pp. 142-147. Springer, Heidelberg (2006)
    • Bogetoft, P., Damgård, I., Jakobsen, T., Nielsen, K., Pagter, J., Toft, T.: A practical implementation of secure auctions based on multiparty integer computation. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol. 4107, pp. 142-147. Springer, Heidelberg (2006)
  • 3
    • 44249092751 scopus 로고    scopus 로고
    • Protocol completion incentive problems in cryptographic Vickrey auctions
    • Bradford, P.G., Park, S., Rothkopf, M.H., Park, H.: Protocol completion incentive problems in cryptographic Vickrey auctions. Electronic Commerce Research 8(1-2), 57-77 (2008)
    • (2008) Electronic Commerce Research , vol.8 , Issue.1-2 , pp. 57-77
    • Bradford, P.G.1    Park, S.2    Rothkopf, M.H.3    Park, H.4
  • 4
    • 84974555688 scopus 로고    scopus 로고
    • A cryptographic solution to a game theoretic problem
    • Bellare, M, ed, CRYPTO 2000, Springer, Heidelberg
    • Dodis, Y., Halevi, S., Rabin, T.: A cryptographic solution to a game theoretic problem. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 112-130. Springer, Heidelberg (2000)
    • (2000) LNCS , vol.1880 , pp. 112-130
    • Dodis, Y.1    Halevi, S.2    Rabin, T.3
  • 5
    • 84899848409 scopus 로고    scopus 로고
    • Existence and computation of equilibria of first-price auctions with integral valuations and bids
    • Escamocher, G., Miltersen, P.B., Santillan-Rodriguez, R.: Existence and computation of equilibria of first-price auctions with integral valuations and bids. In: AAMAS 2009 (2009)
    • (2009) AAMAS
    • Escamocher, G.1    Miltersen, P.B.2    Santillan-Rodriguez, R.3
  • 6
    • 57049135299 scopus 로고    scopus 로고
    • Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. In: STOC 2008, pp. 413-422. ACM, New York (2008)
    • Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. In: STOC 2008, pp. 413-422. ACM, New York (2008)
  • 7
    • 33750018128 scopus 로고    scopus 로고
    • Gordon, S.D., Katz, J.: Rational secret sharing, revisited. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, 4116, pp. 229-241. Springer, Heidelberg (2006)
    • Gordon, S.D., Katz, J.: Rational secret sharing, revisited. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol. 4116, pp. 229-241. Springer, Heidelberg (2006)
  • 9
    • 4544259607 scopus 로고    scopus 로고
    • Halpern, J., Teague, V.: Rational secret sharing and multiparty computation: extended abstract. In: STOC 2004, pp. 623-632. ACM, New York (2004)
    • Halpern, J., Teague, V.: Rational secret sharing and multiparty computation: extended abstract. In: STOC 2004, pp. 623-632. ACM, New York (2004)
  • 10
    • 33748582624 scopus 로고    scopus 로고
    • Rational secure computation and ideal mechanism design. In: FOCS
    • Los Alamitos
    • Izmalkov, S., Lepinski, M., Micali, S.: Rational secure computation and ideal mechanism design. In: FOCS 2005, pp. 585-594. IEEE, Los Alamitos (2005)
    • (2005) 585-594. IEEE , pp. 2005
    • Izmalkov, S.1    Lepinski, M.2    Micali, S.3
  • 11
    • 40249088241 scopus 로고    scopus 로고
    • Kol, G., Naor, M.: Cryptography and game theory: Designing protocols for exchanging information. In: Canetti, R. (ed.) TCC 2008. LNCS, 4948, pp. 320-339. Springer, Heidelberg (2008)
    • Kol, G., Naor, M.: Cryptography and game theory: Designing protocols for exchanging information. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 320-339. Springer, Heidelberg (2008)
  • 12
    • 57049100461 scopus 로고    scopus 로고
    • Kol, G., Naor, M.: Games for exchanging information. In: STOC 2008, pp. 423-432. ACM, New York (2008)
    • Kol, G., Naor, M.: Games for exchanging information. In: STOC 2008, pp. 423-432. ACM, New York (2008)
  • 13
    • 33748680791 scopus 로고    scopus 로고
    • Lepinksi, M., Micali, S., shelat, a.: Collusion-free protocols. In: STOC 2005, pp. 543-552. ACM, New York (2005)
    • Lepinksi, M., Micali, S., shelat, a.: Collusion-free protocols. In: STOC 2005, pp. 543-552. ACM, New York (2005)
  • 14
    • 10444265884 scopus 로고    scopus 로고
    • Lepinski, M., Micali, S., Peikert, C., shelat, a.: Completely fair SFE and coalition-safe cheap talk. In: PODC 2004, pp. 1-10. ACM, New York (2004)
    • Lepinski, M., Micali, S., Peikert, C., shelat, a.: Completely fair SFE and coalition-safe cheap talk. In: PODC 2004, pp. 1-10. ACM, New York (2004)
  • 15
    • 43149090554 scopus 로고    scopus 로고
    • Lindell, A.Y.: Legally-enforceable fairness in secure two-party computation. In: Malkin, T.G. (ed.) CT-RSA 2008. LNCS, 4964, pp. 121-137. Springer, Heidelberg (2008)
    • Lindell, A.Y.: Legally-enforceable fairness in secure two-party computation. In: Malkin, T.G. (ed.) CT-RSA 2008. LNCS, vol. 4964, pp. 121-137. Springer, Heidelberg (2008)
  • 16
    • 33749541500 scopus 로고    scopus 로고
    • Rationality and adversarial behavior in multi-party computation
    • Dwork, C, ed, CRYPTO 2006, Springer, Heidelberg
    • Lysyanskaya, A., Triandopoulos, N.: Rationality and adversarial behavior in multi-party computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 180-197. Springer, Heidelberg (2006)
    • (2006) LNCS , vol.4117 , pp. 180-197
    • Lysyanskaya, A.1    Triandopoulos, N.2
  • 17
    • 70350281824 scopus 로고    scopus 로고
    • Purely rational secret sharing (extended abstract)
    • TCC, Springer, Heidelberg
    • Micali, S., shelat, a.: Purely rational secret sharing (extended abstract). In: TCC 2009. LNCS, vol. 5444, pp. 54-71. Springer, Heidelberg (2009)
    • (2009) LNCS , vol.5444 , pp. 54-71
    • Micali, S.1    shelat, A.2
  • 20
    • 70350273678 scopus 로고    scopus 로고
    • Fairness with an honest minority and a rational majority
    • TCC, Springer, Heidelberg
    • Ong, S.J., Parkes, D., Rosen, A., Vadhan, S.: Fairness with an honest minority and a rational majority. In: TCC 2009. LNCS, vol. 5444, pp. 36-53. Springer, Heidelberg (2009)
    • (2009) LNCS , vol.5444 , pp. 36-53
    • Ong, S.J.1    Parkes, D.2    Rosen, A.3    Vadhan, S.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.