Sciweavers

10 search results - page 1 / 2
» Discrete-Log-Based Signatures May Not Be Equivalent to Discr...
Sort
View
ASIACRYPT
2005
Springer
13 years 10 months ago
Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
Abstract We provide evidence that the unforgeability of several discrete-log based signatures like Schnorr signatures cannot be equivalent to the discrete log problem in the standa...
Pascal Paillier, Damien Vergnaud
CRYPTO
2008
Springer
84views Cryptology» more  CRYPTO 2008»
13 years 6 months ago
Improved Bounds on Security Reductions for Discrete Log Based Signatures
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...
Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Loka...
EUROCRYPT
1995
Springer
13 years 8 months ago
Verifiable Signature Sharing
Abstract. We introduce Verifiable Signature Sharing (VCS), a cryptographic primitive for protecting digital signatures. VCS enables the holder of a digitally signed document, who m...
Matthew K. Franklin, Michael K. Reiter
SETA
2004
Springer
122views Mathematics» more  SETA 2004»
13 years 10 months ago
New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP)
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
Kenneth J. Giuliani, Guang Gong
CIKM
2011
Springer
12 years 4 months ago
LogSig: generating system events from raw textual logs
Modern computing systems generate large amounts of log data. System administrators or domain experts utilize the log data to understand and optimize system behaviors. Most system ...
Liang Tang, Tao Li, Chang-Shing Perng