5316 search results - page 906 / 1064 » Which Search Problems Are Random |
145
click to vote
PKC
2009
Springer
16 years 4 months ago
2009
Springer
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
135
click to vote
EMSOFT
2009
Springer
15 years 11 months ago
2009
Springer
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms...
145
click to vote
ILP
2005
Springer
15 years 10 months ago
2005
Springer
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
159
click to vote
EUROCRYPT
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
153
Voted
HOTI
2002
IEEE
15 years 9 months ago
2002
IEEE
High-performance input-queued switches require highspeed scheduling algorithms while maintaining good performance. Various round-robin scheduling algorithms for Virtual Output Que...