397 search results - page 26 / 80 » Pseudorandom Functions and Lattices |
179
click to vote
DBWORKSHOPS
1992
15 years 2 months ago
1992
Godin, R. and R. Missaoui, An incremental concept formation approach for learning from databases, Theoretical Computer Science 133 (1994) 3533385. This paper describes a concept f...
JUCS
2007
15 years 1 months ago
2007
Abstract: We introduce the notion of ∧- and ∨-pairs of functions on lattices as an abstraction of the notions of metric and its related entropy for probability distributions. T...
111
click to vote
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
ASIACRYPT
1999
Springer
15 years 5 months ago
1999
Springer
A periodical multi-secret threshold cryptosystem enables a sender to encrypt a message by using a cyclical sequence of keys which are shared by n parties and periodically updated. ...
103
click to vote
ESORICS
2007
Springer
15 years 7 months ago
2007
Springer
Port knocking is a technique first introduced in the blackhat and trade literature to prevent attackers from discovering and exploiting potentially vulnerable services on a networ...