A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
A Cryptographic Solution to a Game Theoretic Problem
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. ...
We then show how to incorporate our cryptographic protocol back into a game-theoretic setting, which highlights some interesting parallels between cryptographic protocols and extensive form games. ...
Some examples of using game-theoretic concepts to solve cryptographic problems include the works of Fischer and Wright [17] and Kilian [26] . ...
doi:10.1007/3-540-44598-6_7
fatcat:d4gez5ys3fa2vbwcxvfhgcehja
Page 4548 of Mathematical Reviews Vol. , Issue 2002F
[page]
2002
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
We then show how to incorpo- rate our cryptographic protocol back into a game-theoretic setting, which highlights some interesting parallels between cryptographic protocols and extensive form games.” ...
Summary: “In this work we use cryptography to solve a game- theoretic problem which arises naturally in the area of two-party strategic games. ...
A rational approach to cryptographic protocols
2007
Mathematical and computer modelling
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2010 pre-print arXiv:1005.0082v1 fatcat:u6gjf35kivehlpl6pc4w4pkvyq
This work initiates an analysis of several cryptographic protocols from a rational point of view using a game-theoretical approach, which allows us to represent not only the protocols but also possible ...
One of the main advantages of analysing a cryptographic protocol in the game-theory setting is the possibility of describing improved and stronger cryptographic solutions because possible adversarial behaviours ...
Later, a solution to the problem of determining the existence of two-person games whose payoffs are comparable to those obtained when a Third Trusted Party intervenes was proposed in [2] . ...
doi:10.1016/j.mcm.2006.12.013
fatcat:2guj7tef3fg2pnbwbfmlkl737i
Polynomial Reconstruction Based Cryptography
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This has initiated a line of research that exploited the rich algebraic structure of the problem and related subproblems of which in the cryptographic setting. ...
Here we give a short overview of recent works on the subject and the novel applications that were enabled due to this development. ...
Translated to the coding theoretic context, PR asks for all messages that agree with at least t positions of the received codeword, for a Reed Solomon code of rate k/n. ...
doi:10.1007/3-540-45537-x_10
fatcat:r7piimz3jbg23eaqk4npb6yjwq
Building Group Key Establishment on Group Theory: A Modular Approach
2020
Symmetry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The protocol is derived from a two-party solution by means of a protocol compiler presented by Abdalla et al. at TCC 2007, evidencing the possibility of meaningfully integrating cryptographic and group-theoretic ...
The protocol builds on a group-theoretic assumption, and a concrete example can be obtained with a decision Diffie–Hellman assumption. ...
Such cryptographic tools are often constructed from number theoretical problems (described in finite cyclic groups), and a challenging research question is whether secure constructions can be derived from ...
doi:10.3390/sym12020197
fatcat:uk3o7hbjifcmvfqzh45z5z3nru
Adaptive Selection of Cryptographic Protocols in Wireless Sensor Networks using Evolutionary Game Theory
2016
Procedia Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Various solutions based on Game theory have been recently proposed which dealt with security aspects of wireless sensor networks(WSNs). ...
Game theory applies to scenarios wherein multiple players with contrary motives contend with each other. ...
There are various solutions to WSNs security problems based on Evolutionary Game Theory as mentioned in next section but existing solutions are almost acquiescent defense because of which wireless sensor ...
doi:10.1016/j.procs.2016.02.075
fatcat:a4ihnqtdx5bvxfuzcolvfjqzoi
A game theoretic approach to integrate security with Quality of Service
2012
2012 IEEE International Conference on Communications (ICC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we aim at presenting a complete QoSS solution based on game theory. ...
In this work, we proposed a game theoretic approach to integrate both quality of service and quality of security. ...
doi:10.1109/icc.2012.6364011
dblp:conf/icc/FadlullahVK12
fatcat:avsqogusbbc5jdfei4luizh3tu
Efficient Post-Quantum Secure Network Coding Signatures in the Standard Model
2016
KSII Transactions on Internet and Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Boneh and Freeman [32] presented a network coding signature scheme in the random model based on the Small Integer Solution (SIS) problem. ...
In the security proof, we propose a new method for generating a random lattice and the corresponding trapdoor, which may be used in other cryptographic protocols. ...
Up to now, all existing method for solving this security issue can be categorized into two types: information-theoretic solution [2] [3] [4] and cryptographic solution [5] [6] . ...
doi:10.3837/tiis.2016.05.026
fatcat:q3fgiaxfzfap5kwc2izrtthdla
Cryptographically blinded games
2014
Proceedings of the fifteenth ACM conference on Economics and computation - EC '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In our cheap talk phase, the players execute a secure multi-party computation protocol to sample an action profile from an equilibrium of a "cryptographically blinded" version of the original game, in ...
Our implementation makes use of a (standard) pre-play "cheap talk" phase, in which players engage in free and non-binding communication prior to playing in the original game. ...
We are grateful to Alessandra Scafuro for raising the question of encrypting advice, to Silvio Micali for very helpful advice on exposition, and to Jesper Buus ...
doi:10.1145/2600057.2602903
dblp:conf/sigecom/HubacekP14
fatcat:zpxgp64g75fllluf5aw4pkctyi
Cryptographically Blinded Games: Leveraging Players' Limitations for Equilibria and Profit
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In our cheap talk phase, the players execute a secure multi-party computation protocol to sample an action profile from an equilibrium of a "cryptographically blinded" version of the original game, in ...
Our implementation makes use of a (standard) pre-play "cheap talk" phase, in which players engage in free and non-binding communication prior to playing in the original game. ...
We are grateful to Alessandra Scafuro for raising the question of encrypting advice, to Silvio Micali for very helpful advice on exposition, and to Jesper Buus ...
arXiv:1411.3747v1
fatcat:r25szcyphjb5bimegode4jdg2u
Fostering the Uptake of Secure Multiparty Computation in E-Commerce
2008
2008 Third International Conference on Availability, Reliability and Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Secure Multiparty Computation (SMC) protocols enable a group of mutually distrustful parties to perform a joint computation with private inputs. ...
We argue that this is due to poor performance, functionality, and scalability, as well as architectures that do not meet the needs of e-commerce applications. ...
We would like to bring them back to focus, so that realistic and pragmatic solutions enable future uptake of SMC protocols. ...
doi:10.1109/ares.2008.49
dblp:conf/IEEEares/CatrinaK08
fatcat:7gwzztzmxbeyja7vy3mqkpahta
SoK: Tools for Game Theoretic Models of Security for Cryptocurrencies
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
With this work, we aim to offer a systematization of the work that relates to this problem, considering papers that blend Game Theory with Cryptography or Distributed systems and discussing how they can ...
Understanding how to incorporate this into the models used to design cryptocurrencies has motivated a large body of work, yet many open problems still exist and current systems rarely deal with incentive ...
Game Theory meets Cryptography: computational games Rather than starting from a cryptographic setting and incorporating game theoretic notions, as presented above, one can also start from a game theoretic ...
arXiv:1905.08595v2
fatcat:qmg2qtn3avf4jlqaorbnix3t4e
Sequential Rationality in Cryptographic Protocols
[article]
2010
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To demonstrate the applicability of our framework, we revisit the problem of implementing a mediator for correlated equilibria (Dodis-Halevi-Rabin, Crypto'00), and propose a variant of their protocol that ...
However, due to the presence of computationally-bounded players and the asymptotic nature of cryptographic security, a definition of sequential rationality for this setting has thus far eluded researchers ...
The most basic solution to the problem of empty threats is to refine the NE solution, and require a strategy profile to be in a NE at every history in the game. ...
arXiv:1008.3123v1
fatcat:5cel2wtgo5cuhdecwvtzldlsty
Sequential rationality in cryptographic protocols
2013
ACM Transactions on Economics and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
To demonstrate the applicability of our framework, we revisit the problem of implementing a mediator for correlated equilibria (Dodis-Halevi-Rabin, Crypto'00), and propose a variant of their protocol that ...
However, due to the presence of computationallybounded players and the asymptotic nature of cryptographic security, a definition of sequential rationality for this setting has thus far eluded researchers ...
The most basic solution to the problem of empty threats is to refine the NE solution, and require a strategy profile to be in a NE at every history in the game. ...
doi:10.1145/2399187.2399189
fatcat:23f5m2ippjekldjp7siyfjmaym
Sequential Rationality in Cryptographic Protocols
2010
2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
To demonstrate the applicability of our framework, we revisit the problem of implementing a mediator for correlated equilibria (Dodis-Halevi-Rabin, Crypto'00), and propose a variant of their protocol that ...
However, due to the presence of computationallybounded players and the asymptotic nature of cryptographic security, a definition of sequential rationality for this setting has thus far eluded researchers ...
The most basic solution to the problem of empty threats is to refine the NE solution, and require a strategy profile to be in a NE at every history in the game. ...
doi:10.1109/focs.2010.65
dblp:conf/focs/GradwohlLR10
fatcat:doz54tdpzvczxgyxwze4vucpr4
« Previous
Showing results 1 — 15 out of 7,205 results