Cerca
Ara es mostren els items 1-10 de 48
Extending Brickell-Davenport theorem to non-perfect secret sharing schemes
(2015-02)
Article.
Accés obert
Article.
Accés obert
One important result in secret sharing is the Brickell-Davenport Theorem: every ideal perfect secret sharing scheme de nes a matroid that is uniquely determined by the access structure. Even though a few attempts have been ...
Soft and hard modelling methods for decovolution of mixtures of Raman spectra for pigment analysis: a qualitative and quantitative approach
(2000-01)
Article.
Accés restringit per política de l'editorial
Article.
Accés restringit per política de l'editorial
Raman spectroscopy provides a means for the detection and identification of pictorial materials on artworks. As a non-destructive, applicable in situ and non-ambiguous technique, it is one of the most preferred to analyse ...
Kd-trees and the real disclosure risks of large statistical databases
(Elsevier, 2011)
Article.
Accés restringit per política de l'editorial
Article.
Accés restringit per política de l'editorial
In data privacy, record linkage can be used as an estimator of the disclosure risk of protected data. To
model the worst case scenario one normally attempts to link records from the original data to the protected
data. ...
Cropping Euler factors of modular L-functions
(2013-09)
Article.
Accés obert
Article.
Accés obert
According to the Birch and Swinnerton-Dyer conjectures, if A/Q is an abelian variety, then its L-function must capture a substantial part of the properties of A. The smallest number field L where A has all its endomorphisms ...
Natural generalizations of threshold secret sharing
(2014-01-14)
Article.
Accés obert
Article.
Accés obert
We present new families of access structures that, similarly to the multilevel and compartmented access structures introduced in previous works, are natural generalizations of threshold secret sharing. Namely, they admit ...
On the optimization of bipartite secret sharing schemes
(2010)
Article.
Accés obert
Article.
Accés obert
Optimizing the ratio between the maximum length of the shares and the length of the secret value in secret sharing schemes for general access structures is an extremely difficult and long-standing open problem. In this ...
Secure and efficient anonymization of distributed confidential databases
(2014)
Article.
Accés restringit per política de l'editorial
Article.
Accés restringit per política de l'editorial
Let us consider the following situation: t entities (e.g., hospitals) hold different databases containing different records for the same type of confidential (e.g., medical) data. They want to deliver a protected version ...
Classifying data from protected statistical datasets
(2010-06-09)
Article.
Accés obert
Article.
Accés obert
Statistical Disclosure Control (SDC) is an active research area in the recent years. The goal is to transform an original dataset X into a protected one X0, such that X0 does not reveal any relation between confidential ...
An algebraic framework for Diffie-Hellman assumptions
(2017-01)
Article.
Accés obert
Article.
Accés obert
We put forward a new algebraic framework to generalize and analyze Di e-Hellman like Decisional Assumptions which allows us to argue about security and applications by considering only algebraic properties. Our D`;k-MDDH ...
Optimal symbol alignment distance: a new distance for sequences of symbols
(IEEE Press. Institute of Electrical and Electronics Engineers, 2010-10-14)
Article.
Accés obert
Article.
Accés obert
Comparison functions for sequences (of symbols) are important components of many applications, for example clustering, data cleansing and integration. For years, many efforts have been made to improve the performance of ...