Twin signatures: An alternative to the hash-and-sign paradigm

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2001, Pages 20-27

  Naccache, David ^a   Pointcheval, David ^a   Stern, Jacques ^a  

^a GEMPLUS   (France)

Author keywords

Digital Signatures; Discrete Logarithm; Flexible RSA Problem; Generic Model; Provable Security; Standard Model

Indexed keywords

ALGORITHMS; COMPUTER CRIME; FUNCTIONS; SECURITY OF DATA;

DISCRETE LOGARITHMS; PROVABLE SECURITY;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 0035754582     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. A signature scheme with message recovery as secure as discrete logarithm
2. Collision-free accumulators and fail-stop signature schemes without trees
3. Random oracles are practical: A paradigm for designing efficient protocols
4. Security analysis of the gennaro-halevi-rabin signature scheme
5. Signature scheme based on the strong RSA assumption
6. A public key cryptosystem and a signature scheme based on discrete logarithms
7. Statistical zero knowledge protocols to prove modular polynomial relations
8. Secure hash-and-sign signature without the random oracle
9. A digital signature scheme secure against adaptative chosen-message attacks
10. Chameleon hashing and signatures
11. Batch exponentiation - A fast DLP-based signature generation strategy
12. Complexity of a determinate algorithm for the discrete logarithm
13. Message recovery for signature schemes based on the discrete logarithm problem
14. Monte Carlo methods for index computation (mod p)
15. A method for obtaining digital signatures and public key cryptosystems
16. Efficient signature generation by smart cards
17. Lower bounds for discrete logarithms and related problems