Hongda Li

Affiliations:
  • Chinese Academy of Sciences, Institute of Information Engineering, State Key Lab of Information Security, Beijing, China
  • University of Chinese Academy of Sciences, School of Cyber Security, Beijing, China
  • Chinese Academy of Sciences, Data Assurance and Communication Security Research Center, Beijing, China


According to our database1, Hongda Li authored at least 46 papers between 2004 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Public-Key Encryption from Average Hard NP Language.
IACR Cryptol. ePrint Arch., 2023

Adaptively Secure Constrained Verifiable Random Function.
Proceedings of the Science of Cyber Security - 5th International Conference, 2023

2022
A Conflict-Free Redactable Blockchain.
Proceedings of the 2022 IEEE International Conference on Pervasive Computing and Communications Workshops and other Affiliated Events, 2022

Generic Construction of (Hierarchical) Functional Pseudorandom Functions.
Proceedings of the CCRIS 2022: 3rd International Conference on Control, Robotics and Intelligent System, Virtual Event, China, August 26, 2022

2020
Some Low Round Zero Knowledge Protocols.
IACR Cryptol. ePrint Arch., 2020

Analysis of bitcoin backbone protocol in the non-flat model.
Sci. China Inf. Sci., 2020

2019
UniqueChain: A Fast, Provably Secure Proof-of-Stake Based Blockchain Protocol in the Open Setting.
IACR Cryptol. ePrint Arch., 2019

Efficient Zero-Knowledge for NP from Secure Two-Party Computation.
IACR Cryptol. ePrint Arch., 2019

Hierarchical Functional Signcryption: Notion and Construction.
Proceedings of the Provable Security, 2019

Public-Coin Differing-Inputs Obfuscator for Hiding-Input Point Function with Multi-bit Output and Its Applications.
Proceedings of the Progress in Cryptology - INDOCRYPT 2019, 2019

Witness Encryption with (Weak) Unique Decryption and Message Indistinguishability: Constructions and Applications.
Proceedings of the Information Security and Privacy - 24th Australasian Conference, 2019

2018
Candidate Differing-Inputs Obfuscation from Indistinguishability Obfuscation and Auxiliary-Input Point Obfuscation.
IACR Cryptol. ePrint Arch., 2018

Micropaying to a Distributed Payee with Instant Confirmation.
Proceedings of the Information and Communications Security - 20th International Conference, 2018

2017
Augmented Black-Box Simulation and Zero Knowledge Argument for NP.
IACR Cryptol. ePrint Arch., 2017

Attribute-based non-interactive key exchange.
Sci. China Inf. Sci., 2017

2015
Secure Mobile Agent from Leakage-Resilient Proxy Signatures.
Mob. Inf. Syst., 2015

Multi-Use Unidirectional Proxy Re-Signatures of Constant Size without Random Oracles.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

Multi-Hop Unidirectional Proxy Re-Encryption from Multilinear Maps.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

On Zero Knowledge Argument with PQT Soundness.
Proceedings of the Information Security Applications - 16th International Workshop, 2015

Constrained Verifiable Random Functions from Indistinguishability Obfuscation.
Proceedings of the Provable Security, 2015

Fully Leakage-Resilient Non-malleable Identification Schemes in the Bounded-Retrieval Model.
Proceedings of the Advances in Information and Computer Security, 2015

The Generic Transformation from Standard Signatures to Identity-Based Aggregate Signatures.
Proceedings of the Information Security - 18th International Conference, 2015

One-Round Witness Indistinguishability from Indistinguishability Obfuscation.
Proceedings of the Information Security Practice and Experience, 2015

Verifiable Random Functions from (Leveled) Multilinear Maps.
Proceedings of the Cryptology and Network Security - 14th International Conference, 2015

Constant-Round Leakage-Resilient Zero-Knowledge Argument for NP from the Knowledge-of-Exponent Assumption.
Proceedings of the Information Security and Privacy - 20th Australasian Conference, 2015

2014
Constant-Round Leakage-Resilient Zero-Knowledge Arguments of Knowledge for NP.
IACR Cryptol. ePrint Arch., 2014

Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP.
Sci. China Inf. Sci., 2014

Joint Signature and Encryption in the Presence of Continual Leakage.
Proceedings of the Information Security Applications - 15th International Workshop, 2014

Attribute-Based Signatures for Circuits from Multilinear Maps.
Proceedings of the Information Security - 17th International Conference, 2014

Functional Signatures from Indistinguishability Obfuscation.
Proceedings of the Trusted Systems - 6th International Conference, 2014

Ring Signatures of Constant Size Without Random Oracles.
Proceedings of the Information Security and Cryptology - 10th International Conference, 2014

Simpler CCA-Secure Public Key Encryption from Lossy Trapdoor Functions.
Proceedings of the Information Security and Cryptology - 10th International Conference, 2014

2013
Efficient Leakage-Resilient Signature Schemes in the Generic Bilinear Group Model.
IACR Cryptol. ePrint Arch., 2013

Leakage-Resilient Zero-Knowledge Proofs of Knowledge for NP.
Proceedings of the Network and System Security - 7th International Conference, 2013

Leakage-Resilient Proxy Signatures.
Proceedings of the 2013 5th International Conference on Intelligent Networking and Collaborative Systems, 2013

ID-Based Signcryption with Restrictive Unsigncryption.
Proceedings of the 2013 5th International Conference on Intelligent Networking and Collaborative Systems, 2013

2012
Universally composable zero-knowledge sets.
Int. J. Grid Util. Comput., 2012

Round-optimal zero-knowledge proofs of knowledge for NP.
Sci. China Inf. Sci., 2012

A Note on Constant-Round Concurrent Zero-Knowledge Arguments of Knowledge for NP.
Proceedings of the Internet and Distributed Computing Systems, 2012

A Leakage-Resilient Zero Knowledge Proof for Lattice Problem.
Proceedings of the Cyberspace Safety and Security - 4th International Symposium, 2012

2010
On constant-round zero-knowledge proofs of knowledge for NP-relations.
Sci. China Inf. Sci., 2010

2008
Existence of 3-round zero-knowledge proof systems for NP.
Sci. China Ser. F Inf. Sci., 2008

2005
Efficient reduction of 1 out of n oblivious transfers in random oracle model.
IACR Cryptol. ePrint Arch., 2005

An Unbounded Simulation-Sound Non-interactive Zero-Knowledge Proof System for NP.
Proceedings of the Information Security and Cryptology, First SKLOIS Conference, 2005

2004
Distributed Oblivious Function Evaluation and Its Applications.
J. Comput. Sci. Technol., 2004

Oblivious Polynomial Evaluation.
J. Comput. Sci. Technol., 2004


  Loading...