Formal security proofs for a signature scheme with partial message recovery

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2020, Issue , 2001, Pages 126-142

  Brown, Daniel R L ^a   Johnson, Don B ^a  

^a Certicom Research   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; CRYPTOGRAPHY; HASH FUNCTIONS; MOBILE SECURITY;

CRYPTOGRAPHIC PRIMITIVES; ELGAMAL SIGNATURES; ELLIPTIC CURVE; FORMAL SECURITY; MESSAGE RECOVERY; SECURITY PROOFS; SIGNATURE SCHEME; VARIABLE LENGTH;

NETWORK SECURITY;

EID: 23044527683     PISSN: None     EISSN: None     Source Type: Journal    
DOI: 10.1007/3-540-45353-9_11     Document Type: Article

References (17)

1. [1] M. Abe and T. Okamoto, “A signature scheme with message recovery as secure as discrete logarithm", Asiacrypt'99, LNCS 1716 (1999) 378-389.
2. [2] W. Aiello, et al., “Security amplification by composition: the case of doubly-iterated, ideal ciphers", Crypto'98, LNCS 1462 (1998) 390-407.
3. [3] M. Bellare, et al., “A concrete security treatment of symmetric encryption: Ana-lysis of the DES modes of operation", Proc. 38th FOCS, 1997, 394-403.
4. [4] M. Bellare and P. Rogaway, “Random oracles are practical: a paradigm for desi-gning efficient protocols", 1st ACM Conference on Computer and Communicati-ons Security, (1993) 62-73.
5. [5] M. Bellare and P. Rogaway, “The exact security of digital signatures-how to sign with RSA and Rabin", Eurocrypt'96, LNCS 1070 (1996) 399-416.
6. [6] M. Bellare and P. Rogaway, “Collision-resistant hashing: towards making UO-WHFs practical", Crypto'97, LNCS 1294 (1997) 470-484.
7. [7] R. Canetti, O. Goldreich and S. Halevi, “The random oracle methodology, revisi-ted (preliminary version)", Proc. 30th STOC, 1998, 209-218.
8. [8] “Postage Indicia Standard" for Canada Post, Draft Version 1. 2, 1999.
9. [9] R. Cramer and V. Shoup, “A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack", Crypto'98, LNCS 1462 (1998) 13-25.
10. [10] M. Jakobsson and C. P. Schnorr, “Security of discrete log cryptosystems in the random oracle + generic model", presented at the Conference on The Mathematics of Public-Key Cryptography, The Fields Institute, Toronto, Canada, (1999).
11. [11] D. Naccache and J. Stern, “Signing on a postcard", Proceedings of the Fourth Annual Conference on Financial Cryptography 2000, to appear.
12. [12] M. Naor and M. Yung, “Universal one-way hash functions and their cryptographic applications", Proc. 21st STOC, ACM (1989), 33-43.
13. [13] K. Nyberg and R. Rueppel, “Message recovery for signature schemes based on the discrete logarithm problem", Designs, Codes and Cryptography, 7 (1996), 61-81.
14. [14] L. Pintsov and S. Vanstone, “Postal revenue collection in the digital age", Pro-ceedings of the Fourth Annual Conference on Financial Cryptography 2000, to appear.
15. [15] D. Pointcheval and J. Stern, “Security proofs for signature schemes", Eu-rocrypt'96, LNCS 1070 (1996) 387-398.
16. [16] V. Shoup, “Lower bounds for discrete logarithms and related problems", Eu-rocrypt'97, LNCS 1233 (1997) 256-266.
17. [17] USPS Information Based Indicia Program (IBIP): Performance Criteria for Infor-mation Based Indicia and Security Architecture for IBI Postage Metering Systems (PCIBISAIPMS), draft, 1998.