Sciweavers

230 search results - page 24 / 46
» A Complete Public-Key Cryptosystem
Sort
View
IMA
2005
Springer
162views Cryptology» more  IMA 2005»
14 years 1 months ago
Pairing-Based Cryptography at High Security Levels
In recent years cryptographic protocols based on the Weil and Tate pairings on elliptic curves have attracted much attention. A notable success in this area was the elegant solutio...
Neal Koblitz, Alfred Menezes
ACSAC
2000
IEEE
13 years 12 months ago
Introducing Decryption Authority into PKI
It is well-known that CA plays the central role in PKI. In this paper we introduce a new component into PKI, DA (decryption authority), which decrypts important and sensitive mess...
Feng Bao
IPL
1998
177views more  IPL 1998»
13 years 7 months ago
A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation
A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when the right-to-left binary exponentiation is applied. The idea is that the same common pa...
JaeCheol Ha, Sang-Jae Moon
CTRSA
2006
Springer
157views Cryptology» more  CTRSA 2006»
13 years 11 months ago
How to Construct Multicast Cryptosystems Provably Secure Against Adaptive Chosen Ciphertext Attack
Abstract. In this paper we present a general framework for constructing efficient multicast cryptosystems with provable security and show that a line of previous work on multicast ...
Yitao Duan, John F. Canny
SIGCSE
2004
ACM
95views Education» more  SIGCSE 2004»
14 years 28 days ago
Cryptography and computer security for undergraduates
The panel discusses solutions to the problem of computer security education. Categories and Subject Descriptors C.2.0 [Computer-Communication Networks]: security and protection. E...
Paul De Palma, Charles Frank, Suzanne E. Gladfelte...