2,538 research outputs found
Peer-to-Peer Secure Multi-Party Numerical Computation Facing Malicious Adversaries
We propose an efficient framework for enabling secure multi-party numerical
computations in a Peer-to-Peer network. This problem arises in a range of
applications such as collaborative filtering, distributed computation of trust
and reputation, monitoring and other tasks, where the computing nodes is
expected to preserve the privacy of their inputs while performing a joint
computation of a certain function. Although there is a rich literature in the
field of distributed systems security concerning secure multi-party
computation, in practice it is hard to deploy those methods in very large scale
Peer-to-Peer networks. In this work, we try to bridge the gap between
theoretical algorithms in the security domain, and a practical Peer-to-Peer
deployment.
We consider two security models. The first is the semi-honest model where
peers correctly follow the protocol, but try to reveal private information. We
provide three possible schemes for secure multi-party numerical computation for
this model and identify a single light-weight scheme which outperforms the
others. Using extensive simulation results over real Internet topologies, we
demonstrate that our scheme is scalable to very large networks, with up to
millions of nodes. The second model we consider is the malicious peers model,
where peers can behave arbitrarily, deliberately trying to affect the results
of the computation as well as compromising the privacy of other peers. For this
model we provide a fourth scheme to defend the execution of the computation
against the malicious peers. The proposed scheme has a higher complexity
relative to the semi-honest model. Overall, we provide the Peer-to-Peer network
designer a set of tools to choose from, based on the desired level of security.Comment: Submitted to Peer-to-Peer Networking and Applications Journal (PPNA)
200
Comparison of CFD and DSMC Using Calibrated Transport Parameters
Hypersonic re-entry flows span a wide range of length scales where regions of both rarefied and continuum flow exist. Traditional computational fluid dynamics (CFD) techniques do not provide an accurate solution for the rarefied regions of such mixed flow fields. Although direct simulation Monte Carlo (DSMC) can be used to accurately capture both the continuum and rarefied features of mixed flow fields, they are computationally expensive when employed to simulate the low Knudsen number continuum regimes. Thus, a hybrid framework for seamlessly combining the two methodologies, CFD and DSMC, continues to be a topic of significant research effort. Ensuring consistency in the reaction kinetics and transport models employed within CFD and DSMC is a crucial requirement for obtaining a reliable solution from a hybrid framework for combined continuum/rarefied high speed flows. This paper represents one of the first studies to utilize the calibrated transport parameters developed to ensure consistency between CFD and DSMC solvers. The new variable soft sphere (VSS) parameters are compared to both previous standard variable hard sphere (VHS) parameters and also to solutions from the CFD transport properties that the new parameters were developed to reproduce
Multi-party Quantum Computation
We investigate definitions of and protocols for multi-party quantum computing
in the scenario where the secret data are quantum systems. We work in the
quantum information-theoretic model, where no assumptions are made on the
computational power of the adversary. For the slightly weaker task of
verifiable quantum secret sharing, we give a protocol which tolerates any t <
n/4 cheating parties (out of n). This is shown to be optimal. We use this new
tool to establish that any multi-party quantum computation can be securely
performed as long as the number of dishonest players is less than n/6.Comment: Masters Thesis. Based on Joint work with Claude Crepeau and Daniel
Gottesman. Full version is in preparatio
CFD modeling of a fixed-bed biofilm reactor coupling hydrodynamics and biokinetics
Peer ReviewedPostprint (author's final draft
PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES
Visual secret sharing schemes (VSS) represent an important concept of visual cryptography. They permit the sharing of a secret image between multiple participants so that only authorized groups can recover the secret. This paper considers the software implementation of some black-and-white secret images VSS in Python programming language. PIL (Python Imaging Library) provides strong image processing capabilities, making the library suitable for this kind of implementation. We present samples of the results obtained from the software computation and draw some conclusions.visual secret sharing, visual cryptography, Python, PIL (Python Imaging Library)
Acoustic Echo Cancellation and their Application in ADF
In this paper, we present an overview of the principal, structure and the application of the echo cancellation and kind of application to improve the performance of the systems. Echo is a process in which a delayed and distorted version o the original sound or voice signal is reflected back to the source. For the acoustic echo canceller much and more study are required to make the good tracking speed fast and reduce the computational complexity. Due to the increasing the processing requirement, widespread implementation had to wait for advances in LSI, VLSI echo canceller appeared.
DOI: 10.17762/ijritcc2321-8169.150513
- …