computational complexity; cryptography; lower bounds; nonblack-box zero knowledge; impossibility results; general zero-knowledge; complexity assumptions; computationally sound argument system; bounded-resettable zero knowledge; cryptography; nontrivial l;
机译:非黑匣子零知识的下界
机译:并发零知识的下界
机译:并发零知识的下界*
机译:非黑匣子零知识的下限
机译:衡量美国零下限对货币政策的约束
机译:最大公共子图:一些上限和下限结果
机译:非黑匣子零知识的下界