搜索结果: 1-2 共查到“密码学 NP-hardness”相关记录2条 . 查询时间(0.062 秒)
On Basing Search SIVP on NP-Hardness
foundations separation
font style='font-size:12px;'>
2016/12/9
The possibility of basing cryptography on the minimal assumption NP⊈BPPNP⊈BPP is at the very heart of textbflexity-theoretic cryptography. The closest we have gotten so far is lattice-base...
On Basing Private Information Retrieval on NP-Hardness
Private Information Retrieval NP-hardness Reductions
font style='font-size:12px;'>
2015/12/21
The possibility of basing the security of cryptographic objects on the (minimal) assumption
that NP ⊈ BPP is at the very heart of complexity-theoretic cryptography. Most known results
along th...