Duc-Phong Le

Orcid: 0000-0001-8253-1523

According to our database1, Duc-Phong Le authored at least 29 papers between 2008 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Improved fault analysis on SIMECK ciphers.
J. Cryptogr. Eng., 2022

Data breach: analysis, countermeasures and challenges.
Int. J. Inf. Comput. Secur., 2022

A Review of Blockchain in Fintech: Taxonomy, Challenges, and Future Directions.
Cryptogr., 2022

Privacy-Preserving Post-quantum Credentials for Digital Payments.
Proceedings of the Financial Cryptography and Data Security. FC 2022 International Workshops, 2022

2021
Improved algebraic attacks on lightweight block ciphers.
J. Cryptogr. Eng., 2021

User Profiling on Universal Data Insights tool on IBM Cloud Pak for Security.
Proceedings of the 18th International Conference on Privacy, Security and Trust, 2021

2020
Memory-Efficient Random Order Exponentiation Algorithm.
IEEE Access, 2020

Ensemble of Hierarchical Temporal Memory for Anomaly Detection.
Proceedings of the 7th IEEE International Conference on Data Science and Advanced Analytics, 2020

2019
Algebraic Differential Fault Analysis on SIMON Block Cipher.
IEEE Trans. Computers, 2019

DDH-based Multisignatures with Public Key Aggregation.
IACR Cryptol. ePrint Arch., 2019

On the near prime-order MNT curves.
Appl. Algebra Eng. Commun. Comput., 2019

A New Multisignature Scheme with Public Key Aggregation for Blockchain.
Proceedings of the 17th International Conference on Privacy, Security and Trust, 2019

2018
BIFF: A Blockchain-based IoT Forensics Framework with Identity Privacy.
Proceedings of the TENCON 2018, 2018

2016
Breaking an ID-based encryption based on discrete logarithm and factorization problems.
Inf. Process. Lett., 2016

Further refinements of Miller's algorithm on Edwards curves.
Appl. Algebra Eng. Commun. Comput., 2016

2015
Randomizing the Montgomery Powering Ladder.
IACR Cryptol. ePrint Arch., 2015

On near prime-order elliptic curves with small embedding degrees.
IACR Cryptol. ePrint Arch., 2015

2014
Improved Miller's Algorithm for Computing Pairings on Edwards Curves.
IEEE Trans. Computers, 2014

On Double Exponentiation for Securing RSA against Fault Analysis.
Proceedings of the Topics in Cryptology - CT-RSA 2014, 2014

2013
Speeding up Ate Pairing Computation in Affine Coordinates.
IACR Cryptol. ePrint Arch., 2013

Further Refinements of Miller Algorithm on Edwards curves
CoRR, 2013

2012
Fast point quadrupling on elliptic curves.
Proceedings of the Symposium on Information and Communication Technology 2012, 2012

2011
Fast Quadrupling of a Point in Elliptic Curve Cryptography.
IACR Cryptol. ePrint Arch., 2011

Refinements of Miller's Algorithm over Weierstrass Curves Revisited.
Comput. J., 2011

Improved Precomputation Scheme for Scalar Multiplication on Elliptic Curves.
Proceedings of the Cryptography and Coding - 13th IMA International Conference, 2011

2010
A Variant of Miller's Formula and Algorithm.
Proceedings of the Pairing-Based Cryptography - Pairing 2010, 2010

2009
Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model.
Proceedings of the Pairing-Based Cryptography, 2009

2008
Signtiming scheme based on aggregate signature.
Proceedings of the IEEE International Conference on Intelligence and Security Informatics, 2008

A Secure Round-Based Timestamping Scheme with Absolute Timestamps (Short Paper).
Proceedings of the Information Systems Security, 4th International Conference, 2008


  Loading...