Abstract Public Key Encryption with Keyword Search (PEKS), introduced by Boneh et al. in
Eurocrypt'04, allows users to search encrypted documents on an untrusted server without …

Indistinguishability under chosen‐ciphertext attack (IND‐CCA) is now considered the de
facto security notion for public‐key encryption. However, this sometimes offers a stronger …

Abstract Hash Proof Systems were first introduced by Cramer and Shoup (Eurocrypt'02) as a
tool to construct efficient chosen-ciphertext-secure encryption schemes. Since then, they …

Secure aggregation becomes a major solution to providing privacy for federated learning.
Secure aggregation for mobile devices typically relies on Shamir secret sharing (SSS) to …

While password-authenticated key exchange (or PAKE) protocols have been deeply
studied, a server corruption remains the main threat, with many concrete cases nowadays …

Abstract Authenticated Key Exchange (AKE) protocols have been widely deployed in many
real-world applications for securing communication channels. In this paper, we make the …

Password-based authenticated key exchange (PAKE) protocols are a particular case of
authenticated key exchange protocols in which the secret key or password used for …

Oblivious Transfer (OT) is a simple, yet fundamental primitive which suffices to achieve
almost every cryptographic application. In a recent work (Latincrypt15), Chou and Orlandi …

Leakage attacks, including various kinds of side-channel attacks, allow an attacker to learn
partial information about the internal secrets such as the secret key and the randomness of a …

We construct the most efficient two-round adaptively secure bit-OT in the Common Random
String (CRS CRS) model. The scheme is UC secure under the Decisional Diffie-Hellman …