1

Subvert KEM to Break DEM: Practical Algorithm-Substitution Attacks on Public-Key Encryption

Motivated by the currently widespread concern about mass surveillance of encrypted communications, Bellare et al. introduced at CRYPTO 2014 the notion of Algorithm-Substitution Attack (ASA) where the legitimate encryption algorithm is replaced by a …

Hybrid Routing: Towards Resilient Routing in Anonymous Communication Networks

Anonymous communication networks (ACNs) are intended to protect the metadata during communication. As classic ACNs, onion mix-nets are famous for strong anonymity, in which the source defines a static path and wraps the message multi-times with the …

Secure and Fast Decision Tree Evaluation on Outsourced Cloud Data

Decision trees are famous machine learning classifiers which have been widely used in many areas, such as healthcare, text classification and remote diagnostics, etc. The service providers usually host a decision tree model on the cloud server and …

Privacy-Preserving Biometric-Based Remote User Authentication with Leakage Resilience

Biometric-based remote user authentication is a useful primitive that allows an authorized user to authenticate to a remote server using his biometrics. Leakage attacks, such as side-channel attacks, allow an attacker to learn partial knowledge of …

Asymmetric Subversion Attacks on Signature Schemes

Subversion attacks against cryptosystems have already received wide attentions since several decades ago, while the Snowden revelations in 2013 reemphasized the need to further exploring potential avenues for undermining the cryptography in practice. …

Privacy-Preserving Mining of Association Rule on Outsourced Cloud Data from Multiple Parties

It has been widely recognized as a challenge to carry out data analysis and meanwhile preserve its privacy in the cloud. In this work, we mainly focus on a well-known data analysis approach namely association rule mining. We found that the data …

Optimal Security Reductions for Unique Signatures: Bypassing Impossibilities with a Counterexample

Optimal security reductions for unique signatures (Coron, Eurocrypt 2002) and their generalization, i.e., efficiently re-randomizable signatures (Hofheinz et al. PKC 2012 & Bader et al. Eurocrypt 2016) have been well studied in the literature. …

PriMal: Cloud-Based Privacy-Preserving Malware Detection

The ongoing threat of malware has raised significant security and privacy concerns. Motivated by these issues, the cloud-based detection system is of increasing interest to detect large-scale malware as it releases the burden of client and improves …

Cryptographic Reverse Firewall via Malleable Smooth Projective Hash Functions

Motivated by the revelations of Edward Snowden, post- Snowden cryptography has become a prominent research direction in recent years. In Eurocrypt 2015, Mironov and Stephens-Davidowitz proposed a novel concept named cryptographic reverse firewall …

Iterated Random Oracle: A Universal Approach for Finding Loss in Security Reduction

The indistinguishability security of a public-key cryptosystem can be reduced to a computational hard assumption in the random oracle model, where the solution to a computational hard problem is hidden in one of the adversary’s queries to the random …