Secure computation against convert adversaries based on game theory

Xizhao Luo; Peide Qian; Yanqin Zhu; Jianwei Liu

Secure computation against convert adversaries based on game theory

Xizhao Luo
, Peide Qian^*
, Yanqin Zhu
, Jianwei Liu

^*Corresponding author for this work

School of Cyber Science and Technology

Soochow University

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

Punish game in game theory models a situation in which players try to cheat, but not to be caught, i.e., the case in secure computation involving convert adversaries. Based on the computational game model for cryptography, the problem proposed by Halpern and Rafael is solved. The result suggests that secure computation with deterrent 1/2 is a universal implementation of the mediator with negligible error in the computational game theory.

Original language	English
Pages (from-to)	70-74
Number of pages	5
Journal	Nanjing Hangkong Hangtian Daxue Xuebao/Journal of Nanjing University of Aeronautics and Astronautics
Volume	44
Issue number	1
State	Published - Feb 2012

Keywords

Computational game
Nash equilibrium
Secure computation
Universal implementation

Cite this

@article{e09410ee84a640d1a9e5569a068412ca,

title = "Secure computation against convert adversaries based on game theory",

abstract = "Punish game in game theory models a situation in which players try to cheat, but not to be caught, i.e., the case in secure computation involving convert adversaries. Based on the computational game model for cryptography, the problem proposed by Halpern and Rafael is solved. The result suggests that secure computation with deterrent 1/2 is a universal implementation of the mediator with negligible error in the computational game theory.",

keywords = "Computational game, Nash equilibrium, Secure computation, Universal implementation",

author = "Xizhao Luo and Peide Qian and Yanqin Zhu and Jianwei Liu",

year = "2012",

month = feb,

language = "英语",

volume = "44",

pages = "70--74",

journal = "Nanjing Hangkong Hangtian Daxue Xuebao/Journal of Nanjing University of Aeronautics and Astronautics",

issn = "1005-2615",

publisher = "Nanjing University of Aeronautics an Astronautics",

number = "1",

}

TY - JOUR

T1 - Secure computation against convert adversaries based on game theory

AU - Luo, Xizhao

AU - Qian, Peide

AU - Zhu, Yanqin

AU - Liu, Jianwei

PY - 2012/2

Y1 - 2012/2

N2 - Punish game in game theory models a situation in which players try to cheat, but not to be caught, i.e., the case in secure computation involving convert adversaries. Based on the computational game model for cryptography, the problem proposed by Halpern and Rafael is solved. The result suggests that secure computation with deterrent 1/2 is a universal implementation of the mediator with negligible error in the computational game theory.

AB - Punish game in game theory models a situation in which players try to cheat, but not to be caught, i.e., the case in secure computation involving convert adversaries. Based on the computational game model for cryptography, the problem proposed by Halpern and Rafael is solved. The result suggests that secure computation with deterrent 1/2 is a universal implementation of the mediator with negligible error in the computational game theory.

KW - Computational game

KW - Nash equilibrium

KW - Secure computation

KW - Universal implementation

UR - https://www.scopus.com/pages/publications/84863272328

M3 - 文章

AN - SCOPUS:84863272328

SN - 1005-2615

VL - 44

SP - 70

EP - 74

JO - Nanjing Hangkong Hangtian Daxue Xuebao/Journal of Nanjing University of Aeronautics and Astronautics

JF - Nanjing Hangkong Hangtian Daxue Xuebao/Journal of Nanjing University of Aeronautics and Astronautics

IS - 1

ER -

Secure computation against convert adversaries based on game theory

Abstract

Keywords

Other files and links

Cite this