Simple and Efficient Group Key Agreement Based on Factoring

Nam, Junghyun; Cho, Seokhyang; Kim, Seungjoo; Won, Dongho

doi:10.1007/978-3-540-24707-4_76

Cited by 10 publications

(19 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed work continues the line of research on the two-server paradigm in (Wen et al, 2005;Nam et al, 2004), extend the model by imposing different levels of trust upon the two servers and adopt a very different method at the technical level in the protocol design. As a result, we propose a practical two-server password authentication and key exchange system that is secure against offline dictionary attacks by servers when they are controlled by adversaries.…”

Section: Introductionmentioning

confidence: 92%

“…In classical cryptography, three-party key distribution protocols (Wen et al, 2005;Nam et al, 2004) utilize challenge response mechanisms (Stallings, 1998) or timestamps (Shirey, 2000) to prevent replay attacks (Bennett and Brassard, 1984), However, challenge response mechanisms require at least two communication rounds (Gottesman and Lo, 2003) between the TC and participants and the timestamp approach needs the assumption of clock synchronization which is not practical in distributed systems (due to the unpredictable nature of network delays and potential hostile attacks) (Bennett, 1992). Furthermore, classical cryptography cannot detect the existence of passive attacks (Hwang et al, 2007) such as eavesdropping.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Integrated Quantum and Classical Key Scheme for Two Servers Password Authentication

Thangavel¹,

Krishnan²

2010

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement: Traditional user authentication system uses passwords for their secured accessibility in a central server, which is prone to attack by adversaries. The adversaries gain access to the contents of the user in attack prone servers. To overcome this problem, the multi-server systems were being proposed in which the user communicate in parallel with several or all of the servers for the purpose of authentication. Such system requires a large communication bandwidth and needs for synchronization at the user. Approach: Present an efficient two server user password authentication and reduce the usage of communication traffic and bandwidth consumption between the servers. Integration of quantum and classical key exchange model is deployed to safeguard user access security in large networks. The proposed work presented, a two server system, front end service server interacts directly to the user and the back end control server visible to the service server. The performance measure of the user password made for the transformed two long secrets held by both service and control server. Further the proposal applied quantum key distribution model along with classical key exchange in the two server authentication. Three-party Quantum key distribution used in this model, one with implicit user authentication and other with explicit mutual authentication, deployed for ecommerce buyer authentication in internet peer servers. Results: Effect of online and offline dictionary attacks prevailing in the single and multi-server systems are analyzed. The performance efficiency test carried out in terms success rate of authenticity for two server shows 35% better than single server. The performance of integrated Quantum Key Distribution (QKD) systems and classical public key model have shown experimentally better performance in terms of computational efficiency and security rounds (11% improvement) than traditional cryptic security model. Conclusion: With the results obtained it is concluded that intricate security principle of quantum theory and traditional public key model integration provides an improved security model for password authentication between the password exchanges of two servers.

show abstract

Section: Introductionmentioning

confidence: 92%

Section: Introductionmentioning

confidence: 99%

Integrated Quantum and Classical Key Scheme for Two Servers Password Authentication

Thangavel¹,

Krishnan²

2010

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…if timeout period of sender node is x then timeout period of receiver node will be (x-m), where m will be critical factor. This factor [16] helps us to control the max no of hops a message can traverse to reach destination. Now the scheme is as follows-A node can do either of three activities -message generate, message forward, message receive.…”

Section: Description Of the Schemementioning

confidence: 99%

A novel and Efficient Secured Routing Algorithm in Mobile Ad hoc Network

Saha¹,

Bhattacharyya²,

Banerjee³

2011

IJWMN

View full text Add to dashboard Cite

“…if timeout period of sender node is x then timeout period of receiver node will be x/m, where m will be critical factor. This factor [23] signifies maximum no of failure a node can endure without causing congestion in the network.…”

Section: Description Of the Schemementioning

confidence: 99%

Fidelity Based On Demand Secure(FBOD) Routing in Mobile Adhoc Network

Saha¹,

Bhattacharyya²,

Banerjee³

2011

SpecialIssue

View full text Add to dashboard Cite

Abstract-:In mobile ad-hoc network (MANET), secure routing is a challenging issue due to its open nature, infrastructure less property and mobility of nodes. Many mobile ad-hoc network routing schemes have been proposed, but none of them have been designed with security as a goal. We propose security goals for routing in mobile ad-hoc networks, an approach significantly different from the existing ones where data packets are routed, based on a specific criterion of the nodes called "fidelity" The approach will reduce the computational overhead to a lot extent. Our simulation results show how we have reduced the amount of network activity for each node required to route a data packet and how this scheme prevents various attacks which may jeopardize any MANET.Keywords-fidelity; sequence number; hop destination; flooding attack; black hole attack; co-operative black hole attac,routing.

show abstract

Simple and Efficient Group Key Agreement Based on Factoring

Cited by 10 publications

References 17 publications

Integrated Quantum and Classical Key Scheme for Two Servers Password Authentication

Integrated Quantum and Classical Key Scheme for Two Servers Password Authentication

A novel and Efficient Secured Routing Algorithm in Mobile Ad hoc Network

Fidelity Based On Demand Secure(FBOD) Routing in Mobile Adhoc Network

Contact Info

Product

Resources

About