Sciweavers

45 search results - page 3 / 9
» rsa 2000
Sort
View
ASIACRYPT
2000
Springer
13 years 9 months ago
Why Textbook ElGamal and RSA Encryption Are Insecure
Dan Boneh, Antoine Joux, Phong Q. Nguyen
EUROCRYPT
2000
Springer
13 years 9 months ago
Practical Threshold Signatures
We present an RSA threshold signature scheme. The scheme enjoys the following properties:
Victor Shoup
INFORMATICALT
2000
123views more  INFORMATICALT 2000»
13 years 5 months ago
Cryptanalysis of the Batch Verifying Multiple RSA Digital Signatures
Recently, Harn proposed an efficient scheme that can batch verification multiple RSA digital signatures. His scheme can reduce signature verification time. However, there is a weak...
Min-Shiang Hwang, Iuon-Chang Lin, Kuo-Feng Hwang
RSA
2000
98views more  RSA 2000»
13 years 5 months ago
Degrees and choice numbers
The choice number ch(G) of a graph G = (V, E) is the minimum number k such that for every assignment of a list S(v) of at least k colors to each vertex v V , there is a proper ve...
Noga Alon
CRYPTO
2000
Springer
122views Cryptology» more  CRYPTO 2000»
13 years 9 months ago
Efficient Non-malleable Commitment Schemes
We present efficient non-malleable commitment schemes based on standard assumptions such as RSA and Discrete-Log, and under the condition that the network provides publicly availab...
Marc Fischlin, Roger Fischlin