40 search results - page 2 / 8 » Relating Two Standard Notions of Secrecy |
FOCS
2004
IEEE
13 years 9 months ago
2004
IEEE
In this work we look back into the proof of the PCP Theorem, with the goal of finding new proofs that are "more combinatorial" and arguably simpler. For that we introduc...
TALG
2008
13 years 5 months ago
2008
We introduce a new notion of embedding, called minimum-relaxation ordinal embedding, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedd...
ALT
2008
Springer
14 years 2 months ago
2008
Springer
This paper studies Dawid’s prequential framework from the point of view of the algorithmic theory of randomness. The main result is that two natural notions of randomness coincid...
FROCOS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
FOSSACS
2006
Springer
13 years 9 months ago
2006
Springer
The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence dep...