Ahmad Akmal Aminuddin Mohd Kamal

Orcid: 0000-0002-7941-3021

According to our database1, Ahmad Akmal Aminuddin Mohd Kamal authored at least 22 papers between 2017 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Improved protocols for secure multiplication using secret sharing scheme.
ICT Express, 2024

Secure User Authentication with Secret Sharing and Smart Contract for Permissioned Blockchain.
Proceedings of the 13th IEEE Global Conference on Consumer Electronics, 2024

Secure Information Sharing with Access Control and Tamper Detection for Drone-Based Disaster Management.
Proceedings of the 13th IEEE Global Conference on Consumer Electronics, 2024

2023
Privacy preserving multi-party multiplication of polynomials based on (k,n) threshold secret sharing.
ICT Express, October, 2023

Communication-Efficient Secure Computation of Encrypted Inputs Using (k, n) Threshold Secret Sharing.
IEEE Access, 2023

TTP-Aided Searchable Encryption of Documents Using Threshold Secret Sharing.
Proceedings of the 9th International Conference on Information Systems Security and Privacy, 2023

2022
TTP-Aided Secure Computation Using (k, n) Threshold Secret Sharing With a Single Computing Server.
IEEE Access, 2022

Simple Approach to Realizing Verifiable Secret Sharing for Secure Cloud System.
IEEE Access, 2022

TTP-Aided Secure Computation using Secret Sharing With Only One Computing Server.
Proceedings of the ASIA CCS '22: ACM Asia Conference on Computer and Communications Security, Nagasaki, Japan, 30 May 2022, 2022

2021
Searchable encryption using secret sharing scheme that realizes direct search of encrypted documents and disjunctive search of multiple keywords.
J. Inf. Secur. Appl., 2021

Improvement of Secure Multi-Party Multiplication of (k, n) Threshold Secret Sharing Using Only N=k Servers (Revised Version).
IACR Cryptol. ePrint Arch., 2021

Secure Computation by Secret Sharing Using Input Encrypted with Random Number (Full Paper).
IACR Cryptol. ePrint Arch., 2021

(Server-Aided) Two-Party Multiplication of Encrypted Shares Using (k, n) Threshold Secret Sharing With N ≥ k Servers.
IEEE Access, 2021

Secure Computation by Secret Sharing using Input Encrypted with Random Number.
Proceedings of the 18th International Conference on Security and Cryptography, 2021

Improvement of Secure Multi-Party Multiplication of (k, n) Threshold Secret Sharing Using Only N = k Servers.
Proceedings of the 7th International Conference on Information Systems Security and Privacy, 2021

2020
Secure Pairwise Key Sharing using Geometric Group Key Sharing Method.
Proceedings of the IEEE 17th Annual Consumer Communications & Networking Conference, 2020

2019
Secure Pairwise Key Sharing using Geometric Group Key Sharing Method (Full Paper).
IACR Cryptol. ePrint Arch., 2019

Fast Secrecy Computation with Multiplication Under the Setting of $k\le N<2k-1$ using Secret Sharing Scheme.
IACR Cryptol. ePrint Arch., 2019

Searchable Encryption Using Secret-Sharing Scheme for Multiple Keyword Search Using Conjunctive and Disjunctive Searching.
Proceedings of the 2019 IEEE Intl Conf on Dependable, 2019

2017
Conditionally Secure Secrecy Computation using Secret Sharing Scheme for n<2k-1 (full paper).
IACR Cryptol. ePrint Arch., 2017

Conditionally Secure Multiparty Computation using Secret Sharing Scheme for n < 2k-1 (Short Paper).
Proceedings of the 15th Annual Conference on Privacy, Security and Trust, 2017

Searchable encryption of image based on secret sharing scheme.
Proceedings of the 2017 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, 2017


  Loading...