This paper provides the first efficient, standard-model, fully-secure schemes for some related
and challenging forms of public-key encryption (PKE), namely deterministic and hedged …

Tree-based models are among the most efficient machine learning techniques for data
mining nowadays due to their accuracy, interpretability, and simplicity. The recent …

Encrypted control systems were introduced to enhance the security of cyber-physical
systems, which outsource control action computations to a third-party platform. To protect the …

We initiate the study of public-key encryption (PKE) secure against selective-opening attacks
(SOA) in the presence of randomness failures, ie, when the sender may (inadvertently) use …

Deterministic public-key encryption (D-PKE), introduced by Bellare, Boldyreva, and O'Neill
(CRYPTO'07), encrypts every plaintext into a unique ciphertext without using any …

Nowadays it is well known that randomness may fail due to bugs or deliberate randomness
subversion. As a result, the security of traditional public-key encryption (PKE) cannot be …

In public key encryption with keyword search (PEKS), a secure channel is required in order
to send trapdoors to the server, whereas in secure-channel free PEKS (SCF-PEKS), no such …

Private functional encryption guarantees that not only the information in ciphertexts is hidden
but also the circuits in decryption tokens are protected. A notable use case of this notion is …

This paper explores the advantages and limitations of probabilistic and deterministic
encryption schemes for securing sensitive data. While probabilistic encryption ensures high …

We study how to make any deterministic encryption scheme probabilistic and secure against
adaptively chosen ciphertext attacks. A new transpositional padding encryption scheme is …