pinecone/core-2020-05-10-deduplication huggingface dataset:
Composable security of delegated quantum computation

Delegating difficult computations to remote large computation facilities,
with appropriate security guarantees, is a possible solution for the
ever-growing needs of personal computing power. For delegated computation
protocols to be usable in a larger context---or simply to securely run two
protocols in parallel---the security definitions need to be composable. Here,
we define composable security for delegated quantum computation. We distinguish
between protocols which provide only blindness---the computation is hidden from
the server---and those that are also verifiable---the client can check that it
has received the correct result. We show that the composable security
definition capturing both these notions can be reduced to a combination of
several distinct "trace-distance-type" criteria---which are, individually,
non-composable security definitions.
  Additionally, we study the security of some known delegated quantum
computation protocols, including Broadbent, Fitzsimons and Kashefi's Universal
Blind Quantum Computation protocol. Even though these protocols were originally
proposed with insufficient security criteria, they turn out to still be secure
given the stronger composable definitions.Comment: 37+9 pages, 13 figures. v3: minor changes, new references. v2:
  extended the reduction between composable and local security to include
  entangled inputs, substantially rewritten the introduction to the Abstract
  Cryptography (AC) framewor
GLV/GLS Decomposition, Power Analysis, and Attacks on ECDSA Signatures with Single-Bit Nonce Bias

ISBN : 978-3-662-45610-1International audienceThe fastest implementations of elliptic curve cryptography in recent years have been achieved on curves endowed with nontriv-ial efficient endomorphisms, using techniques due to Gallant–Lambert– Vanstone (GLV) and Galbraith–Lin–Scott (GLS). In such implementa-tions, a scalar multiplication [k]P is computed as a double multiplication [k1]P + [k2]ψ(P), for ψ an efficient endomorphism and k1, k2 appropri-ate half-size scalars. To compute a random scalar multiplication, one can either select the scalars k1, k2 at random, hoping that the resulting k = k1 + k2λ is close to uniform, or pick a uniform k instead and decom-pose it as k1 + k2λ afterwards. The main goal of this paper is to discuss security issues that may arise using either approach. When k1 and k2 are chosen uniformly at random in [0, √ n), n = ord(P), we provide a security proofs under mild assumptions. However, if they are chosen as random integers of 1
Soft Analytical Side-Channel Attacks

International audienceIn this paper, we introduce a new approach to side-channel key recovery, that combines the low time/memory complexity and noise tolerance of standard (divide and conquer) differential power analysis with the optimal data complexity of algebraic side-channel attacks. Our fundamental contribution for this purpose is to change the way of ex-pressing the problem, from the system of equations used in algebraic at-tacks to a code, essentially inspired by low density parity check codes. We then show that such codes can be efficiently decoded, taking advantage of the sparsity of the information corresponding to intermediate variables in actual leakage traces. The resulting soft analytical side-channel attacks work under the same profiling assumptions as template attacks, and di-rectly exploit the vectors of probabilities produced by these attacks. As a result, we bridge the gap between popular side-channel distinguishers based on simple statistical tests and previous approaches to analytical side-channel attacks that could only exploit hard information so far
Low probability differentials and the cryptanalysis of full-round CLEFIA-128

So far, low probability differentials for the key schedule of block ciphers have been used as a straightforward proof of security against related-key differential analysis. To achieve resistance, it is believed that for cipher with k-bit key it suffices the upper bound on the probability to be 2− k . Surprisingly, we show that this reasonable assumption is incorrect, and the probability should be (much) lower than 2− k . Our counter example is a related-key differential analysis of the well established block cipher CLEFIA-128. We show that although the key schedule of CLEFIA-128 prevents differentials with a probability higher than 2− 128, the linear part of the key schedule that produces the round keys, and the Feistel structure of the cipher, allow to exploit particularly chosen differentials with a probability as low as 2− 128. CLEFIA-128 has 214 such differentials, which translate to 214 pairs of weak keys. The probability of each differential is too low, but the weak keys have a special structure which allows with a divide-and-conquer approach to gain an advantage of 27 over generic analysis. We exploit the advantage and give a membership test for the weak-key class and provide analysis of the hashing modes. The proposed analysis has been tested with computer experiments on small-scale variants of CLEFIA-128. Our results do not threaten the practical use of CLEFIA
Shape Recognition by Bag of Skeleton-associated Contour Parts

Contour and skeleton are two complementary representations for shape
recognition. However combining them in a principal way is nontrivial, as they
are generally abstracted by different structures (closed string vs graph),
respectively. This paper aims at addressing the shape recognition problem by
combining contour and skeleton according to the correspondence between them.
The correspondence provides a straightforward way to associate skeletal
information with a shape contour. More specifically, we propose a new shape
descriptor. named Skeleton-associated Shape Context (SSC), which captures the
features of a contour fragment associated with skeletal information. Benefited
from the association, the proposed shape descriptor provides the complementary
geometric information from both contour and skeleton parts, including the
spatial distribution and the thickness change along the shape part. To form a
meaningful shape feature vector for an overall shape, the Bag of Features
framework is applied to the SSC descriptors extracted from it. Finally, the
shape feature vector is fed into a linear SVM classifier to recognize the
shape. The encouraging experimental results demonstrate that the proposed way
to combine contour and skeleton is effective for shape recognition, which
achieves the state-of-the-art performances on several standard shape
benchmarks.Comment: 10 pages. Has been Accepted by Pattern Recognition Letters 201
A Hough Transform Based Biclustering Algorithm for Gene Expression Data

In pattern classification, when the feature space is of high dimension or patterns are "similar" on a subset of features only, the traditional clustering methods do not have good performances. Biclustering is a class of methods that simultaneously group on two dimensions and has many applications to different fields, especially gene expression data analysis. Because of simultaneous classification on both rows and columns of a data matrix, the biclustering problem is inherently intractable and computationally complex. and oOne of the most complex models in biclustering problem is linear coherent model. So sSeveral biclustering algorithms based on this model have been proposed in recent years. However, none of them is able to perfectly recognize all linear patterns in a bicluster. In this work, we propose a novel algorithm based on Hough transform that can find all linear coherent patterns and apply it to gene expression data.Full Tex
Missing Value Imputation for the Analysis of Incomplete Traffic Accident Data

Road traffic accidents are a major public health concern, resulting in an estimated 1.3 million deaths and 52 million injuries worldwide each year. All the developed and developing countries suffer from the consequences of increase in both human and vehicle population. Therefore, methods to reduce accident severity are of great interest to traffic agencies and the public at large. To analysis the traffic accident factors effectively we need a complete traffic accident historical database without missing data. Road accident fatality rate depends on many factors and it is a very challenging task to investigate the dependencies between the attributes because of the many environmental and road accident factors. Any missing data in the database could obscure the discovery of important factors and lead to invalid conclusions. In order to make the traffic accident datasets useful for analysis, it should be preprocessed properly. In this paper, we present a novel method based on decision tree and imputed value sampling based on correlation measure for the imputation of missing values to improve the quality of the traffic accident data. We applied our algorithm to the publicly available large traffic accident database of United States (explore.data.gov), which is the largest open federal database in United States. We compare our algorithm with three existing imputation methods using three evaluation criteria, i.e. mean absolute error, coefficient of determination and root mean square error. Our results indicate that the proposed method performs significantly better than the three existing algorithms.Griffith Sciences, School of Information and Communication TechnologyFull Tex
Fuzzy If-Then Rules Classifier on Ensemble Data

This paper introduces a novel framework in which classification method based on fuzzy IF-THEN rules is co-operated with an ensemble system. This model tackles several drawbacks. First, IF-THEN rules approaches have problem with high dimensional data since computational cost is exponential function. In this framework, rules are operated on outputs of base classifiers which have frequently lower dimension than original data. Moreover, outputs of base classifiers are scaled within the range [0, 1] so it is convenient to apply fuzzy rules directly instead of data transformation and normalization as requirement for inputs of fuzzy rules. The performance of this model was evaluated through experiments on 6 popular datasets from UCI Machine Learning Repository and comparisons with other state-of-art combining classifiers algorithms as well as other fuzzy IF-THEN rules approaches. The results show that our framework can improve the classification accuracy.Griffith Sciences, School of Information and Communication TechnologyFull Tex
Image Segmentation based on Graph-Cut Models and Probabilistic Graphical Models: a Comparative Study

Image Segmentation has been one of the most important unsolved problems in computer vision for many years. Recently, there have been great efforts in producing better segmentation algorithms. The purpose of this paper is to introduce two recently proposed graph based segmentation methods, namely, graph-cut models (deterministic) and unified graphical model (probabilistic). We present some foreground/background segmentation results to illustrate their performance on images with complex background scene.Griffith Sciences, School of Information and Communication TechnologyFull Tex
Fusion of Classifiers based on a Novel 2-Stage Model

The paper introduces a novel 2-Stage model for multi-classifier system. Instead of gathering posterior probabilities resulted from base classifiers into Level1 data like in the original 2-Stage model, here we separate data in K Level1 matrices corresponding to the K base classifiers. These data matrices, in turn, are classified in sequence by a new classifier at the second stage to generate Level2 data. Next, Weight Matrix is proposed to combine Level2 data and predict label of observations in test set. Experimental results on CLEF2009 medical image database demonstrate the benefit of our model in comparison with several ensemble learning models.Griffith Sciences, School of Information and Communication TechnologyFull Tex
Homomorphic Cryptography-based Privacy-Preserving Network Communications

International audienceThe development of worldwide communications, along with the dramatic increase of computational and storage capacities promise numerous benefits for societies in the years to come. For these systems to develop, security and privacy are necessary. This work presents a novel protocol for privacy preserving network communications, using homo-morphic cryptography. The malleability properties of homomorphic en-cryption allows routing without ever disclosing the sender or receiver of a message, while resisting against basic end-to-end attacks. We first present our protocol in an abstract network model, and instantiate it for ad-hoc networks as a use-case example
Digital Drugs: an anatomy of new medicines

Medicines are digitalized as aspects of their regulation and use are embodied in or draw from interlinked computerized systems and databases. This paper considers how this development changes the delivery of health care, the pharma industry, and regulatory and professional structures, as it reconfigures the material character of drugs themselves. It draws on the concept of assemblage in presenting a theory-based analysis that explores digital drugs’ ontological status including how they embody benefit and value. The paper addresses three interconnected domains – that of use of drugs (practice), of research (epistemology) and of regulation (structures)
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths

When can a plane graph with prescribed edge lengths and prescribed angles (from among {0,180°, 360°}) be folded flat to lie in an infinitesimally thick line, without crossings? This problem generalizes the classic theory of single-vertex flat origami with prescribed mountain-valley assignment, which corresponds to the case of a cycle graph. We characterize such flat-foldable plane graphs by two obviously necessary but also sufficient conditions, proving a conjecture made in 2001: the angles at each vertex should sum to 360°, and every face of the graph must itself be flat foldable. This characterization leads to a linear-time algorithm for testing flat foldability of plane graphs with prescribed edge lengths and angles, and a polynomial-time algorithm for counting the number of distinct folded states.National Science Foundation (U.S.) (ODISSEI Grant EFRI-1240383)National Science Foundation (U.S.) (Expedition Grant CCF-1138967
Büchi Automata Optimisations Formalised in Isabelle/HOL

In applications of automata theory, one is interested in reductions in  the size of automata that preserve the recognised language. For Büchi  automata, two optimisations have been proposed: bisimulation  reduction, which computes equivalence classes of states and collapses  them, and $a$-balls reduction, which collapses  strongly connected components (SCCs) of an automaton that only contain  one single letter as edge label. In this paper, we present a  formalisation of these algorithms in Isabelle/HOL, providing a  formally verified implementation
More security or less insecurity (transcript of discussion)

The purpose of this talk is to explore the possibility of an exploitable analogy between approaches to secure system design and theories of jurisprudence. The prevailing theory of jurisprudence in the West at the moment goes back to Hobbes. It was developed by Immanuel Kant and later by Rousseau, and is sometimes called the contractarian model after Rousseau???s idea of the social contract. It???s not the sort of contract that you look at and think, oh gosh, that might be nice, I might think about opting in to that, it???s more like a pop up licence agreement that says, do you want to comply with this contract, or would you rather be an outlaw. So you don???t get a lot of choice about it. Sometimes the same theory, flying the flag of Immanuel Kant, is called transcendental institutionalism, because the basic approach says, you identify the legal institutions that in a perfect world would govern society, and then you look at the processes and procedures, the protocols that everyone should follow in order to enable those institutions to work, and then you say, right, that can???t be transcended, so therefore there???s a moral imperative for everyone to do it. So this model doesn???t pay any attention to the actual society that emerges, or to the incentives that these processes actually place on various people to act in a particular way. It doesn???t look at any interaction effects, it simply says, well you have to behave in this particular way because that???s what the law says you have to do, and the law is the law, and anybody who doesn???t behave in that way is a criminal, or (in our terms) is an attacke
Relay-proof channels using UWB lasers

Alice is a hand-held device. Bob is a device providing a service, such as an ATM, an automatic door, or an anti-aircraft gun pointing at the gyro-copter in which Alice is travelling. Bob and Alice have never met, but share a key, which Alice uses to request a service from Bob (dispense cash, open door, don't shoot). Mort pretends to Bob that she is Alice, and her accomplice Cove pretends to Alice that he is Bob. Mort and Cove relay the appropriate challenges and responses to one another over a channel hidden from Alice and Bob. Meanwhile Alice waits impatiently in front of a different ATM, or the wrong door, or another gun. How can such an attack be prevented
Knowledge management: A cross sectorial comparison of wind generation and naval engineering

Offshore wind farms and naval vessels are examples of complex systems. A number of differences exist, e.g. the first is an exemplar of a developing technology, the second a technology having been developed and enhanced over centuries. Never the less a number of similarities exist, e.g. the development of responsive systems in physically demanding environments. Each of the technologies adheres to a prescribed product lifecycle, e.g. “ISO 15288, Systems and software engineering – System life cycle processes”, whereby each phase has distinct information and knowledge requirements. Furthermore, the adoption of a structured lifecycle ensures each technology considers the complete lifecycle and its integration within a potential system of systems. This cross sectoral study will review in-service knowledge management in two different fields of engineering, firstly Offshore Wind Generation which is a complex infrastructure system and secondly Royal Navy vessels which are complex marine engineering systems.Full Tex
Information resources for the identification of complex asset condition: A naval engineering case study

This paper describes the research in identifying the key data elements that are indicative of the material state of a naval vessel. Naval vessels are long lived complex artefacts, containing in excess of 100 integrated “hard” systems. The systems may be configured to provide a variety of prescribed capabilities and associated command objective. However, the “hard” systems will not fully integrate or function in a cohesive manner without the interaction of “soft” socio-technical systems (e.g. maintenance teams, operators); the two are interdependent and reliant. The In-Service phase will contribute 70% of the artefact’s through-life costs and may comprise an operating period of more than 25 years. The data generated and utilised within each mode will reflect the operational and technical requirements of the numerous stakeholders and the functional state of the vessel.Full Tex
Towards an Enhancement of Relationships Browsing in Mature PLM Systems

Part 8: Change Management and MaturityInternational audienceProduct Lifecycle Management (PLM) domain is at a key point in its development: its concepts and technologies are mature. PLM systems not only manage documents but information associated to a product along its lifecycle, such as Bills-Of-Material (BOM) or require- ments at different levels of granularity. All the dependencies between concepts lead to complex relationships from which it is not easy to get a coherent overview. The purpose of the paper is to know whether PLM systems are able to deal relationships complexity. Two case studies – one form manufacturing industry and the other one from a new application domain of PLM, Bio-Medical Imaging - are developed in the paper. They show that hierarchical browsing of existing PLM systems is not suitable to manage relationships complexity and must evolve to graph browsing
Realizable, Connector-Driven Software Architectures for Practising Engineers

Despite being a widely-used language for specifying software systems, UML remains less than ideal for software architectures. Architecture description languages (ADLs) were developed to provide more comprehensive support. However, so far the application of ADLs in practice has been impeded by at least one of the following problems: (i) advanced formal notations requiring a steep learning curve, (ii) lack of support for user-defined, complex connectors, and (iii) potentially unrealizable architectural designs.\ud
\ud
This paper proposes Xcd, a new ADL that aims at supporting user-defined, complex connectors to help increase architectural modularity. It also aims to help increase the degree of reusability, as now components need not specify interaction protocols, as these can be specified independently by connectors (which increases protocol reusability too).\ud
Connector support requires to ensure that architectural designs are always realizable, as it is currently extremely easy to obtain unrealizable ones. Xcd eliminates potentially unrealizable constructs in connector specifications.\ud
\ud
Finally, Xcd employs a notation and notions from Design-by-Contract (DbC) for specifying software architecture behaviour. While DbC promotes a formal and precise way of specifying system behaviours, it is not as challenging for practising developers as process algebras that are usually employed by ADLs
Criminal liability of autonomous agents: from the unthinkable to the plausible

Series : Lecture notes in computer science, ISSN 0302-9743, vol. 8929The evolution of information technologies have brought us to a point where we are confronted with the existence of agents - computational entities - which are able to act autonomously with little or no human intervention. And their behavior can damage individual or collective interests that are protected by criminal law.
Based on the analysis of different models of criminal responsibility of legal persons - which constituted an interesting advance in the criminal law in rela-tion to what was hitherto traditionally accepted -, we will appraise whether the necessary legal elements to have direct criminal liability of artificial entities are present.This work is part-funded by CROWDSOURCING project (Reference: DER2012-39492-C02-01)
Harnessing content and context for enhanced decision making

In a time in which a significant amount of interpersonal interactions
take place online, one must enquire to which extent are these
milieus suitable for supporting the complexity of our communication.
This is especially important in more sensitive domains, such as the one of
Online Dispute Resolution, in which inefficient communication environments
may result in misunderstandings, poor decisions or the escalation
of the conflict. The conflict manager, in particular, may find his skills
severely diminished, namely in what concerns the accurate perception of
the state of the parties. In this paper the development of a rich communication
framework is detailed that conveys contextual information about
their users, harnessed from the transparent analysis of their behaviour
while communicating. Using it, the conflict manager may not only better
perceive the conflict and how it affects each party but also take better
contextualized decisions, closer to the ones taken in face-to-face settings.This work is part-funded by ERDF - European Regional Development Fund
through the COMPETE Programme (operational programme for competitiveness)
and by National Funds through the FCT { Fundação para a Ciência e a
Tecnologia (Portuguese Foundation for Science and Technology) within project
FCOMP-01-0124-FEDER-028980 (PTDC/EEI-SII/1386/2012) and project PEst-
OE/EEI/UI0752/2014