搜索结果: 1-4 共查到“computational indistinguishability”相关记录4条 . 查询时间(0.041 秒)
Termination-Insensitive Computational Indistinguishability (and applications to computational soundness)
computational indistinguishability non-termination computational soundness
2010/10/11
We defined a new notion of computational indistinguishability: termination-insensitive computational indistinguishability (tic-indistinguishability). Tic-indistinguishability models indistinguishabili...
Computational Indistinguishability Amplification:Tight Product Theorems for System Composition
Computational Indistinguishability Tight Product Theorems System Composition
2009/8/18
Computational indistinguishability amplification is the problem of strengthening cryptographic
primitives whose security is defined by bounding the distinguishing advantage of an ef-
ficient disting...
The computational SLR: a logic for reasoning about computational indistinguishability
SLR logic computational indistinguishability
2009/6/9
Computational indistinguishability is a notion in complexity-theoretic cryptography and is used to
define many security criteria. However, in traditional cryptography, proving computational indisting...
Computational Indistinguishability between Quantum States and Its Cryptographic Application
quantum cryptography computational indistinguishability trapdoor propertyAkinori
2008/11/18
We introduce a computational problem of distinguishing between two specific quantum states
as a new cryptographic problem to design a quantum cryptographic scheme that is “secure” against any polynom...