搜索结果: 1-4 共查到“军事学 Cryptographic Hardness”相关记录4条 . 查询时间(0.066 秒)
On the Cryptographic Hardness of Finding a Nash Equilibrium
obfuscation nash equilibrium PPAD
font style='font-size:12px;'>
2016/1/5
We prove that finding a Nash equilibrium of a game is hard, assuming the existence of indistinguishability
obfuscation and one-way functions with sub-exponential hardness. We do so by showing
how th...
The Cryptographic Hardness of Random Local Functions -- Survey
local cryptography constant-depth circuits NC0
font style='font-size:12px;'>
2016/1/3
Constant parallel-time cryptography allows to perform complex cryptographic tasks at an
ultimate level of parallelism, namely, by local functions that each of their output bits depend
on a constant ...
On the Exact Cryptographic Hardness of Finding a Nash Equilibrium
The exact hardness of computing cryptography
font style='font-size:12px;'>
2015/12/21
The exact hardness of computing a Nash equilibrium is a fundamental open question in
algorithmic game theory. This problem is complete for the complexity class PPAD. It is well
known that problems i...
Cryptographic Hardness based on the Decoding of Reed-Solomon Codes
Cryptographic Hardness Decoding Reed-Solomon Codes
font style='font-size:12px;'>
2008/9/3
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as
the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective.
Namely, we deal with PR instances...