Sciweavers

Share
PKC
2000
Springer
107views Cryptology» more  PKC 2000»
9 years 3 months ago
Some Remarks on a Fair Exchange Protocol
Fair exchange turns out to be an increasingly importanttopic due to the rapid growth of electronic commerce. An exchange is deemed to be fair if at the end of exchange, either each...
Jianying Zhou, Robert H. Deng, Feng Bao
PKC
2000
Springer
132views Cryptology» more  PKC 2000»
9 years 3 months ago
The Composite Discrete Logarithm and Secure Authentication
For the two last decades, electronic authentication has been an important topic. The first applications were digital signatures to mimic handwritten signatures for digital document...
David Pointcheval
PKC
2000
Springer
84views Cryptology» more  PKC 2000»
9 years 3 months ago
Forward Secrecy and Its Application to Future Mobile Communications Security
Abstract. Perfect forward secrecy, one of the possible security features provided by key establishment protocols, concerns dependency of a session key upon long-term secret keys (s...
DongGook Park, Colin Boyd, Sang-Jae Moon
PKC
2000
Springer
90views Cryptology» more  PKC 2000»
9 years 3 months ago
Elliptic Curves with the Montgomery-Form and Their Cryptographic Applications
Katsuyuki Okeya, Hiroyuki Kurumatani, Kouichi Saku...
PKC
2000
Springer
95views Cryptology» more  PKC 2000»
9 years 3 months ago
Selecting Cryptographic Key Sizes
In this article we offer guidelines for the determination of key sizes for symmetric cryptosystems, RSA, and discrete logarithm based cryptosystems both over finite fields and over...
Arjen K. Lenstra, Eric R. Verheul
PKC
2000
Springer
120views Cryptology» more  PKC 2000»
9 years 3 months ago
Optimally Efficient Accountable Time-Stamping
Abstract. Efficient secure time-stamping schemes employ a 2-level approach in which the time-stamping service operates in rounds. We say that a time-stamping service is accountable...
Ahto Buldas, Helger Lipmaa, Berry Schoenmakers
PKC
2000
Springer
166views Cryptology» more  PKC 2000»
9 years 3 months ago
Design Validations for Discrete Logarithm Based Signature Schemes
A number of signature schemes and standards have been recently designed, based on the Discrete Logarithm problem. In this paper we conduct design validation of such schemes while t...
Ernest F. Brickell, David Pointcheval, Serge Vaude...
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
9 years 3 months ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski
books