DONG, Naipeng ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
JONKER, Hugo ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
PANG, Jun ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Co-auteurs externes :
yes
Langue du document :
Anglais
Titre :
Analysis of a receipt-free auction protocol in the applied pi calculus
Date de publication/diffusion :
2011
Nom de la manifestation :
7th Workshop on Formal Aspects in Security and Trust
Lieu de la manifestation :
Italie
Date de la manifestation :
2010
Manifestation à portée :
International
Titre de l'ouvrage principal :
Proc. 7th Workshop on Formal Aspects in Security and Trust
Harkavy, M., Tygar, J.D., Kikuchi, H.: Electronic auctions with private bids. In: Proc. 3rd USENIX Workshop on Electronic Commerce, pp. 61-74 (1998)
Cachin, C.: Efficient private bidding and auctions with an oblivious third party. In: Proc. CCS 1999, pp. 120-127. ACM Press, New York (1999) (Pubitemid 32213907)
Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: Proc. ACM-EC 1999, pp. 129-139. ACM Press, New York (1999)
Lipmaa, H., Asokan, N., Niemi, V.: Secure vickrey auctions without threshold trust. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 87-101. Springer, Heidelberg (2003) (Pubitemid 36316773)
Chen, X., Lee, B., Kim, K.: Receipt-free electronic auction schemes using homomorphic encryption. In: Lim, J.-I., Lee, D.-H. (eds.) ICISC 2003. LNCS, vol. 2971, pp. 259-273. Springer, Heidelberg (2004)
Lowe, G.: Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 147- 166. Springer, Heidelberg (1996) (Pubitemid 126050413)
Chadha, R., Kremer, S., Scedrov, A.: Formal analysis of multi-party contract signing. In: Proc. CSFW 2004, pp. 266-279. IEEE CS, Los Alamitos (2004)
Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proc. POPL 2001, pp. 104-115. ACM, New York (2001)
Blanchet, B.: An efficient cryptographic protocol verifier based on prolog rules. In: Proc. CSFW 2001, pp. 82-96. IEEE CS, Los Alamitos (2001) (Pubitemid 32877779)
Delaune, S., Kremer, S., Ryan,M.D.: Verifying privacy-type properties of electronic voting protocols. J. Computer Security 17(4), 435-487 (2009)
Kremer, S., Ryan, M.D.: Analysis of an electronic voting protocol in the applied pi calculus. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 186-200. Springer, Heidelberg (2005) (Pubitemid 41274058)
Jonker, H.L., Mauw, S., Pang, J.: A formal framework for quantifying votercontrolled privacy. J. Algorithms 64(2-3), 89-105 (2009)
Dolev, D., Yao, A.C.C.: On the security of public key protocols. IEEE Trans. Information Theory 29(2), 198-207 (1983)
Blanchet, B., Abadi, M., Fournet, C.: Automated verification of selected equivalences for security protocols. J. Log. Algebr. Program. 75(1), 3-51 (2008) (Pubitemid 351172997)
Backes, M., Hritçu, C., Maffei, M.: Automated verification of remote electronic voting protocols in the applied pi-calculus. In: Proc. CSF 2008, pp. 195-209. IEEE CS, Los Alamitos (2008)
Küsters, R., Truderung, T.: An epistemic approach to coercion-resistance for electronic voting protocols. In: Proc. S&P 2009, pp. 251-266. IEEE CS, Los Alamitos (2009)
Küsters, R., Truderung, T., Vogt, A.: A game-based definition of coercionresistance and its applications. In: Proc. CSF 2010, pp. 122-136. IEEE CS, Los Alamitos (2010)
