8,743 research outputs found
Signcryption schemes with threshold unsigncryption, and applications
The final publication is available at link.springer.comThe goal of a signcryption scheme is to achieve the same functionalities as encryption and signature together, but in a more efficient way than encrypting and signing separately. To increase security and reliability in some applications, the unsigncryption phase can be distributed among a group of users, through a (t, n)-threshold process. In this work we consider this task of threshold unsigncryption, which has received very few attention from the cryptographic literature up to now (maybe surprisingly, due to its potential applications). First we describe in detail the security requirements that a scheme for such a task should satisfy: existential unforgeability and indistinguishability, under insider chosen message/ciphertext attacks, in a multi-user setting. Then we show that generic constructions of signcryption schemes (by combining encryption and signature schemes) do not offer this level of security in the scenario of threshold unsigncryption. For this reason, we propose two new protocols for threshold unsigncryption, which we prove to be secure, one in the random oracle model and one in the standard model. The two proposed schemes enjoy an additional property that can be very useful. Namely, the unsigncryption protocol can be divided in two phases: a first one where the authenticity of the ciphertext is verified, maybe by a single party; and a second one where the ciphertext is decrypted by a subset of t receivers, without using the identity of the sender. As a consequence, the schemes can be used in applications requiring some level of anonymity, such as electronic auctions.Peer ReviewedPostprint (author's final draft
Secret Sharing for Cloud Data Security
Cloud computing helps reduce costs, increase business agility and deploy
solutions with a high return on investment for many types of applications.
However, data security is of premium importance to many users and often
restrains their adoption of cloud technologies. Various approaches, i.e., data
encryption, anonymization, replication and verification, help enforce different
facets of data security. Secret sharing is a particularly interesting
cryptographic technique. Its most advanced variants indeed simultaneously
enforce data privacy, availability and integrity, while allowing computation on
encrypted data. The aim of this paper is thus to wholly survey secret sharing
schemes with respect to data security, data access and costs in the
pay-as-you-go paradigm
Improving the efficiency of the detection of gravitational wave signals from inspiraling compact binaries: Chebyshev interpolation
Inspiraling compact binaries are promising sources of gravitational waves for
ground and space-based laser interferometric detectors. The time-dependent
signature of these sources in the detectors is a well-characterized function of
a relatively small number of parameters; thus, the favored analysis technique
makes use of matched filtering and maximum likelihood methods. Current analysis
methodology samples the matched filter output at parameter values chosen so
that the correlation between successive samples is 97% for which the filtered
output is closely correlated. Here we describe a straightforward and practical
way of using interpolation to take advantage of the correlation between the
matched filter output associated with nearby points in the parameter space to
significantly reduce the number of matched filter evaluations without
sacrificing the efficiency with which real signals are recognized. Because the
computational cost of the analysis is driven almost exclusively by the matched
filter evaluations, this translates directly into an increase in computational
efficiency, which in turn, translates into an increase in the size of the
parameter space that can be analyzed and, thus, the science that can be
accomplished with the data. As a demonstration we compare the present "dense
sampling" analysis methodology with our proposed "interpolation" methodology,
restricted to one dimension of the multi-dimensional analysis problem. We find
that the interpolated search reduces by 25% the number of filter evaluations
required by the dense search with 97% correlation to achieve the same
efficiency of detection for an expected false alarm probability. Generalized to
higher dimensional space of a generic binary including spins suggests an order
of magnitude increase in computational efficiency.Comment: 23 pages, 5 figures, submitted to Phys. Rev.
- …