4850 search results - page 228 / 970 » Proof and Computation in Geometry |
157
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...
176
click to vote
SP
2009
IEEE
16 years 1 months ago
2009
IEEE
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...
184
click to vote
ICFP
2000
ACM
15 years 11 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
152
click to vote
IACR
2011
14 years 6 months ago
2011
We put forward the notion of targeted malleability: given a homomorphic encryption scheme, in various scenarios we would like to restrict the homomorphic computations one can perf...