49 search results - page 5 / 10 » Lower Bounds on Signatures From Symmetric Primitives |
CRYPTO
2010
Springer
13 years 8 months ago
2010
Springer
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
ICNP
2006
IEEE
14 years 1 months ago
2006
IEEE
We describe a family of ÐÓ Ò protocols for assigning symmetric keys to Ò processes in a network so that each process can use its assigned keys to communicate securely with eve...
DCG
2008
13 years 7 months ago
2008
In [GL] it was shown that a polytope with few vertices is far from being symmetric in the Banach-Mazur distance. More precisely, it was shown that Banach-Mazur distance between su...
ECCC
2007
13 years 7 months ago
2007
We introduce the notion of a Canonical Tester for a class of properties on distributions, that is, a tester strong and general enough that “a distribution property in the class ...
DCG
2007
13 years 7 months ago
2007
We establish a new lower bound for the number of sides required for the component curves of simple Venn diagrams made from polygons. Specifically, for any n-Venn diagram of conve...