Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Computer Applications

Mental poker protocol without trusted third party

Haiyan Xiao

Published Jan 1, 2009• 0 citations
OpenAlex

Abstract

Mental poker is a secure multi-party computation solution in specific scene.In recent years,the studies on mental poker protocol in academe are mainly based on Trusted Third Party(TTP).Using the semantic secure encrypt algorithm,combining with the signature algorithm in which the two signatures become effective at the same time,a mental poker protocol without TTP in an unreliable channel was designed.The new protocol can ensure the fairness of game participators and resist the attack of playback,with the advantages of non-repudiation,unforgeability and traceability.

Related papers

Efficient TTP-free mental poker protocols

Weiliang Zhao, Vijay Varadharajan

Zhao et al proposed an efficient mental poker protocol which did not require using a trusted third party (TTP). The protocol is efficient and suitable for any number of players but it introduces a security flaw. In this paper, we propose two mental poker protocols based on Zhao's previous work. The security flaw has been removed and the additional computing cost is small.

International Conference on Information Technology: Coding and Computing (ITCC)•Jan 1, 2005•6 citations

On the security of an efficient TTP-free mental poker protocol

Jordi Castellà‐Roca, Josep Domingo‐Ferrer

Using commutative cryptosystems is a way to obtain efficient mental poker protocols which do not require using a trusted third party (TTP). However, the security of such protocols depends on the particular cryptosystem used. We show that a TTP-free mental poker protocol using an ElGamal-like commutative cryptosystem is insecure.

International Conference on Information Technology: Coding and Computing (ITCC)•Jan 1, 2004•8 citations

Fair online gambling scheme and TTP-free mental poker protocols

Weiliang Zhao, Vijay Varadharajan

Online gambling allows users to participate in mental games and bet over the Internet. It can open new opportunities for casinos to make more money; however, at the same time, there are a lot of security challenges. In this paper, we describe our scheme for secure online gambling and secure mental poker protocols over the Internet based on our previous researches. Our scheme provides both the fairness of online gambling processes and secure linking of the online gambling with payment. A unique link between payments and gambling outcome is provided so that the winner can be ensured to get the payment. The gambling games are generic in our fair online gambling scheme. Mental poker is one of most popular games of online gambling. In this paper, efficient and secure mental poker protocols are provided. These mental poker protocols are based on multiple encryption and decryption of individual cards. These protocols satisfy all major security requirements of a real mental poker. The card salesman has been got rid of and the minimal effect due to collusion has been guaranteed. These protocols are more efficient compared with other known protocols. The strategies of players can be kept confidential with the introduction of a dealer. These mental poker protocols are suitable for implementation in an online card game.

Information Assurance and Security•Jan 1, 2006•0 citations

A Fair Non-Repudiation Protocol without TTP Based on Entity′s Computing Power

Xingfu Wang

With the development of e-commence and other utilities on internet,a new security service——fair non-repudiation becomes more important and crucial.But,most current protocols depend on trusted third party(TTP),so a fair non-repudiation protocol without TTP is needed.But the existing fair protocols don't have equal security for message originator and receiver,and they can not assure the security of the message originator.In this paper,a new protocol is designed for the prior security of the originator,and a fair non-repudiation protocol without TTP based on entity's computing power is proposed to get rid of the dependence on TTP,to solve the security problems that exist when message originator and receiver's computing power are not equal.

Dianzi xuebao•Jan 1, 2006•0 citations

An Optimistic Non-repudiation Protocol Focused on Transparent Trusted Third Party

Qiang Li, Kaigui Wu, Fang Li

Non-repudiation service is widely employed in information exchange and online transaction. It requires that its participants are unable to deny their involvement in specific protocol. At the same time, the service should keep fairness, which means that no one could take any advantages over the other one. Researchers have introduced a trusted third party (TTP) to realize these demands. Protocols are grouped into several categories according to the degree of TTP's involvement in protocols. Optimistic non-repudiation protocol is the most important method undoubtedly owe to its lower TTP's involvement. There are two questions. One is that whether it is possible to further decrease TTP's involvement or not. A computable optimistic non-repudiation protocol seems to be a good improvement. This is also our paper's basic protocol. The other question is about whether two types of finally evidences that produced by participants (here is Alice and Bob, and we denote this type evidences as the first type evidences) and TTP (or with the help of TTP, and we demote this type evidences as the second type evidences) are identical. If both types of evidences are not exactly the same, then it shows that TTP has taken part in process of protocol. Thus, it is certain that either participants behaved dishonest, or network went wrong. Participants' prestige will be negatively affected more or less. On the contrary, if two types of evidences are identical, then such feelings will be eliminated. This kind of TTP is called transparent TTP. In this paper, we have accomplished an optimistic non-repudiation protocol with the help of transparent TTP based on a computable non-repudiation protocol.

•Nov 1, 2013•1 citation

Non-repudiation protocol based on conditional trusted third party

Chun Chen

The idea of TTP was developed on the basis semi-trusted TTP. The term of conditional trusted third means that on the condition of third party satisfying the pre-conditions, if he behaves right, then he is trusted, else his behavior can be checked by participators of the protocol. A new protocol adopting off-line and TTP was put forward. Compared with available non-repudiation protocols, this one progresses further in reducing intervention of TTP in fair exchange.

Journal of Zhejiang University(Engineering Science)•Jan 1, 2004•0 citations
Mental poker is a secure multi-party computation solution in specific scene.In recent years,the studies on mental poker protocol in academe are mainly based on Trusted Third Party(TTP).Using the semantic secure encrypt algorithm,combining with the signature algorithm in which the two signatures become effective at the same time,a mental poker protocol without TTP in an unreliable channel was designed.The new protocol can ensure the fairness of game participators and resist the attack of playback,with the advantages of non-repudiation,unforgeability and traceability.
Online gambling allows users to participate in mental games and bet over the Internet. It can open new opportunities for casinos to make more money; however, at the same time, there are a lot of security challenges. In this paper, we describe our scheme for secure online gambling and secure mental poker protocols over the Internet based on our previous researches. Our scheme provides both the fairness of online gambling processes and secure linking of the online gambling with payment. A unique link between payments and gambling outcome is provided so that the winner can be ensured to get the payment. The gambling games are generic in our fair online gambling scheme. Mental poker is one of most popular games of online gambling. In this paper, efficient and secure mental poker protocols are provided. These mental poker protocols are based on multiple encryption and decryption of individual cards. These protocols satisfy all major security requirements of a real mental poker. The card salesman has been got rid of and the minimal effect due to collusion has been guaranteed. These protocols are more efficient compared with other known protocols. The strategies of players can be kept confidential with the introduction of a dealer. These mental poker protocols are suitable for implementation in an online card game.
With the development of e-commence and other utilities on internet,a new security service——fair non-repudiation becomes more important and crucial.But,most current protocols depend on trusted third party(TTP),so a fair non-repudiation protocol without TTP is needed.But the existing fair protocols don't have equal security for message originator and receiver,and they can not assure the security of the message originator.In this paper,a new protocol is designed for the prior security of the originator,and a fair non-repudiation protocol without TTP based on entity's computing power is proposed to get rid of the dependence on TTP,to solve the security problems that exist when message originator and receiver's computing power are not equal.
Non-repudiation service is widely employed in information exchange and online transaction. It requires that its participants are unable to deny their involvement in specific protocol. At the same time, the service should keep fairness, which means that no one could take any advantages over the other one. Researchers have introduced a trusted third party (TTP) to realize these demands. Protocols are grouped into several categories according to the degree of TTP's involvement in protocols. Optimistic non-repudiation protocol is the most important method undoubtedly owe to its lower TTP's involvement. There are two questions. One is that whether it is possible to further decrease TTP's involvement or not. A computable optimistic non-repudiation protocol seems to be a good improvement. This is also our paper's basic protocol. The other question is about whether two types of finally evidences that produced by participants (here is Alice and Bob, and we denote this type evidences as the first type evidences) and TTP (or with the help of TTP, and we demote this type evidences as the second type evidences) are identical. If both types of evidences are not exactly the same, then it shows that TTP has taken part in process of protocol. Thus, it is certain that either participants behaved dishonest, or network went wrong. Participants' prestige will be negatively affected more or less. On the contrary, if two types of evidences are identical, then such feelings will be eliminated. This kind of TTP is called transparent TTP. In this paper, we have accomplished an optimistic non-repudiation protocol with the help of transparent TTP based on a computable non-repudiation protocol.