Feng-Hao Liu

Publications
Influence

Tamper and Leakage Resilience in the Split-State Model

Feng-Hao Liu, Anna Lysyanskaya
Mathematics, Computer Science
IACR Cryptol. ePrint Arch.
19 August 2012

In this paper, we show how to algorithmically secure any cryptographic functionality from continual split-state leakage and tampering attacks. Expand

Memory Delegation

Kai-Min Chung, Y. Kalai, Feng-Hao Liu, R. Raz
Computer Science
CRYPTO
14 August 2011

We consider the problem of delegating computation, where the delegator doesn't even know the input to the function being delegated, and runs in time significantly smaller than the input length. Expand

Constant-Round MPC with Fairness and Guarantee of Output Delivery

S. D. Gordon, Feng-Hao Liu, E. Shi
Computer Science
CRYPTO
16 August 2015

We study the round complexity of multiparty computation with fairness and guaranteed output delivery, assuming existence of an honest majority. Expand

Leakage Resilient Fully Homomorphic Encryption

A. Berkoff, Feng-Hao Liu
Computer Science
IACR Cryptol. ePrint Arch.
24 February 2014

We construct the first leakage resilient variants of fully homomorphic encryption (FHE) schemes based on the decision learning with errors (DLWE) assumption. Expand

Various Proxy Re-Encryption Schemes from Lattices

X. Fan, Feng-Hao Liu
Computer Science
IACR Cryptol. ePrint Arch.
2016

In this work, we first point out a subtle but serious mistake in the security proof of the work by Kirshanova. Expand

Reducing the Leakage in Practical Order-Revealing Encryption

David Cash, Feng-Hao Liu, Adam O'Neill, C. Zhang
Computer Science
IACR Cryptol. ePrint Arch.
2016

We study practical order-revealing encryption (ORE) with a well-defined leakage profile (the information revealed about the plaintexts from their ciphertexts), a direction recently initiated by Chenette, Lewi, Weis, and Wu. Expand

Parameter-Hiding Order Revealing Encryption

David Cash, Feng-Hao Liu, Adam O'Neill, Mark Zhandry, C. Zhang
Computer Science
IACR Cryptol. ePrint Arch.
2 December 2018

We define a new notion of security for order-revealing encryption, called parameter-hiding ORE, which maintains the secrecy of these parameters. Expand

Re-encryption, Functional Re-encryption, and Multi-hop Re-encryption: A Framework for Achieving Obfuscation-Based Security and Instantiations from Lattices

Nishanth Chandran, M. Chase, Feng-Hao Liu, Ryo Nishimaki, Keita Xagawa
Mathematics, Computer Science
Public Key Cryptography
26 March 2014

We construct a secure obfuscator for the re-encryption primitive from the Decisional Learning with Errors DLWE assumption, without going through fully homomorphic encryption. Expand

Public-Key Cryptography from New Multivariate Quadratic Assumptions

Yun-Ju Huang, Feng-Hao Liu, B. Yang
Computer Science, Mathematics
Public Key Cryptography
21 May 2012

We study a new type of assumption inspired from the field of solving multivariate quadratic (MQ) equations that can be used to construct public-key encryptions. Expand

Parallel Repetition Theorems for Interactive Arguments

Kai-Min Chung, Feng-Hao Liu
Mathematics, Computer Science
TCC
9 February 2010

We study efficient parallel repetition theorems for several classes of interactive arguments and obtain the following results: We show a tight parallel repetition theorem for public-coin interactive arguments. Expand

Recommended Authors