7924 search results - page 200 / 1585 » Non-Malleable Functions and Their Applications |
208
click to vote
IAT
2010
IEEE
15 years 5 months ago
2010
IEEE
As wireless sensor network applications grow in complexity, ad-hoc techniques are no longer adequate. Thus, it is crucial that these systems be adaptive and autonomous to remain f...
215
click to vote
ICCAD
2007
IEEE
16 years 4 months ago
2007
IEEE
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...
196
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
196
click to vote
ASIACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
204
click to vote
AML
2008
15 years 7 months ago
2008
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...