Towards durable multistakeholder-generated solutions: The pilot application of a problem-oriented policy learning protocol to legality verification and community rights in Peru

This paper reports and reflects on the pilot application of an 11-step policy learning protocol that was developed by Cashore and Lupberger (2015) based on several years of Cashore’s multi-author collaborations. The protocol was applied for the first time in Peru in 2015 and 2016 by the IUFRO Working Party on Forest Policy Learning Architectures (hereinafter referred to as the project team). The protocol integrates insights from policy learning scholarship (Hall 1993, Sabatier 1999) with Bernstein and Cashore’s (2000, 2012) four pathways of influence framework. The pilot implementation in Peru focused on how global timber legality verification interventions might be harnessed to promote local land rights. Legality verification focuses attention on the checking and auditing of forest management units in order to verify that timber is harvested and traded in compliance with the law. We specifically asked: How can community legal ownership of, and access to, forestland and forest resources be enhanced? The protocol was designed as a dynamic tool, the implementation of which fosters iterative rather than linear processes. It directly integrated two objectives: 1) identifying the causal processes through which global governance initiatives might be harnessed to produce durable results ‘on the ground’; 2) generating insights and strategies in collaboration with relevant stakeholders. This paper reviews and critically evaluates our work in designing and piloting the protocol. We assess what seemed to work well and suggest modifications, including an original diagnostic framework for nurturing durable change. We also assess the implications of the pilot application of the protocol for policy implementation that works to enhance the influence of existing international policy instruments, rather than contributing to fragmentation and incoherence by creating new ones

An Authentication Protocol for Future Sensor Networks

Authentication is one of the essential security services in Wireless Sensor Networks (WSNs) for ensuring secure data sessions. Sensor node authentication ensures the confidentiality and validity of data collected by the sensor node, whereas user authentication guarantees that only legitimate users can access the sensor data. In a mobile WSN, sensor and user nodes move across the network and exchange data with multiple nodes, thus experiencing the authentication process multiple times. The integration of WSNs with Internet of Things (IoT) brings forth a new kind of WSN architecture along with stricter security requirements; for instance, a sensor node or a user node may need to establish multiple concurrent secure data sessions. With concurrent data sessions, the frequency of the re-authentication process increases in proportion to the number of concurrent connections, which makes the security issue even more challenging. The currently available authentication protocols were designed for the autonomous WSN and do not account for the above requirements. In this paper, we present a novel, lightweight and efficient key exchange and authentication protocol suite called the Secure Mobile Sensor Network (SMSN) Authentication Protocol. In the SMSN a mobile node goes through an initial authentication procedure and receives a re-authentication ticket from the base station. Later a mobile node can use this re-authentication ticket when establishing multiple data exchange sessions and/or when moving across the network. This scheme reduces the communication and computational complexity of the authentication process. We proved the strength of our protocol with rigorous security analysis and simulated the SMSN and previously proposed schemes in an automated protocol verifier tool. Finally, we compared the computational complexity and communication cost against well-known authentication protocols.Comment: This article is accepted for the publication in "Sensors" journal. 29 pages, 15 figure

Modelling and simulation of a biometric identity-based cryptography

Government information is a vital asset that must be kept in a trusted environment and efficiently managed by authorised parties. Even though e-Government provides a number of advantages, it also introduces a range of new security risks. Sharing confidential and top-secret information in a secure manner among government sectors tend to be the main element that government agencies look for. Thus, developing an effective methodology is essential and it is a key factor for e-Government success. The proposed e-Government scheme in this paper is a combination of identity-based encryption and biometric technology. This new scheme can effectively improve the security in authentication systems, which provides a reliable identity with a high degree of assurance. In addition, this paper demonstrates the feasibility of using Finite-state machines as a formal method to analyse the proposed protocols

A Peered Bulletin Board for Robust Use in Verifiable Voting Systems

The Web Bulletin Board (WBB) is a key component of verifiable election systems. It is used in the context of election verification to publish evidence of voting and tallying that voters and officials can check, and where challenges can be launched in the event of malfeasance. In practice, the election authority has responsibility for implementing the web bulletin board correctly and reliably, and will wish to ensure that it behaves correctly even in the presence of failures and attacks. To ensure robustness, an implementation will typically use a number of peers to be able to provide a correct service even when some peers go down or behave dishonestly. In this paper we propose a new protocol to implement such a Web Bulletin Board, motivated by the needs of the vVote verifiable voting system. Using a distributed algorithm increases the complexity of the protocol and requires careful reasoning in order to establish correctness. Here we use the Event-B modelling and refinement approach to establish correctness of the peered design against an idealised specification of the bulletin board behaviour. In particular we show that for n peers, a threshold of t > 2n/3 peers behaving correctly is sufficient to ensure correct behaviour of the bulletin board distributed design. The algorithm also behaves correctly even if honest or dishonest peers temporarily drop out of the protocol and then return. The verification approach also establishes that the protocols used within the bulletin board do not interfere with each other. This is the first time a peered web bulletin board suite of protocols has been formally verified.Comment: 49 page