397 search results - page 27 / 80 » Pseudorandom Functions and Lattices |
KES
2005
Springer
15 years 6 months ago
2005
Springer
We present a simple, yet general top-down query answering procedure for logic programs managing uncertainty. The main features are: (i) the certainty values are taken from a certai...
ICPR
2010
IEEE
14 years 11 months ago
2010
IEEE
This paper presents the binary flattenings of shapes, first as a connected operator suppressing particles or holes, second as an erosion in a particular lattice of shapes. Using t...
EUROCRYPT
2007
Springer
15 years 5 months ago
2007
Springer
Motivated by the quest for reducing assumptions in security proofs in cryptography, this paper is concerned with designing efficient symmetric encryption and authentication schemes...
103
click to vote
COMBINATORICS
2000
15 years 1 months ago
2000
We construct examples of nonnegative harmonic functions on certain graded graphs: the Young lattice and its generalizations. Such functions first emerged in harmonic analysis on th...
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...