From Truth to Justice: How Does Amnesty Factor In? A Comparative Analysis of South Africa and Sierra Leone's Truth and Reconciliation Commissions

Truth and Reconciliation Commissions (TRC) have emerged in the last few decades as a mechanism for a state to overcome widespread, grave, human rights violations. There are numerous approaches to a TRC all with an ultimate goal: that formerly warring factions, perpetrators, witnesses, and victims can move forward as a united people. I propose that the provision of amnesty is critical to the success of a TRC. I hypothesize that the form of amnesty chosen (i.e. blanket v. conditional amnesty) determines the revelation of truth and realization of justice, which in turn dictates whether a TRC can achieve reconciliation. To test this hypothesis, I use two case studies: South Africa, which has utilized conditional amnesty, and Sierra Leone which has employed blanket amnesty. I create a model for measuring reconciliation. I can then look at the implications of both types of amnesty and assess which, in the end, is more effective. My overarching conclusion is that the provision of conditional amnesty is more effective than blanket amnesty in achieving reconciliation. Ultimately, I hope that this conclusion can be generalized to other TRCs.

Costs and quality of medication reconciliation practice in primary care clinics

Medication reconciliation, with the aim to resolve medication discrepancy, is one of the Joint Commission patient safety goals. Medication errors and adverse drug events that could result from medication discrepancy affect a large population. At least 1.5 million adverse drug events and $3.5 billion of financial burden yearly associated with medication errors could be prevented by interventions such as medication reconciliation. This research was conducted to answer the following research questions: (1a) What are the frequency range and type of measures used to report outpatient medication discrepancy? (1b) Which effective and efficient strategies for medication reconciliation in the outpatient setting have been reported? (2) What are the costs associated with medication reconciliation practice in primary care clinics? (3) What is the quality of medication reconciliation practice in primary care clinics? (4) Is medication reconciliation practice in primary care clinics cost-effective from the clinic perspective? Study designs used to answer these questions included a systematic review, cost analysis, quality assessments, and cost-effectiveness analysis. Data sources were published articles in the medical literature and data from a prospective workflow study, which included 150 patients and 1,238 medications. The systematic review confirmed that the prevalence of medication discrepancy was high in ambulatory care and higher in primary care settings. Effective strategies for medication reconciliation included the use of pharmacists, letters, a standardized practice approach, and partnership between providers and patients. Our cost analysis showed that costs associated with medication reconciliation practice were not substantially different between primary care clinics using or not using electronic medical records (EMR) ($0.95 per patient per medication in EMR clinics vs. $0.96 per patient per medication in non-EMR clinics, p=0.78). Even though medication reconciliation was frequently practiced (97-98%), the quality of such practice was poor (0-33% of process completeness measured by concordance of medication numbers and 29-33% of accuracy measured by concordance of medication names) and negatively (though not significantly) associated with medication regimen complexity. The incremental cost-effectiveness ratios for concordance of medication number per patient per medication and concordance of medication names per patient per medication were both 0.08, favoring EMR. Future studies including potential cost-savings from medication features of the EMR and potential benefits to minimize severity of harm to patients from medication discrepancy are warranted. ^

Kenya after the 2007 "post-election violence" : constitutional reform and the National Accord and Reconciliation Act

Immediately after the announcement of the re-election of President Kibaki on the evening of 30 December 2007, Kenya was thrust into the worst civil unrest experienced by the country since independence – a development that became known as the "Post-Election Violence" (PEV). However, after a subsequent process of reconciliation, the PEV came to an end within a relatively short period. The present-day politics of Kenya are being conducted within the framework of a provisional Constitution that took shape through peaceful mediation. How did Kenya manage to put a lid on a period of turmoil that placed the country in unprecedented danger? This paper traces the sequence of events that led to mediation, explains the emergency measures that were needed to maintain law and order, and indicates the remaining problems that still need to be solved.

Key reconciliation for high performance Quantum Key Distribution

Quantum Key Distribution is carving its place among the tools used to secure communications. While a difficult technology, it enjoys benefits that set it apart from the rest, the most prominent is its provable security based on the laws of physics. QKD requires not only the mastering of signals at the quantum level, but also a classical processing to extract a secret-key from them. This postprocessing has been customarily studied in terms of the efficiency, a figure of merit that offers a biased view of the performance of real devices. Here we argue that it is the throughput the significant magnitude in practical QKD, specially in the case of high speed devices, where the differences are more marked, and give some examples contrasting the usual postprocessing schemes with new ones from modern coding theory. A good understanding of its implications is very important for the design of modern QKD devices.

Analysis of a rate-adaptive reconciliation protocol and the effect of leakage on the secret key rate

Quantum key distribution performs the trick of growing a secret key in two distant places connected by a quantum channel. The main reason is so that the legitimate users can bound the information gathered by the eavesdropper. In practical systems, whether because of finite resources or external conditions, the quantum channel is subject to fluctuations. A rate-adaptive information reconciliation protocol, which adapts to the changes in the communication channel, is then required to minimize the leakage of information in the classical postprocessing. We consider here the leakage of a rate-adaptive information reconciliation protocol. The length of the exchanged messages is larger than that of an optimal protocol; however, we prove that the min-entropy reduction is limited. The simulation results, both in the asymptotic and in the finite-length regime, show that this protocol allows to increase the amount of a distillable secret key.

Demystifying the information reconciliation protocol cascade

Cascade is an information reconciliation protocol proposed in the context of secret key agreement in quantum cryptography. This protocol allows removing discrepancies in two partially correlated sequences that belong to distant parties, connected through a public noiseless channel. It is highly interactive, thus requiring a large number of channel communications between the parties to proceed and, although its efficiency is not optimal, it has become the de-facto standard for practical implementations of information reconciliation in quantum key distribution. The aim of this work is to analyze the performance of Cascade, to discuss its strengths, weaknesses and optimization possibilities, comparing with some of the modified versions that have been proposed in the literature. When looking at all design trade-offs, a new view emerges that allows to put forward a number of guidelines and propose near optimal parameters for the practical implementation of Cascade improving performance significantly in comparison with all previous proposals.

Information reconciliation for Quantum Key Distribution

Secret-key agreement, a well-known problem in cryptography, allows two parties holding correlated sequences to agree on a secret key communicating over a public channel. It is usually divided into three different procedures: advantage distillation, information reconciliation and privacy amplification. The efficiency of each one of these procedures is needed if a positive key rate is to be attained from the legitimate parties? correlated sequences. Quantum key distribution (QKD) allows the two parties to obtain correlated sequences, provided that they have access to an authenticated channel. The new generation of QKD devices is able to work at higher speeds and in noisier or more absorbing environments. This exposes the weaknesses of current information reconciliation protocols, a key component to their performance. Here we present a new protocol based in low-density parity-check (LDPC) codes that presents the advantages of low interactivity, rate adaptability and high efficiency,characteristics that make it highly suitable for next generation QKD devices.

Fundamental finite key limits for information reconciliation in quantum key distribution

The security of quantum key distribution protocols is guaranteed by the laws of quantum mechanics. However, a precise analysis of the security properties requires tools from both classical cryptography and information theory. Here, we employ recent results in non-asymptotic classical information theory to show that information reconciliation imposes fundamental limitations on the amount of secret key that can be extracted in the finite key regime. In particular, we find that an often used approximation for the information leakage during one-way information reconciliation is flawed and we propose an improved estimate.

Information reconciliation methods in secret key distribution

We consider in this thesis the problem of information reconciliation in the context of secret key distillation between two legitimate parties. In some scenarios of interest this problem can be advantageously solved with low density parity check (LDPC) codes optimized for the binary symmetric channel. In particular, we demonstrate that our method leads to a significant efficiency improvement, with respect to earlier interactive reconciliation methods. We propose a protocol based on LDPC codes that can be adapted to changes in the communication channel extending the original source. The efficiency of our protocol is only limited by the quality of the code and, while transmitting more information than needed to reconcile Alice’s and Bob’s sequences, it does not reveal any more information on the original source than an ad-hoc code would have revealed.---ABSTRACT---En esta tesis estudiamos el problema de la reconciliación de información en el contexto de la destilación de secreto entre dos partes. En algunos escenarios de interés, códigos de baja densidad de ecuaciones de paridad (LDPC) adaptados al canal binario simétrico ofrecen una buena solución al problema estudiado. Demostramos que nuestro método mejora significativamente la eficiencia de la reconciliación. Proponemos un protocolo basado en códigos LDPC que puede ser adaptado a cambios en el canal de comunicaciones mediante una extensión de la fuente original. La eficiencia de nuestro protocolo está limitada exclusivamente por el código utilizado y no revela información adicional sobre la fuente original que la que un código con la tasa de información adaptada habría revelado.

An information reconciliation protocol for secret-key agreement with small leakage

We report on a variant of the so-called Cascade protocol that is well-known for its usage as information reconciliation protocol in quantum cryptography. A theoretical analysis of the optimal size of the parity check blocks is provided. We obtain a very small leakage which is for block sizes of 2^16 typically only 2.5% above the Shannon limit, and notably, this holds for a QBER between 1% and 50%. For a QBER between 1% and 6% the leakage is only 2% above the Shannon limit. As comparison, the leakage of the original Cascade algorithm is 20% (40%) above the Shannon limit for a QBER of 10% (35%).

Rate-Adaptive LDPC-based key reconciliation for high performance quantum key distribution

The postprocessing or secret-key distillation process in quantum key distribution (QKD) mainly involves two well-known procedures: information reconciliation and privacy amplification. Information or key reconciliation has been customarily studied in terms of efficiency. During this, some information needs to be disclosed for reconciling discrepancies in the exchanged keys. The leakage of information is lower bounded by a theoretical limit, and is usually parameterized by the reconciliation efficiency (or inefficiency), i.e. the ratio of additional information disclosed over the Shannon limit. Most techniques for reconciling errors in QKD try to optimize this parameter. For instance, the well-known Cascade (probably the most widely used procedure for reconciling errors in QKD) was recently shown to have an average efficiency of 1.05 at the cost of a high interactivity (number of exchanged messages). Modern coding techniques, such as rate-adaptive low-density parity-check (LDPC) codes were also shown to achieve similar efficiency values exchanging only one message, or even better values with few interactivity and shorter block-length codes.

Efficient information reconciliation for Continuous-Variable QKD using Non-Binary Low-Density Parity-Check Codes

We present here an information reconciliation method and demonstrate for the first time that it can achieve efficiencies close to 0.98. This method is based on the belief propagation decoding of non-binary LDPC codes over finite (Galois) fields. In particular, for convenience and faster decoding we only consider power-of-two Galois fields.

Minisatellite marker analysis of Trypanosoma brucei: Reconciliation of clonal, panmictic, and epidemic population genetic structures

The African trypanosome, Trypanosoma brucei, has been shown to undergo genetic exchange in the laboratory, but controversy exists as to the role of genetic exchange in natural populations. Much of the analysis to date has been derived from isoenzyme or randomly amplified polymorphic DNA data with parasite material from a range of hosts and geographical locations. These markers fail to distinguish between the human infective (T. b. rhodesiense) and nonhuman infective (T. b. brucei) “subspecies” so that parasites derived from hosts other than humans potentially contain both subspecies. To overcome some of the inherent problems with the use of such markers and diverse populations, we have analyzed a well-defined population from a discrete geographical location (Busoga, Uganda) using three recently described minisatellite markers. The parasites were primarily isolated from humans and cattle with the latter isolates further characterized by their ability to resist lysis by human serum (equivalent to human infectivity). The minisatellite markers show high levels of polymorphism, and from the data obtained we conclude that T. b. rhodesiense is genetically isolated from T. b. brucei and can be unambiguously identified by its multilocus genotype. Analysis of the genotype frequencies in the separated T. b. brucei and T. b. rhodesiense populations shows the former has an epidemic population structure whereas the latter is clonal. This finding suggests that the strong linkage disequilibrium observed in previous analyses, where human and nonhuman infective trypanosomes were not distinguished, results from the treatment of two genetically isolated populations as a single population.

50 years of the ‘twin engine’. Franco-German reconciliation, European integration and reflections for Asia. EU Centre Singapore Background Brief No. 8, March 2013

On 22 January 2013, French President François Hollande and German Chancellor Angela Merkel gathered in Berlin to celebrate the 50th anniversary of the signing of the Élysée Treaty, the document that ended centuries of rivalry and warfare between their two countries. It is all too easy to forget the importance of Franco-German reconciliation. The 1950 Schuman Declaration, which led to the creation of the European Union’s (EU) predecessor, the European Coal and Steel Community (ECSC), sought to render the prospect of war between France and Germany ‘not only unthinkable but materially impossible’. Over 60 years later, when the EU was awarded the Nobel Peace Prize, the Norwegian Nobel Committee noted that indeed, ‘war between Germany and France is unthinkable’. Halfway around the world in Asia, the other theatre of World War II, tensions between China and Japan have arisen, with Taiwan and South Korea also in the fray. Nationalist movements in these countries have grown. This background brief lays out the issues for a timely reappraisal of the applicability, or otherwise, of the European integration and reconciliation processes to East Asia. The brief seeks to outline the contours of the historic act of Franco-German reconciliation, and its consequences ever since. Starting from a brief look at the history of rivalry and war between the two countries, the brief examines the events leading to the signing of the Élysée Treaty in 1963, and the development of Franco-German exchanges that have cemented the relationship. Difficulties between the countries are also raised. A timescale analysis of the opinion of the two publics is considered, as a measure of the success of Franco-German reconciliation.