We show new lower bounds on the sample complexity of (ε, δ)-differentially private
algorithms that accurately answer large sets of counting queries. A counting query on a …

In this article, we propose an accountable and efficient data sharing scheme for industrial
IoT (IIoT), named an accountable and data sharing scheme (ADS), in which a data owner …

Proxy re-encryption (PRE), as a promising cryptographic primitive for secure data sharing in
clouds, has been widely studied for decades. PRE allows the proxies to use the re …

Suppose Alice uses at-out-of-n secret sharing to store her secret key on n servers. Her
secret key is protected as long as t of them do not collude. However, what if a less-than-t …

A t-out-of-n threshold decryption system assigns key shares to n parties so that any t of them
can decrypt a well-formed ciphertext. Existing threshold decryption systems are not secure …

The best existing pairing-based traitor tracing schemes have O (N)-sized parameters, which
has stood since 2006. This intuitively seems to be consistent with the fact that pairings allow …

We study watermarking schemes for language models with provable guarantees. As we
show, prior works offer no robustness guarantees against adaptive prompting: when a user …

Attribute-based encryption (ABE) as one of the most interesting multi-recipient public
encryption systems, naturally requires some “tracing mechanisms” to identify misbehaving …

In this paper, we describe a new traitor tracing scheme which relies on Tardos' collusion
secure codes to achieve constant size ciphertexts. Our scheme is also equipped with a black …

Blockchain has become an integral part of various IoT applications, and it has been
successful in boosting performance in various aspects. Applying blockchain as a trust …