4529 search results - page 205 / 906 » Position Based Cryptography |
174
click to vote
PKC
2004
Springer
15 years 11 months ago
2004
Springer
Let E be an elliptic curve defined over F2n . The inverse operation of point doubling, called point halving, can be done up to three times as fast as doubling. Some authors have t...
142
click to vote
TCC
2004
Springer
15 years 11 months ago
2004
Springer
We show how to public-key obfuscate two commonly used shuffles: decryption shuffles which permute and decrypt ciphertexts, and re-encryption shuffles which permute and re-encrypt c...
169
click to vote
ICNP
2003
IEEE
15 years 11 months ago
2003
IEEE
A prerequisite for secure communication between two nodes in an ad hoc network is that the nodes share a key to bootstrap their trust relationship. In this paper, we present a sca...
152
click to vote
ICPPW
2003
IEEE
15 years 11 months ago
2003
IEEE
In a classic paper, among a multitude of other security issues, Claude E. Shannon defined perfect secrecy for a pair of secure computers communicating over an insecure link. The ...
160
click to vote
CHES
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. A novel technique for computing a 2n-bit modular multiplication using n-bit arithmetic was introduced at CHES 2002 by Fischer and Seifert. Their technique makes use of an...