#### Filter Results:

#### Publication Year

2001

2014

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Luís Antunes, Lance Fortnow, Alexandre Pinto, André Souto
- computational complexity
- 2006

Kolmogorov Complexity measures the amount of information in a string by the size of the smallest program that generates that string. Antunes, Fortnow, van Melkebeek, and Vinodchandran captured the notion of useful information by computational depth, the difference between the polynomial-time-bounded Kolmogorov complexity and traditional Kolmogorov… (More)

In the information theoretic world, entropy is both the measure of randomness in a source and a bound for the compression achievable for that source by any encoding scheme. But when we must restrict ourselves to efficient schemes, entropy no longer captures these notions well. For example, there are distributions with very low entropy that nonetheless look… (More)

In [3] the authors give the first mathematical formalization of an unconditionally secure commitment scheme. Their construction has some similarities to one used to build authentication codes, so they raise the question whether there is some relation between commitment schemes and authentication schemes. They conjecture that authentication schemes with… (More)

This paper addresses the scenario of multi-release anonymization of datasets. We consider dynamic datasets where data can be inserted and deleted, and view this scenario as a case where each release is a small subset of the dataset corresponding, for example, to the results of a query. Compared to multiple releases of the full database, this has the obvious… (More)

A variant of public key encryption that promises efficiency gains due to batch processing is multi-recipient public key encryption (MR-PKE). Precisely, in MR-PKE, a dedicated encryption routine takes a vector of messages and a vector of public keys and outputs a vector of ciphertexts, where the latter can be decrypted individually, as in regular PKE. In… (More)

We do a survey of some of the most important principles of anonymization present in the literature. We identify different kinds of attacks that can be thrown against an anonymized dataset and give formulas for the maximum probability of success for each. For each principle, we identify whether it is monotonous, what attacks it is suited to counter, if any,… (More)

- Luís Antunes, Armando Matos, Alexandre Pinto, André Souto, Andreia Teixeira
- Theory of Computing Systems
- 2012

We prove several results relating injective one-way functions, time-bounded conditional Kolmogorov complexity, and time-bounded conditional entropy. First we establish a connection between injective, strong and weak one-way functions and the expected value of the polynomial time-bounded Kolmogorov complexity, denoted here by E(K t (x|f(x))). These results… (More)