搜索结果: 1-15 共查到“军事学 Games”相关记录17条 . 查询时间(0.156 秒)
21 - Bringing Down the Complexity: Fast Composable Protocols for Card Games Without Secret State
Multiparty Computation Card Games Cryptographic Protocols
2018/4/4
While many cryptographic protocols for card games have been proposed, all of them focus on card games where players have some state that must be kept secret from each other, e.g. closed cards and bluf...
ROYALE: A Framework for Universally Composable Card Games with Financial Rewards and Penalties Enforcement
Poker Card Games Fairness Blockchain
2018/3/7
While many tailor made card game protocols are known, the vast majority of those suffer from three main issues: lack of mechanisms for distributing financial rewards and punishing cheaters, lack of co...
This work shows that weighted majority voting games occur in cryptocurrencies. In particular, two such games are highlighted. The first game, which we call the Rule Game, pertains to the scenario wher...
(A Counterexample to) Parallel Repetition for Non-Signaling Multi-Player Games
parallel repetition non-signaling strategies
2017/11/28
We give a three-player game whose non-signaling value is constant (2/3) under any number of parallel repetitions. This is the first known setting where parallel repetition completely fails to reduce t...
Privacy Notions for Privacy-Preserving Distributed Data Mining: Foundations and Privacy Games
privacy privacy games privacy notions
2017/11/27
It is well understood that the huge volumes of data captured in recent years have the potential to underpin significant research developments in many fields. But, to realise these benefits, all releva...
Repeated Games for Generating Randomness in Encryption
game theory repeated game randomness
2017/3/6
In encryption schemes, the sender may not generate randomness properly if generating randomness is costly, and the sender is not concerned about the security of a message. The problem was studied by t...
Cost-Aware Cut-and-Choose Games with Applications in Cryptography and Prefix-Free Codes
Cut-and-choose games Algorithmic game theory Unequal-cost Huffman codes
2017/2/28
Cost-aware cut-and-choose game is a fundamental technique that has many cryptographic applications. Best existing solutions of this game assumed for simplicity that the number of challenges is publicl...
MARKOV MODELING OF MOVING TARGET DEFENSE GAMES
Moving Target Defense Security Capacity Markov Models
2016/12/12
We introduce a Markov-model-based framework for Moving Target Defense (MTD) analysis. The framework allows modeling of a broad range of MTD strategies, provides general theorems about how the probabil...
Random number generators have direct applications in information security, online
gaming, gambling, and computer science in general. True random number generators
need an entropy source which is a p...
Optimality of Non-Adaptive Strategies: The Case of Parallel Games
indistinguishability proofs conditional equivalence random systems
2016/1/23
Most cryptographic security proofs require showing that two systems are indistinguishable. A central tool in such proofs is that of a game, where winning the game means provoking a certain condition...
On Power Splitting Games in Distributed Computation: The Case of Bitcoin Pooled Mining
Cryptocurrency block withholding attack distributed computation
2016/1/4
Several new services incentivize clients to compete in solving large computation tasks in exchange for financial rewards. This model of competitive distributed computation enables every user connected...
One-Sided Device-Independent QKD and Position-based Cryptography from Monogamy Games
foundations quantum cryptography
2016/1/3
A serious concern with quantum key distribution (QKD)
schemes is that, when under attack, the quantum devices in a real-life
implementation may behave differently than modeled in the security
proof...
Cache Games - Bringing Access Based Cache Attacks on AES to Practice
AES side channel access-based cache-attacks
2010/11/26
In this paper we analyze the case of AES and present an attack which is capable of recovering the full secret key in almost realtime for AES-128, requiring only a very limited number of observed encry...
Sequences of Games:A Tool for Taming Complexity in Security Proofs
Sequences of Games Taming Complexity Security Proofs
2009/4/2
This paper is brief tutorial on a technique for structuring security proofs as sequences
games.
Games and the Impossibility of Realizable Ideal Functionality
Games Realizable Ideal Functionality security mechanism
2009/2/17
A cryptographic primitive or a security mechanism can be
specified in a variety of ways, such as a condition involving a game against
an attacker, construction of an ideal functionality, or a list o...