3228 search results - page 184 / 646 » Computationally Sound Proofs |
183
click to vote
ICTCS
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
201
click to vote
ECCC
2011
15 years 1 months ago
2011
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
154
click to vote
DLT
2008
15 years 8 months ago
2008
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
154
click to vote
IACR
2011
14 years 6 months ago
2011
We present a method to compile Yao’s two-player garbled circuit protocol into one that is secure against malicious adversaries that relies on witness indistinguishability. Our ap...
142
click to vote
ESORICS
2002
Springer
16 years 6 months ago
2002
Springer
In recent times information flow and non-interference have become very popular concepts for expressing both integrity and privacy properties. We present the first general definitio...