搜索结果: 1-2 共查到“密码学 co-induction”相关记录2条 . 查询时间(0.281 秒)
Co-induction and Computational Semantics for Public-key Encryption with Key Cycles
Computational soundness and completeness greatest fixed-points least fixed points weak public-key indistinguishability strong public-key indistinguishability
2011/2/24
We consider the computational soundness and completeness of formal indistinguishability in public-key cryptography, in the presence of key-cycles. This problem in the absence of key-cycles is addresse...
Computational soundness, co-induction, and encryption cycles
Computational soundness co-induction greatest fix-points
2009/6/15
We analyze the relation between induction, co-induction and the presence of encryption cycles in the
context of computationally sound symbolic equivalence of cryptographic expressions. Our main findi...