Foundations of Fully Dynamic Group Signatures

Group signatures are a central cryptographic primitive that has received a considerable amount of attention from the cryptographic community. They allow members of a group to anonymously sign on behalf of the group. Membership is overseen by a designated group manager. There is also a tracing authority that can revoke anonymity by revealing the identity of the signer if and when needed, to enforce accountability and deter abuse. For the primitive to be applicable in practice, it needs to support fully dynamic groups, i.e. users can join and leave at any time. In this work we take a close look at existing security definitions for fully dynamic group signatures. We identify a number of shortcomings in existing security definitions and fill the gap by providing a formal rigorous security model for the primitive. Our model is general and is not tailored towards a specific design paradigm and can therefore, as we show, be used to argue about the security of different existing constructions following different design paradigms. Our definitions are stringent and when possible incorporate protection against maliciously chosen keys. In the process, we identify a subtle issue inherent to one design paradigm, where new members might try to implicate older ones by means of back-dated signatures. This is not captured by existing models. We propose some inexpensive fixes for some existing constructions to avoid the issue

Poly(ADP-ribose) polymerase family member 14 (PARP14) is a novel effector of the JNK2-dependent pro-survival signal in multiple myeloma

Copyright @ 2013 Macmillan Publishers Limited. This is the author's accepted manuscript. The final published article is available from the link below.Regulation of cell survival is a key part of the pathogenesis of multiple myeloma (MM). Jun N-terminal kinase (JNK) signaling has been implicated in MM pathogenesis, but its function is unclear. To elucidate the role of JNK in MM, we evaluated the specific functions of the two major JNK proteins, JNK1 and JNK2. We show here that JNK2 is constitutively activated in a panel of MM cell lines and primary tumors. Using loss-of-function studies, we demonstrate that JNK2 is required for the survival of myeloma cells and constitutively suppresses JNK1-mediated apoptosis by affecting expression of poly(ADP-ribose) polymerase (PARP)14, a key regulator of B-cell survival. Strikingly, we found that PARP14 is highly expressed in myeloma plasma cells and associated with disease progression and poor survival. Overexpression of PARP14 completely rescued myeloma cells from apoptosis induced by JNK2 knockdown, indicating that PARP14 is critically involved in JNK2-dependent survival. Mechanistically, PARP14 was found to promote the survival of myeloma cells by binding and inhibiting JNK1. Moreover, inhibition of PARP14 enhances the sensitization of MM cells to anti-myeloma agents. Our findings reveal a novel regulatory pathway in myeloma cells through which JNK2 signals cell survival via PARP14, and identify PARP14 as a potential therapeutic target in myeloma.Kay Kendall Leukemia Fund, NIH, Cancer Research UK, Italian Association for Cancer Research and the Foundation for Liver Research

Blockchain Participation Games

We study game-theoretic models for capturing participation in blockchain systems. Permissionless blockchains can be naturally viewed as games, where a set of potentially interested users is faced with the dilemma of whether to engage with the protocol or not. Engagement here implies that the user will be asked to complete certain tasks, whenever they are selected to contribute (typically according to some stochastic process) and be rewarded if they choose to do so. Apart from the basic dilemma of engaging or not, even more strategic considerations arise in settings where users may be able to declare participation and then retract before completing their tasks (but are still able to receive rewards) or are rewarded independently of whether they contribute. Such variations occur naturally in the blockchain setting due to the complexity of tracking ``on-chain'' the behavior of the participants. We capture these participation considerations offering a series of models that enable us to reason about the basic dilemma, the case where retraction effects influence the outcome and the case when payments are given universally irrespective of the stochastic process. In all cases we provide characterization results or necessary conditions on the structure of Nash equilibria. Our findings reveal that appropriate reward mechanisms can be used to stimulate participation and avoid negative effects of free riding, results that are in line but also can inform real world blockchain system deployments

Blockchain participation games

We study game-theoretic models for capturing participation in blockchain systems. Existing blockchains can be naturally viewed as games, where a set of potentially interested users is faced with the dilemma of whether to engage with the protocol or not. Engagement here implies that the user will be asked to complete certain tasks, whenever she is selected to contribute, according to some stochastic process. Apart from the basic dilemma of engaging or not, even more strategic considerations arise in systems where users may be able to declare participation and then retract (while still being able to receive rewards). We propose two models for studying such games, with the first one focusing on the basic dilemma of engaging or not, whereas the latter focuses on the retraction effects. In both models we provide characterization results or necessary conditions on the structure of Nash equilibria. Our findings reveal that appropriate reward mechanisms can be used to stimulate participation and avoid negative effects of free riding, results that are in line with real world blockchain system deployments

Graph Edits for Counterfactual Explanations: A comparative study

Counterfactuals have been established as a popular explainability technique which leverages a set of minimal edits to alter the prediction of a classifier. When considering conceptual counterfactuals on images, the edits requested should correspond to salient concepts present in the input data. At the same time, conceptual distances are defined by knowledge graphs, ensuring the optimality of conceptual edits. In this work, we extend previous endeavors on graph edits as counterfactual explanations by conducting a comparative study which encompasses both supervised and unsupervised Graph Neural Network (GNN) approaches. To this end, we pose the following significant research question: should we represent input data as graphs, which is the optimal GNN approach in terms of performance and time efficiency to generate minimal and meaningful counterfactual explanations for black-box image classifiers

Approximate lower bound arguments

Suppose a prover, in possession of a large body of valuable evidence, wants to quickly convince a verifier by presenting only a small portion of the evidence. We define an Approximate Lower Bound Argument, or ALBA, which allows the prover to do just that: to succinctly prove knowledge of a large number of elements satisfying a predicate (or, more generally, elements of a sufficient total weight when a predicate is generalized to a weight function). The argument is approximate because there is a small gap between what the prover actually knows and what the verifier is convinced the prover knows. This gap enables very efficient schemes. We present noninteractive constructions of ALBA in the random oracle and Uniform Random String models and show that our proof sizes are nearly optimal. We also show how our constructions can be made particularly communication-efficient when the evidence is distributed among multiple provers working together, which is of practical importance when ALBA is applied to a decentralized setting. We demonstrate two very different applications of ALBAs: for large-scale decentralized signatures and for achieving universal composability in general-purpose succinct proof systems (SNARKs)

Phenotypic plasticity and epithelial-to-mesenchymal transition in the behaviour and therapeutic response of oral squamous cell carcinoma

This work was supported by the National Centre for the Replacement, Refinement and Reduction of Animals in Research (NC3Rs), by BAOMS/Saving Faces – FSRF, and by The Barts and The London Charity