Results 1  10
of
3,923
The Degree of Threshold mod 6 and Diophantine Equations
"... We continue the study of the degree of polynomials representing threshold functions modulo 6 initiated by Barrington et al.[1]. We use the framework established in [4] relating representations by symmetric polynomials to simultaneous protocols. We show that proving bounds on the degree of Threshold ..."
Abstract
 Add to MetaCart
We continue the study of the degree of polynomials representing threshold functions modulo 6 initiated by Barrington et al.[1]. We use the framework established in [4] relating representations by symmetric polynomials to simultaneous protocols. We show that proving bounds on the degree of Threshold
Securitycontrol methods for statistical databases: a comparative study
 ACM Computing Surveys
, 1989
"... This paper considers the problem of providing security to statistical databases against disclosure of confidential information. Securitycontrol methods suggested in the literature are classified into four general approaches: conceptual, query restriction, data perturbation, and output perturbation. ..."
Abstract

Cited by 405 (0 self)
 Add to MetaCart
This paper considers the problem of providing security to statistical databases against disclosure of confidential information. Securitycontrol methods suggested in the literature are classified into four general approaches: conceptual, query restriction, data perturbation, and output perturbation. Criteria for evaluating the performance of the various securitycontrol methods are identified. Securitycontrol methods that are based on each of the four approaches are discussed, together with their performance with respect to the identified evaluation criteria. A detailed comparative analysis of the most promising methods for protecting dynamiconline statistical databases is also presented. To date no single securitycontrol method prevents both exact and partial disclosures. There are, however, a few perturbationbased methods that prevent exact disclosure and enable the database administrator to exercise “statistical disclosure control. ” Some of these methods, however introduce bias into query responses or suffer from the O/l querysetsize problem (i.e., partial disclosure is possible in case of null query set or a query set of size 1). We recommend directing future research efforts toward developing new methods that prevent exact disclosure and provide statisticaldisclosure control, while at the same time do not suffer from the bias problem and the O/l querysetsize problem. Furthermore, efforts directed toward developing a biascorrection mechanism and solving the general problem of small querysetsize would help salvage a few of the current perturbationbased methods.
Synchronization and linearity: an algebra for discrete event systems
, 2001
"... The first edition of this book was published in 1992 by Wiley (ISBN 0 471 93609 X). Since this book is now out of print, and to answer the request of several colleagues, the authors have decided to make it available freely on the Web, while retaining the copyright, for the benefit of the scientific ..."
Abstract

Cited by 369 (11 self)
 Add to MetaCart
references are automatically converted into clickable hyperlinks, bookmarks are generated automatically, etc.. So, do not hesitate to click on references to equation or section numbers, on items of thetableofcontents and of the index, etc.. One may freely use and print this document for one’s own purpose or even distribute
Efficient algorithms for pairingbased cryptosystems
, 2002
"... Abstract. We describe fast new algorithms to implement recent cryptosystems based on the Tate pairing. In particular, our techniques improve pairing evaluation speed by a factor of about 55 compared to previously known methods in characteristic 3, and attain performance comparable to that of RSA in ..."
Abstract

Cited by 361 (25 self)
 Add to MetaCart
Abstract. We describe fast new algorithms to implement recent cryptosystems based on the Tate pairing. In particular, our techniques improve pairing evaluation speed by a factor of about 55 compared to previously known methods in characteristic 3, and attain performance comparable to that of RSA in larger characteristics. We also propose faster algorithms for scalar multiplication in characteristic 3 and square root extraction over Fpm, the latter technique being also useful in contexts other than that of pairingbased cryptography. 1
ThirdDegree Diophantine Equations
"... INTRODUCTION This work is devoted to the investigation of the solvability of the Diophantine equation x 3 + y 3 + z 3 = nxyz; (1) where n = 2 f0; 3g, n is an integer. The rst results were obtained as long ago as 1856 by Sylvester (see [1]). He proved that for n = 6 (1) had no solutions in non ..."
Abstract
 Add to MetaCart
INTRODUCTION This work is devoted to the investigation of the solvability of the Diophantine equation x 3 + y 3 + z 3 = nxyz; (1) where n = 2 f0; 3g, n is an integer. The rst results were obtained as long ago as 1856 by Sylvester (see [1]). He proved that for n = 6 (1) had no solutions
The Diophantine equations
, 2004
"... The aim of this paper is to prove the possibility of linearization of such equations by means of introduction of new variables. For n = 2 such a procedure is well known, when new variables are components of spinors and they are widely used in mathematical physics. For example, parametrization of Pyt ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
The aim of this paper is to prove the possibility of linearization of such equations by means of introduction of new variables. For n = 2 such a procedure is well known, when new variables are components of spinors and they are widely used in mathematical physics. For example, parametrization
Results 1  10
of
3,923