Return to Answer

It seems that randomised encoding, as you are probably already aware, allows for two functions f(x) and g(x, r) that satisfy the following two properties.

1. Correctness: there exists some function D such that f(x) = D(g(x, r)).
2. Privacy: knowledge of g(x, r) will not feasibly reveal any knowledge of f(x) to differentiate it from f(y) without comparing g(x, r) and g(y, r).

On the other hand indistinguishability obfuscation allows a function f(x) that satisfies the following two properties.

1. Completeness: there exists some function D such that f(x) = D(x).
2. Indistinguishability: knowledge of D(x) will not feasibly reveal any knowledge of f(x) to differentiate it from f(y) without comparing D(x) and D(y).

If D(x) = g(x, r) was true, and the properties were otherwise satisfied, then completeness and indistinguishability would be satisfied as equivalent to correctness and privacy. Hence, in this case randomised encryption would be equivalent to indistinguishability obfuscation. However, randomised encryption expands further on this to say that g(x, r) could be any function, and not necessarily equal to D(x).

Further reading that might be of interest for the topic can be found here and here.

It seems that randomised encoding, as you are probably already aware, allows for two functions f(x) and g(x, r) that satisfy the following two properties.

1. Correctness: there exists some function D such that f(x) = D(g(x, r)).
2. Privacy: knowledge of g(x, r) will not feasibly reveal any knowledge of f(x) to differentiate it from f(y) without comparing g(x, r) and g(y, r).

On the other hand indistinguishability obfuscation allows a function f(x) that satisfies the following two properties.

1. Completeness: there exists some function E such that f(x) = E(x).
2. Indistinguishability: knowledge of E(x) will not feasibly reveal any knowledge of f(x) to differentiate it from f(y) without comparing E(x) and E(y).

If E(x) = g(x, r) = D(g(x, r)) was true, and the properties were otherwise satisfied, then completeness and indistinguishability would be satisfied as equivalent to correctness and privacy. Hence, in this case randomised encryption would be equivalent to indistinguishability obfuscation. However, randomised encryption expands further on this to say that g(x, r) could be any function, and not necessarily equal to E(x).

Further reading that might be of interest for the topic can be found here and here.

It seems that randomised encoding, as you are probably already aware, allows for two functions f(x) and g(x, r) that satisfy the following two properties.

1. Correctness: there exists some function D such that f(x) = D(g(x, r)).
2. Privacy: knowledge of g(x, r) will not feasibly reveal any knowledge of x to differentiate it from y without comparing g(x, r) and g(y, r).

On the other hand indistinguishability obfuscation allows two function f(x) that satisfies the following two properties.

1. Completeness: there exists some function D such that f(x) = D(f(x)).
2. Indistinguishability: knowledge of D(f(x)) will not feasibly reveal any knowledge of x to differentiate it from y without comparing D(f(x)) and D(f(y)).

If f(x) = g(x, r) was true, and the properties were otherwise satisfied, then completeness and indistinguishability would be satisfied as equivalent to correctness and privacy. Hence, in this case randomised encryption would be equivalent to indistinguishability obfuscation. However, randomised encryption expands further on this to say that g(x, r) could be any function, and not necessarily equal to f(x).

Further reading that might be of interest for the topic can be found here and here.

It seems that randomised encoding, as you are probably already aware, allows for two functions f(x) and g(x, r) that satisfy the following two properties.

1. Correctness: there exists some function D such that f(x) = D(g(x, r)).
2. Privacy: knowledge of g(x, r) will not feasibly reveal any knowledge of f(x) to differentiate it from f(y) without comparing g(x, r) and g(y, r).

On the other hand indistinguishability obfuscation allows a function f(x) that satisfies the following two properties.

1. Completeness: there exists some function D such that f(x) = D(x).
2. Indistinguishability: knowledge of D(x) will not feasibly reveal any knowledge of f(x) to differentiate it from f(y) without comparing D(x) and D(y).

If D(x) = g(x, r) was true, and the properties were otherwise satisfied, then completeness and indistinguishability would be satisfied as equivalent to correctness and privacy. Hence, in this case randomised encryption would be equivalent to indistinguishability obfuscation. However, randomised encryption expands further on this to say that g(x, r) could be any function, and not necessarily equal to D(x).

Further reading that might be of interest for the topic can be found here and here.

It seems that randomised encoding, as you are probably already aware, allows for two functions f(x) and g(x, r) that satisfy the following two properties.

1. Correctness: there exists some function D such that f(x) = D(g(x, r)).
2. Privacy: knowledge of g(x, r) will not reveal any knowledge of x to differentiate it from y when g(x, r) = g(y, r).

On the other hand indistinguishability obfuscation allows two function f(x) that satisfies the following two properties.

1. Completeness: there exists some function D such that f(x) = D(f(x)).
2. Indistinguishability: knowledge of D(f(x)) will not reveal any knowledge of x to differentiate it from y when D(f(x)) = D(f(y)).

If f(x) = g(x, r) was true, and the properties were otherwise satisfied, then completeness and indistinguishability would be satisfied as equivalent to correctness and privacy. Hence, in this case randomised encryption would be equivalent to indistinguishability obfuscation. However, randomised encryption expands further on this to say that g(x, r) could be any function, and not necessarily equal to f(x).

Further reading that might be of interest for the topic can be found here and here.

It seems that randomised encoding, as you are probably already aware, allows for two functions f(x) and g(x, r) that satisfy the following two properties.

1. Correctness: there exists some function D such that f(x) = D(g(x, r)).
2. Privacy: knowledge of g(x, r) will not feasibly reveal any knowledge of x to differentiate it from y without comparing g(x, r) and g(y, r).

On the other hand indistinguishability obfuscation allows two function f(x) that satisfies the following two properties.

1. Completeness: there exists some function D such that f(x) = D(f(x)).
2. Indistinguishability: knowledge of D(f(x)) will not feasibly reveal any knowledge of x to differentiate it from y without comparing D(f(x)) and D(f(y)).

If f(x) = g(x, r) was true, and the properties were otherwise satisfied, then completeness and indistinguishability would be satisfied as equivalent to correctness and privacy. Hence, in this case randomised encryption would be equivalent to indistinguishability obfuscation. However, randomised encryption expands further on this to say that g(x, r) could be any function, and not necessarily equal to f(x).

Further reading that might be of interest for the topic can be found here and here.