搜索结果: 1-7 共查到“军事学 computational soundness”相关记录7条 . 查询时间(0.154 秒)
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 Soundness about Formal Encryption in Presence of Secret Shares and Key Cycles
key cycles secret sharing computational soundness
2010/9/9
The computational soundness of formal encryption is researched extensively after the work by Abadi and Rogaway. A recent work by Abadi and Warinschi extends this work to a scenario in which secret sha...
Computational Soundness for Key Exchange Protocols with Symmetric Encryption
Computational Soundness Key Exchange Protocols Symmetric Encryption
2009/8/18
Formal analysis of security protocols based on symbolic models has
been very successful in finding
aws in published protocols and prov-
ing protocols secure, using automated tools. An important qu...
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...
CoSP: A general framework for computational soundness proofs– or –The computational soundness of the applied pi-calculus
CoSP computational soundness applied pi-calculus
2009/6/11
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic
models and for embedding these proofs into formal calculi. CoSP considers arbitrary equational
theorie...
Computational Soundness of Symbolic Zero-Knowledge Proofs Against Active Attackers
Computational Soundness Symbolic Zero-Knowledge Proofs Active Attackers
2009/6/3
The abstraction of cryptographic operations by term algebras,
called Dolev-Yao models, is essential in almost all
tool-supported methods for proving security protocols. Recently
significant progres...
Computational Soundness of Formal Indistinguishability and Static Equivalence
Formal Indistinguishability Static Equivalence
2008/12/18
In the investigation of the relationship between the formal
and the computational view of cryptography, a recent approach, first
proposed in [10], uses static equivalence from cryptographic pi calcu...