Feng-Hao Liu

Orcid: 0000-0003-4298-3925

According to our database1, Feng-Hao Liu authored at least 52 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Shorter ZK-SNARKs from square span programs over ideal lattices.
Cybersecur., December, 2024

(Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates.
J. Cryptol., June, 2024

2023
Ring/Module Learning with Errors under Linear Leakage - Hardness and Applications.
IACR Cryptol. ePrint Arch., 2023

Lattice-based Commit-Transferrable Signatures and Applications to Anonymous Credentials.
IACR Cryptol. ePrint Arch., 2023

Region-aware Photo Assurance System for Image Authentication.
Proceedings of the 6th IEEE International Conference on Multimedia Information Processing and Retrieval, 2023

Batch Bootstrapping II: - Bootstrapping in Polynomial Modulus only Requires O~(1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tilde{O}(1)$$\end{document} FHE Multiplications in Amortization.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Batch Bootstrapping I: - A New Framework for SIMD Bootstrapping in Polynomial Modulus.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

An Efficient CKKS-FHEW/TFHE Hybrid Encrypted Inference Framework.
Proceedings of the Computer Security. ESORICS 2023 International Workshops, 2023

Efficient Multiparty Probabilistic Threshold Private Set Intersection.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
New Lattice Two-Stage Sampling Technique and its Applications to Functional Encryption - Stronger Security and Smaller Ciphertexts.
IACR Cryptol. ePrint Arch., 2022

Leakage Resilient l-more Extractable Hash and Applications to Non-Malleable Cryptography.
IACR Cryptol. ePrint Arch., 2022

Nonmalleable Digital Lockers and Robust Fuzzy Extractors in the Plain Model.
IACR Cryptol. ePrint Arch., 2022

FedTrust: Towards Building Secure Robust and Trustworthy Moderators for Federated Learning.
Proceedings of the 5th IEEE International Conference on Multimedia Information Processing and Retrieval, 2022

2021
Leakage-Resilient IBE/ABE with Optimal Leakage Rates from Lattices.
IACR Cryptol. ePrint Arch., 2021

Rate-1 Key-Dependent Message Security via Reusable Homomorphic Extractor against Correlated-Source Attacks.
IACR Cryptol. ePrint Arch., 2021

Ring-Based Identity Based Encryption - Asymptotically Shorter MPK and Tighter Security.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

2020
Locally Decodable and Updatable Non-malleable Codes and Their Applications.
J. Cryptol., 2020

Almost Tight Security in Lattices with Polynomial Moduli - PRF, IBE, All-but-many LTF, and More.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

Rounding in the Rings.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
Leakage Resilience from Program Obfuscation.
J. Cryptol., 2019

FE for Inner Products and Its Application to Decentralized ABE.
IACR Cryptol. ePrint Arch., 2019

Efficient Multi-Party Private Set Intersection Against Malicious Adversaries.
Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security Workshop, 2019

2018
Non-Malleable Codes for Partial Functions with Manipulation Detection.
IACR Cryptol. ePrint Arch., 2018

Parameter-Hiding Order Revealing Encryption.
IACR Cryptol. ePrint Arch., 2018

2017
Practical Non-Malleable Codes from ℓ-more Extractable Hash Functions.
IACR Cryptol. ePrint Arch., 2017

Proxy Re-Encryption and Re-Signatures from Lattices.
IACR Cryptol. ePrint Arch., 2017

Vector Encoding over Lattices and Its Applications.
IACR Cryptol. ePrint Arch., 2017

2016
Various Proxy Re-Encryption Schemes from Lattices.
IACR Cryptol. ePrint Arch., 2016

Leakage-Resilient Public-Key Encryption from Obfuscation.
IACR Cryptol. ePrint Arch., 2016

Reducing the Leakage in Practical Order-Revealing Encryption.
IACR Cryptol. ePrint Arch., 2016

Deniable Attribute Based Encryption for Branching Programs from LWE.
IACR Cryptol. ePrint Arch., 2016

Fully-Secure Lattice-Based IBE as Compact as PKE.
IACR Cryptol. ePrint Arch., 2016

2015
Constant-Round MPC with Fairness and Guarantee of Output Delivery.
IACR Cryptol. ePrint Arch., 2015

Multi-Client Verifiable Computation with Stronger Security Guarantees.
IACR Cryptol. ePrint Arch., 2015

Re-encryption, functional re-encryption, and multi-hop re-encryption: A framework for achieving obfuscation-based security and instantiations from lattices.
IACR Cryptol. ePrint Arch., 2015

Bi-Deniable Inner Product Encryption from LWE.
IACR Cryptol. ePrint Arch., 2015

2014
Leakage-Resilient Circuits Revisited - Optimal Number of Computing Components without Leak-free Hardware.
IACR Cryptol. ePrint Arch., 2014

Multi-input Functional Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013
Error Tolerant Cryptography.
PhD thesis, 2013

Multi-Input Functional Encryption.
IACR Cryptol. ePrint Arch., 2013

Leakage Resilient Fully Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2013

On the Lattice Smoothing Parameter Problem.
Proceedings of the 28th Conference on Computational Complexity, 2013

2012
Tamper and Leakage Resilience in the Split-State Model.
IACR Cryptol. ePrint Arch., 2012

Public-Key Cryptography from New Multivariate Quadratic Assumptions.
IACR Cryptol. ePrint Arch., 2012

2011
Memory Delegation.
IACR Cryptol. ePrint Arch., 2011

Efficient Secure Two-Party Exponentiation.
Proceedings of the Topics in Cryptology - CT-RSA 2011, 2011

2010
Parallel Repetition Theorems for Interactive Arguments.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Algorithmic Tamper-Proof Security under Probing Attacks.
Proceedings of the Security and Cryptography for Networks, 7th International Conference, 2010

Efficient String-Commitment from Weak Bit-Commitment.
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009
Tight Parallel Repetition Theorems for Public-coin Arguments.
Electron. Colloquium Comput. Complex., 2009

2008
Secure PRNGs from Specialized Polynomial Maps over Any .
Proceedings of the Post-Quantum Cryptography, Second International Workshop, 2008

2007
Secure PRNGs from Specialized Polynomial Maps over Any F<sub>q</sub>.
IACR Cryptol. ePrint Arch., 2007


  Loading...