122 search results - page 18 / 25 » Light types for polynomial time computation in lambda-calcul... |
154
click to vote
DIALM
2008
ACM
15 years 5 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
139
Voted
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— Databases associated with keywords, can be public, private or hybrid, as a result the solutions to keyword search protocols for each type are different. In this paper, we study...
144
click to vote
ASIACRYPT
2007
Springer
15 years 10 months ago
2007
Springer
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
127
click to vote
CSFW
2007
IEEE
15 years 10 months ago
2007
IEEE
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
150
click to vote
EJC
2008
15 years 3 months ago
2008
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...