Pu Duan

Orcid: 0000-0001-8130-111X

According to our database1, Pu Duan authored at least 33 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
SecretFlow-SCQL: A Secure Collaborative Query pLatform.
Proc. VLDB Endow., August, 2024

Privacy-Preserving Convolutional Neural Network Classification Scheme With Multiple Keys.
IEEE Trans. Serv. Comput., 2024

PEPFL: A framework for a practical and efficient privacy-preserving federated learning.
Digit. Commun. Networks, 2024

PSA: Private Set Alignment for Secure and Collaborative Analytics on Large-Scale Data.
CoRR, 2024

2023
Modified Multi-Key Fully Homomorphic Encryption Scheme in the Plain Model.
Comput. J., October, 2023

Compact Maximum Correntropy-Based Error State Kalman Filter for Exoskeleton Orientation Estimation.
IEEE Trans. Control. Syst. Technol., March, 2023

Multi-key Fully Homomorphic Encryption from Additive Homomorphism.
Comput. J., January, 2023

2022
Efficient Function Queryable and Privacy Preserving Data Aggregation Scheme in Smart Grid.
IEEE Trans. Parallel Distributed Syst., 2022

Privacy-Preserving Multi-Class Support Vector Machine Model on Medical Diagnosis.
IEEE J. Biomed. Health Informatics, 2022

Privacy-Preserving Classification Scheme Based on Support Vector Machine.
IEEE Syst. J., 2022

Multi-Kernel Maximum Correntropy Kalman Filter for Orientation Estimation.
IEEE Robotics Autom. Lett., 2022

Updatable privacy-preserving itK-nearest neighbor query in location-based s-ervice.
Peer-to-Peer Netw. Appl., 2022

MDOPE: Efficient multi-dimensional data order preserving encryption scheme.
Inf. Sci., 2022

Toward practical privacy-preserving linear regression.
Inf. Sci., 2022

Group public key encryption supporting equality test without bilinear pairings.
Inf. Sci., 2022

Cryptanalysis and Improvement of DeepPAR: Privacy-Preserving and Asynchronous Deep Learning for Industrial IoT.
IEEE Internet Things J., 2022

Privacy-preserving convolutional neural network prediction with low latency and lightweight users.
Int. J. Intell. Syst., 2022

Verifiable privacy-preserving association rule mining using distributed decryption mechanism on the cloud.
Expert Syst. Appl., 2022

DP-PSI: Private and Secure Set Intersection.
CoRR, 2022

Design and Evaluation of a Low Friction Rigid-Soft Hybrid Mechanism for Hand Exoskeletons with Finite Element Analysis.
Proceedings of the IEEE International Conference on Robotics and Biomimetics, 2022

Multi-Objective Admittance Control: An LMI-Based Method.
Proceedings of the International Conference on Advanced Robotics and Mechatronics , 2022

2021
Secure Privacy-Preserving Association Rule Mining With Single Cloud Server.
IEEE Access, 2021

2020
Variable Stiffness Control with Strict Frequency Domain Constraints for Physical Human-Robot Interaction.
Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2020

Introduction to Secure Collaborative Intelligence (SCI) Lab.
Proceedings of the PPMLP'20: Proceedings of the 2020 Workshop on Privacy-Preserving Machine Learning in Practice, 2020

2012
Shadow attacks: automatically evading system-call-behavior based malware detection.
J. Comput. Virol., 2012

2011
Fastplay-A Parallelization Model and Implementation of SMC on CUDA based GPU Cluster Architecture.
IACR Cryptol. ePrint Arch., 2011

2010
Privacy-Preserving Matching Protocols for Attributes and Strings.
IACR Cryptol. ePrint Arch., 2010

2007
An Efficient Identity-based Signature Scheme and Its Applications.
Int. J. Netw. Secur., 2007

2006
An efficient identity-based signature scheme with batch verifications.
Proceedings of the 1st International Conference on Scalable Information Systems, 2006

2005
A Method for Building More Non-supersingular Elliptic Curves Suitable for Pairing-based Cryptosystems.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Special Polynomial Families for Generating More Suitable Elliptic Curves for Pairing-Based Cryptosystems.
IACR Cryptol. ePrint Arch., 2005

Effective Polynomial Families for Generating More Pairing-Friendly Elliptic Curves.
IACR Cryptol. ePrint Arch., 2005

A New Method of Building More Non-supersingular Elliptic Curves.
Proceedings of the Computational Science and Its Applications, 2005


  Loading...