A user’s data is represented by a finite-valued random variable. Given a function of the data, a querier is required to recover, with at least a prescribed probability, the value of the function based on a query response provided by the user. The user devises the query response, subject to the recoverability requirement, so as to maximize privacy of the data from the querier. Privacy is measure...

A user’s data is represented by a finite-valued random variable. Given a function of the data, a querier is required to recover, with at least a prescribed probability, the value of the function based on a query response provided by the user. The user devises the query response, subject to the recoverability requirement, so as to maximize privacy of the data from the querier. Privacy is measure...

We point some contributions to the construction of Locally Recoverable codes from algebraic curves recently presented by A. Barg, I. Tamo and S. Vladut, that can lead to improvements concerning the definition, the parameters and the local recovering of these codes.

We find a characterization of those Polish ultrametric spaces on which each Baire one function is first return recoverable. The notion of pseudo-convergence originating in the theory of valuation fields plays a crucial role in the characterization.