✦ LIBER ✦

An attack-finding algorithm for security protocols

✍ Scribed by Dongxi Liu; Xiaoyong Li; Yingcai Bai

Publisher: Springer
Year: 2002
Tongue: English
Weight: 940 KB
Volume: 17
Category: Article
ISSN: 1000-9000
DOI: 10.1007/bf02943285

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for finding closed curves

✍ Ming Xie; Monique Thonnat 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 900 KB

An algorithm for finding homogeneous pai

An algorithm for finding homogeneous pairs

✍ Hazel Everett; Sulamita Klein; Bruce Reed 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 631 KB

An algorithm for finding block-triangula

An algorithm for finding block-triangular forms

✍ Erik Dietzenbacher 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 461 KB

An efficient algorithm for finding ideal

An efficient algorithm for finding ideal schedules

✍ Edward G. Coffman; Dariusz Dereniowski; Wiesław Kubiak 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 368 KB

A shared secret-based algorithm for secu

A shared secret-based algorithm for securing the OLSR routing protocol

✍ Alia Fourati; Khaldoun Al Agha 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 319 KB

An active attack on protocols for server

An active attack on protocols for server-aided RSA signature computation

✍ Gwoboa Horng 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 248 KB

The main purpose of server-aided RSA signature computation protocols is to make use of an auxiliary processor to speed up the RSA signature computations to be performed by a device with limited processing power. However, all server-aided secret computation protocols are vulnerable to active attacks.