Sciweavers

324 search results - page 25 / 65
» A new signature scheme without random oracles
Sort
View
ASIACRYPT
2005
Springer
14 years 29 days 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
CSREASAM
2007
13 years 8 months ago
Further Discussions on the Security of a Nominative Signature Scheme
A nominative signature scheme allows a nominator (or signer) and a nominee (or verifier) to jointly generate and publish a signature in such a way that only the nominee can verify...
Lifeng Guo, Guilin Wang, Duncan S. Wong, Lei Hu
ICISC
2004
146views Cryptology» more  ICISC 2004»
13 years 8 months ago
Identity Based Threshold Ring Signature
In threshold ring signature schemes, any group of t entities spontaneously conscript arbitrarily n - t entities to generate a publicly verifiable t-out-of-n signature on behalf of ...
Sherman S. M. Chow, Lucas Chi Kwong Hui, Siu-Ming ...
DCC
2005
IEEE
14 years 7 months ago
Signcryption with Non-interactive Non-repudiation
Signcryption [35] is a public key primitive that achieves the functionality of both an encryption scheme and a signature scheme simultaneously. It does this more efficiently than a...
John Malone-Lee
SACRYPT
1998
Springer
13 years 11 months ago
Computational Alternatives to Random Number Generators
In this paper, we present a simple method for generating random-based signatures when random number generators are either unavailable or of suspected quality (malicious or accident...
David M'Raïhi, David Naccache, David Pointche...