Sciweavers

96 search results - page 10 / 20
» A novel three-party encrypted key exchange protocol
Sort
View
CADE
2004
Springer
14 years 7 months ago
Attacking a Protocol for Group Key Agreement by Refuting Incorrect Inductive Conjectures
Abstract. Automated tools for finding attacks on flawed security protocols often struggle to deal with protocols for group key agreement. Systems designed for fixed 2 or 3 party pr...
Graham Steel, Alan Bundy, Monika Maidl
DRM
2003
Springer
14 years 23 days ago
Breaking and repairing optimistic fair exchange from PODC 2003
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
Yevgeniy Dodis, Leonid Reyzin
ICCSA
2005
Springer
14 years 1 months ago
A Formal Analysis of Fairness and Non-repudiation in the RSA-CEGD Protocol
Recently, Nenadi´c et al. (2004) proposed the RSA-CEGD protocol for certified delivery of e-goods. This is a relatively complex scheme based on verifiable and recoverable encryp...
Almudena Alcaide, Juan M. Estévez-Tapiador,...
ICC
2009
IEEE
132views Communications» more  ICC 2009»
14 years 2 months ago
A Chaotic Maps-Based Key Agreement Protocol that Preserves User Anonymity
—A key agreement protocol is a protocol whereby two or more communicating parties can agree on a key or exchange information over an open communication network in such a way that...
Huei-Ru Tseng, Rong-Hong Jan, Wuu Yang
PEWASUN
2004
ACM
14 years 29 days ago
A novel solution for achieving anonymity in wireless ad hoc networks
A mobile ad hoc network consists of mobile nodes that can move freely in an open environment. Communicating nodes in a wireless and mobile ad hoc network usually seek the help of ...
Azzedine Boukerche, Khalil El-Khatib, Li Xu, Larry...