Sciweavers

180 search results - page 9 / 36
» Discrete Logarithm Based Protocols
Sort
View
VALUETOOLS
2006
ACM
149views Hardware» more  VALUETOOLS 2006»
15 years 3 months ago
Tail asymptotics for discrete event systems
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of ...
Marc Lelarge
CSJM
2006
114views more  CSJM 2006»
14 years 9 months ago
Cryptoschemes Based on New Signature Formation Mechanism
Several variants of new digital signature schemes (DSS) based on the discrete logarithm and factorization problems have been proposed. Considered DSS are characterized in that a n...
Alexander A. Moldovyan, Dmitriy N. Moldovyan, L. V...
AFRICACRYPT
2009
Springer
15 years 4 months ago
Unifying Zero-Knowledge Proofs of Knowledge
Abstract. We present a simple zero-knowledge proof of knowledge protocol of which many protocols in the literature are instantiations. These include Schnorr’s protocol for provin...
Ueli M. Maurer
PKC
2000
Springer
95views Cryptology» more  PKC 2000»
15 years 1 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
IJNSEC
2006
107views more  IJNSEC 2006»
14 years 9 months ago
ID-based Signcryption Scheme with (t, n) Shared Unsigncryption
An identity-based signcryption scheme with (t, n) shared unsigncryption is proposed, which is the integration of the signcryption scheme, the (t, n) threshold scheme and zero know...
Fagen Li, Xiangjun Xin, Yupu Hu