Socio-Rational Secret Sharing as a New Direction in Rational Cryptography

Nojoumian, Mehrdad; Stinson, Douglas R.

doi:10.1007/978-3-642-34266-0_2

Cited by 22 publications

(13 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The efficiency of their solution is low and it can not resist collusion among parities. Nojoumian combines rational secret sharing scheme and social secret sharing and puts forward the socio-rational secret sharing scheme (Nojoumian and Stinson 2012). The relationship between socio-rational secret sharing scheme and the other two schemes is shown in Fig.…”

Section: Classical Schemes 31 Rational Secret Sharing Schemesmentioning

confidence: 99%

“…The authors construct a public trusted network among parities, where parities' weights are updated constantly. The updating rule is: the weight of parties who cooperate is bigger than those who defect (Nojoumian et al 2010;Nojoumian and Stinson 2010). This credible network can be regarded as a reputation system in the field of artificial intelligence.…”

Section: Classical Schemes 31 Rational Secret Sharing Schemesmentioning

confidence: 99%

See 1 more Smart Citation

A brief survey on secure multi-party computing in the presence of rational parties

Wang

Qin

et al. 2015

J Ambient Intell Human Comput

View full text Add to dashboard Cite

Intelligent agents (IA) are autonomous entities which observe through sensors and act upon an environment using actuators to adjust their activities towards achieving certain goals. The architectures of agents have enormous potentials when they are applied into critical systems, where agents choose actions between working with their own and cooperating with others. Rational utility-based agents choose actions to maximize their expected utilities. Rational secure multi-party computing (RSMPC) means secure multi-party computing (SMPC) in the presence of rational utility-based agents. Here, we call them rational parties. In this paper certain goals of rational parties are maximizing their utilities. The introduction of rational parties considers the incentives in executing protocols. The security definitions under rational framework can better demonstrate the executing environment of real protocols. Furthermore, rational two-party computing removes some impossibility in traditional two-party computing, such as fairness. This paper represents the research status of RSMPC and some typical protocols. The advantages and disadvantages of previous rational SMPC protocols are discussed here. As an emerging field, there are still lots of open problems in RSMPC, such as communication channels, utility assumptions and equilibrium notions etc.

show abstract

Section: Classical Schemes 31 Rational Secret Sharing Schemesmentioning

confidence: 99%

Section: Classical Schemes 31 Rational Secret Sharing Schemesmentioning

confidence: 99%

A brief survey on secure multi-party computing in the presence of rational parties

Wang

Qin

et al. 2015

J Ambient Intell Human Comput

View full text Add to dashboard Cite

show abstract

“…Finally, an SSSS-based framework [67,66,100,65] generalizes the first two frameworks by distributing se- crets over multiple nodes at multiple CSPs' (Figure 15). CSPs play the role of PTs and a number of nodes at CSPs' are the weight of PTs (w i ).…”

Section: Framework and Architectures For Sharing Secrets In The Cloudmentioning

confidence: 99%

Secret sharing for cloud data security: a survey

2017

View full text Add to dashboard Cite

Cloud computing helps reduce costs, increase business agility and deploy solutions with a high return on investment for many types of applications. However, data security is of premium importance to many users and often restrains their adoption of cloud technologies. Various approaches, i.e., data encryption, anonymization, replication and verification, help enforce different facets of data security. Secret sharing is a particularly interesting cryptographic technique. Its most advanced variants indeed simultaneously enforce data privacy, availability and integrity, while allowing computation on encrypted data. The aim of this paper is thus to wholly survey secret sharing schemes with respect to data security, data access and costs in the pay-as-yougo paradigm.

show abstract

“…In this paper we do not consider secret sharing as a repeated game. In such a case cooperation in the reconstruction stage can be reinforced by the introduction of a reputation value [23]. However, as we discuss further, not participation in the reconstruction of the secret may be caused by reasons other than being selfish and in sucg a case it may be beneficial for the society.…”

Section: Introductionmentioning

confidence: 97%

Realistic versus Rational Secret Sharing

Desmedt

Slinko

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The study of Rational Secret Sharing initiated by Halpern and Teague regards the reconstruction of the secret in secret sharing as a game. It was shown that participants (parties) may refuse to reveal their shares and so the reconstruction may fail. Moreover, a refusal to reveal the share may be a dominant strategy of a party.In this paper we consider secret sharing as a sub-action or subgame of a larger action/game where the secret opens a possibility of consumption of a certain common good. We claim that utilities of participants will be dependent on the nature of this common good. In particular, Halpern and Teague scenario corresponds to a rivalrous and excludable common good. We consider the case when this common good is non-rivalrous and non-excludable and find many natural Nash equilibria. We list several applications of secret sharing to demonstrate our claim and give corresponding scenarios. In such circumstances the secret sharing scheme facilitates a power sharing agreement in the society. We also state that non-reconstruction may be beneficial for this society and give several examples.

show abstract

Socio-Rational Secret Sharing as a New Direction in Rational Cryptography

Cited by 22 publications

References 26 publications

A brief survey on secure multi-party computing in the presence of rational parties

A brief survey on secure multi-party computing in the presence of rational parties

Secret sharing for cloud data security: a survey

Realistic versus Rational Secret Sharing

Contact Info

Product

Resources

About