Analysis and Comparison of Several Algorithms in SSL/TLS Handshake Protocol

Qing, Luo; Ya-ping, Lin

doi:10.1109/itcs.2009.307

Cited by 4 publications

(3 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…TCP/IP network model separates networking functions into distinct layers and each layer executes a specific function. Transport Layer Security (TLS) or Secure Sockets Layer (SSL) and Secure Shell (SSH) both are very popular used for security protocols performs on transport and application layers respectively [39][40][41][42]. All protocols recommend security to any heterogeneous application through general security services of key replace, authentication, data integrity and confidentiality.…”

Section: Security Overhead Modelmentioning

confidence: 99%

“…Security level 1 represents the weakest security whereas security level 9 represents the strongest security. The lists of the cipher suites are favored order for choice by a TLS (version1.2 implementation) within each security level [39][40][41][42]47]. Without loss of generality, we assume that the worst-case execution time Eij is the completion time of i th task without having its security overhead in place.…”

Section: Security Overhead Modelmentioning

confidence: 99%

See 1 more Smart Citation

A Secure and Robust Trust-Based Task Allocation Model for Batch-of-Tasks (BoT) in Cloud Computing

Alam

Mahak

Shahid

et al. 2022

Preprint

View full text Add to dashboard Buy / Rent full text

Security is emerging as an essential issue in the design of infrastructure-as-a-service (IaaS) cloud environment applications, which are broadly used in micro-system reliability, transaction processing system, e-commerce services, digital computers for government and medical electronics. Here, the security-driven allocation of Batch of Tasks (BoT) in cloud system is a challenging issue and has been reported as a well-known NP-complete problem. So, many models have been developed, however, existing trust-based models do not factor in security demand properly when making the decision and assigning the cloudlets/tasks. To design a trust-based task allocation model, evaluation and computation of security overhead are needed. The proposed model is negotiating the cipher suite between the task and computing resource in the form of security demand. Furthermore, this paper proposes Security Aware Efficient Static Task Allocation (SA-ESTA) and Security Prioritized Efficient Static Task Allocation (SP-ESTA) algorithms which integrate security demands and trust level into allocation for the IaaS Cloud environment. The proposed algorithms schedule a BoT, on virtual machines (VMs) in order to optimize the flowtime, security overhead, and system failure probability. To evaluate the performance of SA-ESTA and SP-ESTA, the experimental study based on random test-bed trace has been conducted and compared with four other existing baselines and three traditional algorithms on account of flowtime, security overhead and failure probability. Our meticulous performance simulation results clearly show that the proposed algorithms perform better than the peer algorithms under various test conditions.

show abstract

Section: Security Overhead Modelmentioning

confidence: 99%

Section: Security Overhead Modelmentioning

confidence: 99%

A Secure and Robust Trust-Based Task Allocation Model for Batch-of-Tasks (BoT) in Cloud Computing

Alam

Mahak

Shahid

et al. 2022

Preprint

View full text Add to dashboard Buy / Rent full text

show abstract

“…Clients need to be granted by the authentication server (Auth Server) in order to subsequently access the application servers (App Server). handshake involves computationally heavy cryptographic procedures (at the server side) that may be difficult to deal with when the number of clients is high [Qing and Yaping 2009;Shacham and Boneh 2001]. Moreover, we observe that other scenarios are affected by the performance of the TLS/SSL authentication: e.g., Shen et al [2012] studied the impact of TLS on SIP server performance and showed that using TLS can reduce the performance by up to a factor of 17 compared to the typical case of SIP-over-UDP.…”

Section: Problem Statementmentioning

confidence: 99%

Lake

Bicakci

Crispo

Oligeri

2013

ACM Trans. Internet Technol.

View full text Add to dashboard Buy / Rent full text

Server-side authenticated key-establishment protocols are characterized by placing a heavy workload on the server. We propose LAKE: a new protocol that enables amortizing servers' workload peaks by moving most of the computational burden to the clients. We provide a formal analysis of the LAKE protocol under the Canetti-Krawczyk model and prove it to be secure. To the best of our knowledge, this is the most computationally efficient authenticated key-establishment ever proposed in the literature. ACM Reference Format:Bicakci, K., Crispo, B., and Oligeri, G. 2013. LAKE: A server-side authenticated key-establishment with low computational workload.

show abstract

Analysis and Comparison of Several Algorithms in SSL/TLS Handshake Protocol

Cited by 4 publications

References 13 publications

A Secure and Robust Trust-Based Task Allocation Model for Batch-of-Tasks (BoT) in Cloud Computing

A Secure and Robust Trust-Based Task Allocation Model for Batch-of-Tasks (BoT) in Cloud Computing

Lake

Contact Info

Product

Resources

About