Sciweavers

397 search results - page 14 / 80
» Pseudorandom Functions and Lattices
Sort
View
103
Voted
JCT
2011
90views more  JCT 2011»
14 years 4 months ago
Extended Bressoud-Wei and Koike skew Schur function identities
Our recent paper [5] provides extensions to two classical determinantal results of Bressoud and Wei, and of Koike. The proofs in that paper were algebraic. The present paper conta...
A. M. Hamel, R. C. King
TCC
2009
Springer
117views Cryptology» more  TCC 2009»
15 years 10 months ago
Towards a Theory of Extractable Functions
Extractable functions are functions where any adversary that outputs a point in the range of the function is guaranteed to "know" a corresponding preimage. Here, knowledg...
Ran Canetti, Ronny Ramzi Dakdouk
ICIP
2005
IEEE
15 years 11 months ago
Hexagonal versus orthogonal lattices: a new comparison using approximation theory
We provide a new comparison between hexagonal and orthogonal lattices, based on approximation theory. For each of the lattices, we select the "natural" spline basis func...
Laurent Condat, Dimitri Van De Ville, Thierry Blu
PKC
2010
Springer
119views Cryptology» more  PKC 2010»
14 years 11 months ago
Efficient Set Operations in the Presence of Malicious Adversaries
We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main...
Carmit Hazay, Kobbi Nissim
67
Voted
DAC
2010
ACM
15 years 1 months ago
Lattice-based computation of Boolean functions
This paper studies the implementation of Boolean functions with lattices of two-dimensional switches. Each switch is controlled by a Boolean literal. If the literal is 1, the swit...
Mustafa Altun, Marc D. Riedel