118 search results - page 18 / 24 » Ideal Secret Sharing Schemes from Permutations |
112
click to vote
INFOCOM
2002
IEEE
15 years 6 months ago
2002
IEEE
—The majority of the existing ad hoc wireless network routing protocols has a tendency to use the shortest single path from the source to the destination. However, in constantly ...
125
Voted
TIT
2011
14 years 8 months ago
2011
Abstract. In 1998, Blaze, Bleumer, and Strauss proposed a cryptographic primitive called proxy re-encryption, in which a proxy transforms – without seeing the corresponding plain...
114
Voted
CARDIS
2006
Springer
15 years 5 months ago
2006
Springer
We propose a protocol that can be used between an RFID tag and a reader to exchange a secret without performing any expensive computation. Similarly to the famous blocker tag sugge...
134
Voted
IEEEPACT
2002
IEEE
15 years 6 months ago
2002
IEEE
Simultaneous Multithreading (SMT) processors achieve high processor throughput at the expense of single-thread performance. This paper investigates resource allocation policies fo...
131
Voted
CCS
2008
ACM
15 years 3 months ago
2008
ACM
By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionali...