Knowing a donor and identifying as one : determinants of people's willingness for related and anonymous living donation in Australia

While LRD (living donation to a genetically/emotionally related recipient) is well established in Australia, LAD (living anonymous donation to a stranger) is rare. Given the increasing use of LAD overseas, Australia may likely follow suit. Understanding the determinants of people’s willingness for LAD is essential but infrequently studied in Australia. Consequently, we compared the determinants of people’s LRD and LAD willingness, and assessed whether these determinants differed according to type of living donation. We surveyed 487 health students about their LRD and LAD willingness, attitudes, identity, prior experience with blood and organ donation, deceased donation preference, and demographics. We used Structural Equation Modelling (SEM) to identify the determinants of willingness for LRD and LAD and paired sample t-tests to examine differences in LRD and LAD attitudes, identity, and willingness. Mean differences in willingness (LRD 5.93, LAD 3.92), attitudes (LRD 6.43, LAD 5.53), and identity (LRD 5.69, LAD 3.58) were statistically significant. Revised SEM models provided a good fit to the data (LRD: x2 (41) = 67.67, p = 0.005, CFI = 0.96, RMSEA = 0.04; LAD: x2 (40) = 79.64, p < 0.001, CFI = 0.95, RMSEA = 0.05) and explained 45% and 54% of the variation in LRD and LAD willingness, respectively. Four common determinants of LRD and LAD willingness emerged: identity, attitude, past blood donation, and knowing a deceased donor. Religious affiliation and deceased donation preference predicted LAD willingness also. Identifying similarities and differences in these determinants can inform future efforts aimed at understanding people’s LRD and LAD willingness and the evaluation of potential living donor motives. Notably, this study highlights the importance of people’s identification as a living donor as a motive underlying their willingness to donate their organs while living.

A combinatorial approach to anonymous membership broadcast

A set system (X, F ) with X= {x 1,...,x m}) and F = {B1...,B n }, where B i ⊆ X, is called an (n, m) cover-free set system (or CF set system) if for any 1 ≤ i, j, k ≤ n and j ≠ k, |B i >2 |B j ∩ B k | +1. In this paper, we show that CF set systems can be used to construct anonymous membership broadcast schemes (or AMB schemes), allowing a center to broadcast a secret identity among a set of users in a such way that the users can verify whether or not the broadcast message contains their valid identity. Our goal is to construct (n, m) CF set systems in which for given m the value n is as large as possible. We give two constructions for CF set systems, the first one from error-correcting codes and the other from combinatorial designs. We link CF set systems to the concept of cover-free family studied by Erdös et al in early 80’s to derive bounds on parameters of CF set systems. We also discuss some possible extensions of the current work, motivated by different application.

New constructions of anonymous membership broadcasting schemes

An anonymous membership broadcast scheme is a method in which a sender broadcasts the secret identity of one out of a set of n receivers, in such a way that only the right receiver knows that he is the intended receiver, while the others can not determine any information about this identity (except that they know that they are not the intended ones). In a w-anonymous membership broadcast scheme no coalition of up to w receivers, not containing the selected receiver, is able to determine any information about the identity of the selected receiver. We present two new constructions of w-anonymous membership broadcast schemes. The first construction is based on error-correcting codes and we show that there exist schemes that allow a flexible choice of w while keeping the complexities for broadcast communication, user storage and required randomness polynomial in log n,. The second construction is based on the concept of collision-free arrays, which is introduced in this paper. The construction results in more flexible schemes, allowing trade-offs between different complexities.

Authentically ambiguous, credibly anonymous: Perceptually reframing the personal narrative towards effective persuasion in aggressive human rights contexts

Testing the strategies of discourse and materiality, this practice-based and practice-led research experiments with how anonymous storytelling by vulnerable communities, like that of the sexual minorities and their allies in Malaysia, can better speak to their human rights issues without further subjecting them to personal attacks and targetted persecution. The research identifies the critical role of the voice in lending authenticity and credibility to first person narratives; and contextual credibility as a form of credibility which personal stories naturally aspire to achieve with audiences. Adopting a discursive view of persuasion and recognising too that the power of persuasion may in effect lie with those who receive these stories rather than with those who tell them, the insights and knowledge gained from the research informed the development of the field output, Persuasive Storytelling by Vulnerable Communities in Aggressive Contexts: A Human Rights Communication Framework.

Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks

We present a distributed algorithm that finds a maximal edge packing in O(Δ + log* W) synchronous communication rounds in a weighted graph, independent of the number of nodes in the network; here Δ is the maximum degree of the graph and W is the maximum weight. As a direct application, we have a distributed 2-approximation algorithm for minimum-weight vertex cover, with the same running time. We also show how to find an f-approximation of minimum-weight set cover in O(f2k2 + fk log* W) rounds; here k is the maximum size of a subset in the set cover instance, f is the maximum frequency of an element, and W is the maximum weight of a subset. The algorithms are deterministic, and they can be applied in anonymous networks.

Anonymous Authentication with Shared Secrets

Anonymity and authenticity are both important yet often conflicting security goals in a wide range of applications. On the one hand for many applications (say for access control) it is crucial to be able to verify the identity of a given legitimate party (a.k.a. entity authentication). Alternatively an application might require that no one but a party can communicate on its behalf (a.k.a. message authentication). Yet, on the other hand privacy concerns also dictate that anonymity of a legitimate party should be preserved; that is no information concerning the identity of parties should be leaked to an outside entity eavesdropping on the communication. This conflict becomes even more acute when considering anonymity with respect to an active entity that may attempt to impersonate other parties in the system. In this work we resolve this conflict in two steps. First we formalize what it means for a system to provide both authenticity and anonymity even in the presence of an active man-in-the-middle adversary for various specific applications such as message and entity authentication using the constructive cryptography framework of Mau11, MR11]. Our approach inherits the composability statement of constructive cryptography and can therefore be directly used in any higher-level context. Next we demonstrate several simple protocols for realizing these systems, at times relying on a new type of (probabilistic) Message Authentication Code (MAC) called key indistinguishable (KI) MACs. Similar to the key hiding encryption schemes of BBDP01] they guarantee that tags leak no discernible information about the keys used to generate them.

Divididos por zero : um estudo sobre o caráter difuso do anonymous

Analisa elementos que caracterizam os grupos de manifestação política dispersos pelas redes e mídias digitais, a partir do caso do Anonymous, grupo cuja atuação política foge aos padrões convencionais de participação, contestação e ativismo. Sugere-se para a entidade o conceito de “grupos difusos”, visto que não há liderança unificada e nem centralização de suas ações. Além disso, o grupo não possui uma política claramente definida e nem atores identificados. Conclui-se que, ao favorecer a interação e permitir o espraiamento de mútuos padrões comportamentais, o grupo aparenta alcançar ainda mais cooperação do que os modelos tradicionais de manifestação política.

Eles são legião : o Anonymous e um novo modelo de ativismo político no Brasil

Estuda o novo modelo de ativismo político levado a efeito por meio das mídias sociais e tem como objeto de análise o fenômeno dos hackers intitulados Anonymous, especialmente no que diz respeito às atividades do grupo no Brasil.

a forward secure direct anonymous attestation scheme

WSEAS, Tech Univ Sofia, Univ Politehn Bucharest, Univ Genova, Univ IASI, Fac Elect Engn, Zhejiang Univ Technol, Norwegian Univ Sci & Technol, Politehn Univ Bucharest, Engn & Management Technol Syst Fac, Execut Agcy Higher Educ & Res Fund, Ctr Invest Sobfre, Univ Algarve, UAlg, Cybercom Grp

Non-anonymous ballot aggregation: an axiomatic generalization of Approval Voting

We study axiomatically situations in which the society agrees to treat voters with different characteristics distinctly. In this setting, we propose a set of intuitive axioms and show that they jointly characterize a new class of voting procedures, called Type-weighted Approval Voting. According to this family, each voter has a strictly positive and finite weight (the weight is necessarily the same for all voters with the same characteristics) and the alternative with the highest number of weighted votes is elected. The implemented voting procedure reduces to Approval Voting in case all voters are identical or the procedure assigns the same weight to all types. Using this idea, we also obtain a new characterization of Approval Voting.