UCL  IRIS
Institutional Research Information Service
UCL Logo
Please report any queries concerning the funding data grouped in the sections named "Externally Awarded" or "Internally Disbursed" (shown on the profile page) to your Research Finance Administrator. Your can find your Research Finance Administrator at http://www.ucl.ac.uk/finance/research/post_award/post_award_contacts.php by entering your department
Please report any queries concerning the student data shown on the profile page to:

Email: portico-services@ucl.ac.uk

Help Desk: http://www.ucl.ac.uk/ras/portico/helpdesk
Publication Detail
Bounded memory Dolev-Yao adversaries in collaborative systems
Abstract
In a collaborative system, the agents collaborate to achieve a common goal, but they are not willing to share some sensitive private information. The question is how much damage can be done by a malicious participant sitting inside the system. We assume that all the participants (including internal adversaries) have bounded memory - at any moment, they can store only a fixed number of messages of a fixed size. The Dolev-Yao adversaries can compose, decompose, eavesdrop, and intercept messages, and create fresh values (nonces), but within their bounded memory. We prove that the secrecy problem is PSPACE-complete in the bounded memory model where all actions are balanced and a potentially infinite number of the nonce updates is allowed. We also show that the well-known security protocol anomalies (starting from the Lowe attack to the Needham-Schroeder protocol) can be rephrased within the bounded memory paradigm with the explicit memory bounds. © 2014 Elsevier Inc. All rights reserved.
Publication data is maintained in RPS. Visit https://rps.ucl.ac.uk
 More search options
UCL Researchers
Author
Dept of Computer Science
University College London - Gower Street - London - WC1E 6BT Tel:+44 (0)20 7679 2000

© UCL 1999–2011

Search by