Sciweavers

117 search results - page 3 / 24
» Why Cryptosystems Fail
Sort
View
EUROCRYPT
1999
Springer
13 years 10 months ago
Secure Distributed Key Generation for Discrete-Log Based Cryptosystems
Distributed key generation is a main component of threshold cryptosystems and distributed cryptographic computing in general. Solutions to the distributed generation of private key...
Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk,...
PKC
2007
Springer
219views Cryptology» more  PKC 2007»
14 years 11 days ago
Cryptanalysis of the Paeng-Jung-Ha Cryptosystem from PKC 2003
At PKC 2003 Paeng, Jung, and Ha proposed a lattice based public key cryptosystem(PJH). It is originated from GGH, and designed as a hybrid of GGH and NTRUEncrypt in order to reduce...
Daewan Han, Myung-Hwan Kim, Yongjin Yeom
IMA
2005
Springer
162views Cryptology» more  IMA 2005»
13 years 11 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
HICSS
1995
IEEE
145views Biometrics» more  HICSS 1995»
13 years 9 months ago
Coordination breakdowns: why groupware is so difficult to design
The complexity of group interaction means that there will be many uncertainties in the requirements for software support tools. Many existing software systems rely on the adaptabi...
Steve M. Easterbrook
LATINCRYPT
2010
13 years 4 months ago
Cryptanalysis of the Hidden Matrix Cryptosystem
Abstract. In this paper, we present an efficient cryptanalysis of the socalled HM cryptosystem which was published at Asiacrypt’1999, and one perturbed version of HM. Until now, ...
Jean-Charles Faugère, Antoine Joux, Ludovic...