488 search results - page 32 / 98 » Policy-Based Cryptography and Applications |
106
Voted
FSE
2005
Springer
15 years 6 months ago
2005
Springer
A T-function is a mapping from n-bit words to n-bit words in which for each 0 ≤ i < n, bit i of any output word can depend only on bits 0, 1, . . . , i of any input word. All ...
120
click to vote
PKC
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Bellare, Boldyreva, Desai, and Pointcheval [1] recently proposed a new security requirement of the encryption schemes called “keyprivacy.” It asks that the encryption...
92
Voted
ASIACRYPT
2003
Springer
15 years 5 months ago
2003
Springer
This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayn...
138
Voted
ENTCS
2007
15 years 18 days ago
2007
Designing secure protocols over ad-hoc networks has proved to be a very challenging task, due to various features of such networks, such as partial connectivity, node mobility, an...
114
Voted
TC
2008
15 years 17 days ago
2008
Since redundant number systems allow for constant time addition, they are often at the heart of modular multipliers designed for public key cryptography (PKC) applications. Indeed,...