A secure index is a data structure that allows a querier with a``trapdoor''for a word x to test in
O (1) time only if the index contains x; The index reveals no information about its contents …

Using dynamic Searchable Symmetric Encryption, a user with limited storage resources can
securely outsource a database to an untrusted server, in such a way that the database can …

We put forward a new framework that makes it possible to re-write or compress the content
of any number of blocks in decentralized services exploiting the blockchain technology. As …

The right of an individual to request the deletion of their personal data by an entity that might
be storing it–referred to as the right to be forgotten–has been explicitly recognized …

Collectors of confidential data, such as governmental agencies, hospitals, or search engine
providers, can be pressured to permit data to be used for purposes other than that for which …

A sparse Merkle tree is an authenticated data structure based on a perfect Merkle tree of
intractable size. It contains a distinct leaf for every possible output from a cryptographic hash …

Encrypted databases, a popular approach to protecting data from compromised database
management systems (DBMS's), use abstract threat models that capture neither realistic …

Hash tables are extensively used in networking to implement data-structures that associate
a set of keys to a set of values, as they provide O (1), query, insert and delete operations …

In recent years, encrypted databases have emerged as a promising direction that provides
data confidentiality without sacrificing functionality: queries are executed on encrypted data …

Probabilistic independence is a useful concept for describing the result of random sampling—
a basic operation in all probabilistic languages—and for reasoning about groups of random …