Search results for "Secret sharing"
showing 10 items of 21 documents
A Lyapunov–Razumikhin approach for stability analysis of logistics networks with time-delays
2012
Logistics network represents a complex system where different elements that are logistic locations interact with each other. This interaction contains delays caused by time needed for delivery of the material. Complexity of the system, time-delays and perturbations in a customer demand may cause unstable behaviour of the network. This leads to the loss of the customers and high inventory costs. Thus the investigation of the network on stability is desired during its design. In this article we consider local input-to-state stability of such logistics networks. Their behaviour is described by a functional differential equation with a constant time-delay. We are looking for verifiable conditio…
Approximations and Metric Regularity in Mathematical Programming in Banach Space
1993
This paper establishes verifiable conditions ensuring the important notion of metric regularity for general nondifferentiable programming problems in Banach spaces. These conditions are used to obtain Lagrange-Kuhn-Tucker multipliers for minimization problems with infinitely many inequality and equality constraints.
Qualification Conditions for Calculus Rules of Coderivatives of Multivalued Mappings
1998
AbstractThis paper establishes by a general approach a full calculus for the limiting Fréchet and the approximate coderivatives of multivalued mappings. This approach allows us to produce several new verifiable qualification conditions for such calculus rules.
Generalized person-by-person optimization in team problems with binary decisions
2008
In this paper, we extend the notion of person by person optimization to binary decision spaces. The novelty of our approach is the adaptation to a dynamic team context of notions borrowed from the pseudo-boolean optimization field as completely local-global or unimodal functions and sub- modularity. We also generalize the concept of pbp optimization to the case where the decision makers (DMs) make decisions sequentially in groups of m, we call it mbm optimization. The main contribution are certain sufficient conditions, verifiable in polynomial time, under which a pbp or an mbm optimization algorithm leads to the team-optimum. We also show that there exists a subclass of sub-modular team pr…
Privacy-Preserving Overgrid: Secure Data Collection for the Smart Grid
2020
In this paper, we present a privacy-preserving scheme for Overgrid, a fully distributed peer-to-peer (P2P) architecture designed to automatically control and implement distributed Demand Response (DR) schemes in a community of smart buildings with energy generation and storage capabilities. To monitor the power consumption of the buildings, while respecting the privacy of the users, we extend our previous Overgrid algorithms to provide privacy preserving data aggregation (PP-Overgrid). This new technique combines a distributed data aggregation scheme with the Secure Multi-Party Computation paradigm. First, we use the energy profiles of hundreds of buildings, classifying the amount of &ldquo
Improved Magic Ink Signatures Using Hints
1999
We introduce two improvements to the recently proposed so called magic ink DSS signatures. A first improvement is that we reduce the overhead for tracing without noticeably increasing any other cost. The tracing cost is linear in the number of generated signatures in the original proposal; our improved version reduces this to a logarithmic cost in the common case. A second improvement is that we introduce a method for determining whether forged currency is in circulation, without affecting the privacy of honest users. Our improvements rely on our introducing a so called hint value. This is an encryption of the signature transcript received, submitted by the signature receiver. Part of the p…
Tool-life modelling as a stochastic process
1998
Abstract In a previous paper [G. Galante, A. Lombardo, A. Passannanti, Proceedings of XXXVII Scientific Meeting of the Italian Statistical Society, 1994, p. 553] the Authors proposed to model cutting tool wear behaviour as a stochastic process with independent Gaussian increments plus drift. Such a model implies that the tool-life, i.e. the time to reach a fixed value of flank wear, has an inverse Gaussian probability distribution. The model has several practical and theoretical advantages. In fact, it is based on an easily and cheaply experimentally verifiable wear behaviour hypothesis, it is more flexible because it is not limited to a particular wear level and, finally, the data are bett…
Multi-cloud privacy preserving schemes for linear data mining
2015
This paper presents an approach to privacy-preserving data mining that relies upon a relatively simple secret sharing scheme. Its main feature is that users, sensitive data owners, are engaged in the secret sharing operations that protect their privacy. They are grouped in independent clouds connected to a central unit, the data miner, that only manages the aggregated data of each cloud, therefore avoiding the disclosure of information belonging to single nodes. We propose two privacy preserving schemes, with different privacy levels and communication costs. When designing them, we assume that some users' data might become inaccessible during the operation of the privacy preserving protocol…
Properties and constraints of cheating-immune secret sharing schemes
2006
AbstractA secret sharing scheme is a cryptographic protocol by means of which a dealer shares a secret among a set of participants in such a way that it can be subsequently reconstructed by certain qualified subsets. The setting we consider is the following: in a first phase, the dealer gives in a secure way a piece of information, called a share, to each participant. Then, participants belonging to a qualified subset send in a secure way their shares to a trusted party, referred to as a combiner, who computes the secret and sends it back to the participants.Cheating-immune secret sharing schemes are secret sharing schemes in the above setting where dishonest participants, during the recons…
Secure, dependable and publicly verifiable distributed data storage in unattended wireless sensor networks
2010
Published version of an article from the journal : Science in China, Series F: Information Sciences. The original publication is available at Spingerlink. http://dx.doi.org/10.1007/s11432-010-0096-7 In unattended wireless sensor networks (UWSNs), sensed data are stored locally or at designated nodes and further accessed by authorized collectors on demand. This paradigm is motivated by certain scenarios where historical or digest data (e.g., average temperature in a day), instead of real-time data, are of interest. The data are not instantly forwarded to a central sink upon sensing, thereby saving communication energy for transmission. Such a paradigm can also improve data survivability by m…