Sciweavers

402 search results - page 60 / 81
» Cryptosystems using Linear Groups
Sort
View
CVPR
2012
IEEE
13 years 11 days ago
Meta-class features for large-scale object categorization on a budget
In this paper we introduce a novel image descriptor enabling accurate object categorization even with linear models. Akin to the popular attribute descriptors, our feature vector ...
Alessandro Bergamo, Lorenzo Torresani
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
15 years 4 months ago
Parallel Repetition of Computationally Sound Protocols Revisited
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
Krzysztof Pietrzak, Douglas Wikström
RTA
2005
Springer
15 years 3 months ago
The Algebra of Equality Proofs
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...
Aaron Stump, Li-Yang Tan
GD
2006
Springer
15 years 1 months ago
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
Carsten Gutwenger, Karsten Klein, Petra Mutzel
EUROCRYPT
2012
Springer
13 years 10 days ago
Fully Homomorphic Encryption with Polylog Overhead
We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorp...
Craig Gentry, Shai Halevi, Nigel P. Smart