default search action
Long Chen 0018
Person information
- unicode name: 陈隆
- affiliation: New Jersey Institute of Technology, Newark, NJ, USA
- affiliation: Chinese Academy of Sciences, Institute of Software, TCA Laboratory, Beijing, China
- affiliation: University of Chinese Academy of Sciences, Beijing, China
Other persons with the same name
- Long Chen — disambiguation page
- Long Chen 0001
— University of Macau, Department of Computer and Information Science, China (and 1 more)
- Long Chen 0002
- Long Chen 0003
- Long Chen 0004
- Long Chen 0005
- Long Chen 0006
- Long Chen 0007
- Long Chen 0008
- Long Chen 0009 — Peking University, Institute of Microelectronics, Beijing, China
- Long Chen 0010 — City University of Hong Kong, Department of Electronic Engineering, Hong Kong
- Long Chen 0011
- Long Chen 0012
- Long Chen 0013
- Long Chen 0014
- Long Chen 0015
- Long Chen 0016
- Long Chen 0017
- Long Chen 0019
- Long Chen 0020 — University of Delaware, Department of Electrical and Computer Engineering, Newark, DE, USA (and 1 more)
- Long Chen 0021
- Long Chen 0022 — Chongqing University of Posts and Telecommunications, Institute of Computer Forensics, Chongqing, China
- Long Chen 0023 — University of Paris-Sud, Orsay, France
- Long Chen 0024
- Long Chen 0025
- Long Chen 0026
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Wenchao Liu
Round efficient privacy-preserving federated learning based on MKFHE. Comput. Stand. Interfaces 87: 103773 (2024) - [i9]Guofeng Tang, Bo Pang, Long Chen, Zhenfeng Zhang:
Efficient Lattice-Based Threshold Signatures with Functional Interchangeability. IACR Cryptol. ePrint Arch. 2024: 1067 (2024) - 2023
- [j1]Guofeng Tang
Efficient Lattice-Based Threshold Signatures With Functional Interchangeability. IEEE Trans. Inf. Forensics Secur. 18: 4173-4187 (2023) - [c10]Long Chen, Hui Guo, Ya-Nan Li, Qiang Tang:
Efficient Secure Storage with Version Control and Key Rotation. ASIACRYPT (6) 2023: 168-198 - [c9]Giuseppe Ateniese, Long Chen, Danilo Francati
Verifiable Capacity-Bound Functions: A New Primitive from Kolmogorov Complexity - (Revisiting Space-Based Security in the Adaptive Setting). Public Key Cryptography (2) 2023: 63-93 - [i8]Long Chen, Hui Guo, Ya-Nan Li, Qiang Tang:
Efficient Secure Storage with Version Control and Key Rotation. IACR Cryptol. ePrint Arch. 2023: 1421 (2023) - 2022
- [c8]Long Chen, Ya-Nan Li, Qiang Tang, Moti Yung:
End-to-Same-End Encryption: Modularly Augmenting an App with an Efficient, Portable, and Blind Cloud Storage. USENIX Security Symposium 2022: 2353-2370 - 2021
- [i7]Giuseppe Ateniese, Long Chen, Danilo Francati, Dimitrios Papadopoulos, Qiang Tang:
Verifiable Capacity-bound Functions: A New Primitive from Kolmogorov Complexity. IACR Cryptol. ePrint Arch. 2021: 162 (2021) - [i6]Tanping Zhou, Zhenfeng Zhang, Long Chen, Xiaoliang Che, Wenchao Liu, Xiaoyuan Yang:
Multi-key Fully Homomorphic Encryption Scheme with Compact Ciphertext. IACR Cryptol. ePrint Arch. 2021: 1131 (2021) - 2020
- [c7]Bo Pang, Long Chen, Xiong Fan, Qiang Tang:
Multi-input Laconic Function Evaluation. ACISP 2020: 369-388 - [c6]Long Chen, Yanan Li, Qiang Tang:
CCA Updatable Encryption Against Malicious Re-encryption Attacks. ASIACRYPT (3) 2020: 590-620 - [c5]Giuseppe Ateniese, Long Chen, Mohammad Etemad, Qiang Tang:
Proof of Storage-Time: Efficiently Checking Continuous Data Availability. NDSS 2020 - [i5]Giuseppe Ateniese, Long Chen, Mohammad Etemad, Qiang Tang:
Proof of Storage-Time: Efficiently Checking Continuous Data Availability. IACR Cryptol. ePrint Arch. 2020: 840 (2020)
2010 – 2019
- 2018
- [c4]Long Chen, Zhenfeng Zhang, Zhenfei Zhang:
On the Hardness of the Computational Ring-LWR Problem and Its Applications. ASIACRYPT (1) 2018: 435-464 - [c3]Haodong Jiang, Zhenfeng Zhang, Long Chen, Hong Wang, Zhi Ma:
IND-CCA-Secure Key Encapsulation Mechanism in the Quantum Random Oracle Model, Revisited. CRYPTO (3) 2018: 96-125 - [i4]Long Chen, Zhenfeng Zhang, Zhenfei Zhang:
On the Hardness of the Computational Ring-LWR Problem and its Applications. IACR Cryptol. ePrint Arch. 2018: 536 (2018) - [i3]Long Chen, Qiang Tang:
People Who Live in Glass Houses Should not Throw Stones: Targeted Opening Message Franking Schemes. IACR Cryptol. ePrint Arch. 2018: 994 (2018) - 2017
- [c2]Long Chen, Zhenfeng Zhang:
Bootstrapping Fully Homomorphic Encryption with Ring Plaintexts Within Polynomial Noise. ProvSec 2017: 285-304 - [c1]Long Chen, Zhenfeng Zhang, Xueqing Wang:
Batched Multi-hop Multi-key FHE from Ring-LWE with Compact Ciphertext Extension. TCC (2) 2017: 597-627 - [i2]Long Chen, Zhenfeng Zhang, Xueqing Wang:
Batched Multi-hop Multi-key FHE from ring-LWE with Compact Ciphertext Extension. IACR Cryptol. ePrint Arch. 2017: 923 (2017) - [i1]Haodong Jiang, Zhenfeng Zhang, Long Chen, Hong Wang, Zhi Ma:
Post-quantum IND-CCA-secure KEM without Additional Hash. IACR Cryptol. ePrint Arch. 2017: 1096 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-14 21:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: