Sciweavers

40 search results - page 6 / 8
» crypto 2001
Sort
View
EUROCRYPT
2003
Springer
13 years 11 months ago
Cryptanalysis of the Public-Key Encryption Based on Braid Groups
At CRYPTO 2000, a new public-key encryption based on braid groups was introduced. This paper demonstrates how to solve its underlying problem using the Burau representation. By thi...
Eonkyung Lee, Je Hong Park
ICICS
2001
Springer
13 years 10 months ago
Threshold Undeniable RSA Signature Scheme
Undeniable signature has been extensively researched after Chaum and Antwerpen first proposed the concept of this special digital signature ten years ago. Up to now, however, almo...
Guilin Wang, Sihan Qing, Mingsheng Wang, Zhanfei Z...
CRYPTO
2001
Springer
113views Cryptology» more  CRYPTO 2001»
13 years 10 months ago
OAEP Reconsidered
The OAEP encryption scheme was introduced by Bellare and Rogaway at Eurocrypt ’94. It converts any trapdoor permutation scheme into a public-key encryption scheme. OAEP is widel...
Victor Shoup
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
13 years 10 months ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
Ronald Cramer, Ivan Damgård, Serge Fehr
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
13 years 10 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård