352 search results - page 61 / 71 » Cryptography in the Multi-string Model |
EUROCRYPT
2007
Springer
14 years 4 months ago
2007
Springer
Protocols proven secure within the universal composability (UC) framework satisfy strong and desirable security properties. Unfortunately, it is known that within the “plain” m...
EUROCRYPT
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
CODES
2005
IEEE
14 years 3 months ago
2005
IEEE
In this paper, we present the analysis, design and implementation of an estimator to realize large bit width unsigned integer multiplier units. Larger multiplier units are require...
CCS
2001
ACM
14 years 2 months ago
2001
ACM
Authenticating mobile computing users can require a significant amount of processing and communications resources— particularly when protocols based on public key encryption are...
JOC
2000
13 years 9 months ago
2000
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...