Sciweavers

62 search results - page 8 / 13
» Non-Local Box Complexity and Secure Function Evaluation
Sort
View
ICCV
2009
IEEE
15 years 13 days ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...
POLICY
2005
Springer
14 years 28 days ago
Obligation Policies: An Enforcement Platform
The use of policy-based mechanisms significantly reduces the complexity associated with applicational development and operation. In particular, history-based policies allow the s...
Pedro Gama, Paulo Ferreira
VLDB
1993
ACM
73views Database» more  VLDB 1993»
13 years 11 months ago
A Model of Methods Access Authorization in Object-oriented Databases
Object-oriented databases are a recent and important development and many studies of them have been performed. These consider aspects such as data modeling, query languages, perfo...
Nurit Gal-Oz, Ehud Gudes, Eduardo B. Fernán...
STOC
2012
ACM
236views Algorithms» more  STOC 2012»
11 years 10 months ago
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
We propose a new notion of secure multiparty computation aided by a computationally-powerful but untrusted “cloud” server. In this notion that we call on-the-fly multiparty c...
Adriana López-Alt, Eran Tromer, Vinod Vaiku...
IWSEC
2009
Springer
14 years 2 months ago
Impossible Boomerang Attack for Block Cipher Structures
Impossible boomerang attack [5] (IBA) is a new variant of differential cryptanalysis against block ciphers. Evident from its name, it combines the ideas of both impossible differ...
Jiali Choy, Huihui Yap