Sciweavers

679 search results - page 23 / 136
» Using decision problems in public key cryptography
Sort
View
EUROPKI
2004
Springer
15 years 6 months ago
On the Use of Weber Polynomials in Elliptic Curve Cryptography
Abstract. In many cryptographic applications it is necessary to generate elliptic curves (ECs) with certain security properties. These curves are commonly constructed using the Com...
Elisavet Konstantinou, Yannis C. Stamatiou, Christ...
SACRYPT
2009
Springer
212views Cryptology» more  SACRYPT 2009»
15 years 7 months ago
Compact McEliece Keys from Goppa Codes
The classical McEliece cryptosystem is built upon the class of Goppa codes, which remains secure to this date in contrast to many other families of codes but leads to very large pu...
Rafael Misoczki, Paulo S. L. M. Barreto
SASN
2004
ACM
15 years 6 months ago
Revisiting random key pre-distribution schemes for wireless sensor networks
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
Joengmin Hwang, Yongdae Kim
PQCRYPTO
2010
156views Cryptology» more  PQCRYPTO 2010»
15 years 5 months ago
Selecting Parameters for the Rainbow Signature Scheme
Abstract. Multivariate public key cryptography is one of the main approaches to guarantee the security of communication in a post-quantum world. One of the most promising candidate...
Albrecht Petzoldt, Stanislav Bulygin, Johannes Buc...
EUROCRYPT
2000
Springer
15 years 4 months ago
Efficient Concurrent Zero-Knowledge in the Auxiliary String Model
We show that if any one-way function exists, then 3-round concurrent zero-knowledge arguments for all NP problems can be built in a model where a short auxiliary string with a pres...
Ivan Damgård