534 search results - page 7 / 107 » Power from Random Strings |
113
click to vote
SCN
2010
Springer
14 years 8 months ago
2010
Springer
Serge Vaudenay [20] introduced a notion of Message Authentication (MA) protocols in the Short Authenticated String (SAS) model. A SAS-MA protocol authenticates arbitrarily long mes...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—In wireless networks, how to select transmit power that maximizes throughput is a challenging problem. On one hand, transmissions at a high power level could increase interferen...
ASIACRYPT
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. We introduce weaker models for non-interactive zero knowledge, in which the dealer is not restricted to deal a truly random string and may also have access to the input t...
105
click to vote
STOC
2005
ACM
15 years 10 months ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
ALGORITHMICA
2005
14 years 10 months ago
2005
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...