Browsing by Subject "Public key cryptography"

Now showing 1 - 2 of 2

Open Access
Integration of structural and semantic models for multimedia metadata management
(IEEE, 2007-06) Little, S.; Martinelli, M.; Salvetti, O.; Güdükbay, Uğur; Ulusoy, Özgür; De Chalendar, G.; Grefenstette, G.
The management and exchange of multimedia data is challenging due to the variety of formats, standards and intended applications. In addition, production of multimedia data is rapidly increasing due to the availability of off-the-shelf, modern digital devices that can be used by even inexperienced users. It is likely that this volume of information will only increase in the future. A key goal of the MUSCLE (Multimedia Understanding through Semantics, Computation and Learning) network is to develop tools, technologies and standards to facilitate the interoperability of multimedia content and support the exchange of such data. One approach for achieving this was the creation of a specific "E-Team", composed of the authors, to discuss core questions and practical issues based on the participant's individual work. In this paper, we present the relevant points of view with regards to sharing experiences and to extracting and integrating multimedia data and metadata from different modes (text, images, video). © 2007 IEEE.
Open Access
Practical threshold signatures with linear secret sharing schemes
(Springer, 2009-06) Bozkurt, İlker Nadi; Kaya, Kamer; Selçuk, Ali Aydın
Function sharing deals with the problem of distribution of the computation of a function (such as decryption or signature) among several parties. The necessary values for the computation are distributed to the participating parties using a secret sharing scheme (SSS). Several function sharing schemes have been proposed in the literature, with most of them using Shamir secret sharing as the underlying SSS. In this paper, we investigate how threshold cryptography can be conducted with any linear secret sharing scheme and present a function sharing scheme for the RSA cryptosystem. The challenge is that constructing the secret in a linear SSS requires the solution of a linear system, which normally involves computing inverses, while computing an inverse modulo φ(N) cannot be tolerated in a threshold RSA system in any way. The threshold RSA scheme we propose is a generalization of Shoup's Shamir-based scheme. It is similarly robust and provably secure under the static adversary model. At the end of the paper, we show how this scheme can be extended to other public key cryptosystems and give an example on the Paillier cryptosystem. © 2009 Springer Berlin Heidelberg.