171 search results - page 7 / 35 » CoSP: a general framework for computational soundness proofs |
ESORICS
2009
Springer
16 years 7 days ago
2009
Springer
We propose a probabilistic contract signing protocol that achieves balance even in the presence of an adversary that may delay messages sent over secure channels. To show that this...
ICFP
2003
ACM
15 years 11 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
155
click to vote
PLPV
2011
ACM
14 years 2 months ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
91
Voted
EUROCRYPT
2007
Springer
15 years 5 months ago
2007
Springer
Protocols proven secure within the universal composability (UC) framework satisfy strong and desirable security properties. Unfortunately, it is known that within the “plain” m...
103
click to vote
PLDI
2003
ACM
15 years 4 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...