Verifiable encryption of digital signatures and applications

ACM Transactions on Information and System Security

Volumn 7, Issue 1, 2004, Pages 1-20

  Ateniese, Giuseppe ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

Certified e mail; Contract signing; Digital signatures; Fair exchange; Proof of knowledge; Public key cryptography

Indexed keywords

CERTIFIED E-MAIL; CONTRACT SIGNING; FAIR EXCHANGE; PROOF OF KNOWLEDGE; TRUSTED THIRD PARTY (TTP);

COMPUTER NETWORKS; CONTRACTS; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; ELECTRONIC MAIL; INTERNET; NETWORK PROTOCOLS; POSTAL SERVICES; PROBABILISTIC LOGICS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 3142585398     PISSN: 10949224     EISSN: None     Source Type: Journal    
DOI: 10.1145/984334.984335     Document Type: Article

References (35)

1. ASOKAN, N., SCHUNTER, M., AND WAIDNER, M. 1997. Optimistic protocols for fair exchange. In Fourth ACM Conference on Computer and Communication Security. ACM Press, 8-17.
2. ASOKAN, N., SHOUP, V., AND WAIDNER, M. 1998a. Asynchronous protocols for optimistic fair exchange. In IEEE Symposium on Security and Privacy (Oakland, CA).
3. ASOKAN, N., SHOUP, V., AND WAIDNER, M. 1998b. Optimistic fair exchange of digital signatures. IEEE Journal on Selected Areas in Communications 18, 4, 593-610, 2000. Extended abstract in Advances in Cryptology - EUROCRYPT'98. Lecture Notes in Computer Science, vol. 1403. Springer-Verlag, Berlin, 591-606.
4. ASOKAN, N., SHOUP, V., AND WAIDNER, M. 1998b. Optimistic fair exchange of digital signatures. IEEE Journal on Selected Areas in Communications 18, 4, 593-610, 2000. Extended abstract in Advances in Cryptology - EUROCRYPT'98. Lecture Notes in Computer Science, vol. 1403. Springer-Verlag, Berlin, 591-606.
5. ATENIESE, G. 1999. Efficient verifiable encryption (and fair exchange) of digital signatures. In Sixth ACM Conference on Computer and Communications Security (ACM CCS'99). Also appeared as IBM Research Report.
6. ATENIESE, G., DE MEDEIROS, B., AND GOODRICH, M. T. 2001. TRICERT: distributed certified e-mail schemes. In ISOC 2001 Network and Distributed System Security Symposium (NDSS'01) (San Diego, CA, USA).
7. ATENIESE, G. AND NITA-ROTARU, C. 2002. Stateless-recipient certified e-mail system based on verifiable encryption. In RSA 2002, McEnery Convention Center (San Jose, CA, USA, Feb. 19-22).
8. BAHREMAN A. AND TYGAR, J. D. 1994. Certified electronic mail. In Proceedings of Symposium on Network and Distributed Systems Security (Feb. 1994). I. Society, 3-19.
9. BAO, F., DENG, R. H., AND MAO, W. 1998. Efficient and practical fair exchange protocols with off-line TTP. In IEEE Symposium on Security and Privacy (Oakland, CA).
10. BELLARE, M. AND ROGAWAY, P. 1993. Random oracles are practical: A paradigm for designing efficient protocols. In First ACM Conference on Computer and Communication Security. ACM Press, 62-73.
11. BEN-OR, M., GOLDREICH, O., MICALI, S., AND RIVEST, R. 1990. A fair protocol for signing contracts. IEEE Transactions on Information Theory IT-36, 1, 40-46.
12. BONEH, D. 1998. The decision Diffie-Hellman problem. In Algorithmic Number Theory (ANTS-III). Lecture Notes in Computer Science, vol. 1423. Springer-Verlag, Berlin, 48-63.
13. CAMENISCH, J. AND DAMGARD, I. B. 2000. Verifiable encryption, group encryption, and their applications to separable group signatures and signature sharing schemes. In Advances in Cryptology - ASIACRYPT'00. Lecture Notes in Computer Science, vol. 1976. Springer-Verlag, Berlin, 331-345.
14. CAMENISCH, J. AND MICHELS, M. 1998a. A group signature scheme with improved efficiency. In Advances in Cryptology - ASIACRYPT'98. Lecture Notes in Computer Science, vol. 1514. Springer-Verlag, Berlin, 160-174.
15. CAMENISCH, J. AND MICHELS, M. 1998b. A Group Signature Scheme Based on an RSA-Variant. Technical Report RS-98-27, BRICS, Aarhus. An earlier version appears in Camenisch and Michels [1998].
16. CAMENISCH, J. AND MICHELS, M. 1999a. Proving in zero-knowledge that a number is the product of two safe primes. In Advances in Cryptology - EUROCRYPT'99. Lecture Notes in Computer Science. Springer-Verlag, Berlin.
17. CAMENISCH, J. AND MICHELS, M. 1999b. Separability and efficiency for generic group signature schemes. In Advances in Cryptology - Crypto'99.
18. CHAN, A., FRANKEL, Y., AND TSIOUNIS, Y. 1998. Easy come - easy go divisible cash. In Advances in Cryptology - EUROCRYPT'98. Lecture Notes in Computer Science, vol. 1403. Springer-Verlag, Berlin, 561-575. Updated and corrected version available as GTE Technical Report.
19. CHAUM, D. AND PEDERSEN, T. 1992. Wallet databases with observers. In Advances in Cryptology - Crypto'92, 89-105.
20. CRAMER, R. AND SHOUP, V. 1999. Signature schemes based on the strong RSA assumption. In Sixth ACM Conference on Computer and Communication Security. ACM Press.
21. DENG, R. H., GONG, L., LAZAR, A., AND WANG, W. 1996. Practical protocols for certified electronic e-mail. Journal of Networks and Systems Management 4, 3, 279-297.
22. EVEN, S., GOLDREICH, O., AND LEMPEL, A. 1985. A randomized protocol for signing contracts. Communications of the ACM 28, 6, 637-647.
23. FIAT, A. AND SHAMIR, A. 1987. How to prove yourself: practical solutions to identification and signature problems. In Advances in Cryptology - CRYPTO'86. Lecture Notes in Computer Science, vol. 263. Springer-Verlag, Berlin, 186-194.
24. FUJISAKI, E. AND OKAMOTO, T. 1997. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology - CRYPTO'97. Lecture Notes in Computer Science, vol. 1294. Springer-Verlag, Berlin, 16-30.
25. GENNARO, R., HALEVI, S., AND RABIN, T. 1999. Secure signatures, without trees or random oracles. In Advances in Cryptology - EUROCRYPT'99. Lecture Notes in Computer Science, vol. 1592. Springer-Verlag, Berlin, 123-139
26. GUILLOU, L. C. AND QUISQUATER, J. J. 1988. A paradoxical identity-based signature scheme resulting from zero-knowledge. In Advances in Cryptology - CRYPTO'88. Lecture Notes in Computer Science, vol. 403. Springer-Verlag, Berlin, 216-231.
27. MENEZES, A. J., VAN OORSCHOT, P. C., AND VANSTONE, S. A. 1996. Handbook of Applied Cryptography. CRC Press, Boco Raton, FL (ISBN 0-8493-8523-7).
28. MICALI, S. 1997. Certified e-mail with invisible post offices. Presented at the 1997 RSA Security Conference.
29. NACCACHE, D. AND STERN, J. 1998. A new public key cryptosystem based on higher residues. In Fifth ACM Conference on Computer and Communications Security. ACM Press, 59-66.
30. OKAMOTO, T. AND UCHIYAMA, S. 1998. A new public-key cryptosystem as secure as factoring. In Advances in Cryptology - EUROCRYPT'98. Lecture Notes in Computer Science, vol. 1403. Springer-Verlag, Berlin, 308-318.
31. POUPARD, G. AND STERN, J. 1998. Security analysis of a practical "on the fly" authentication and signature generation. In Advances in Cryptology - EUROCRYPT'98. Lecture Notes in Computer Science, vol. 1403. Springer-Verlag, Berlin, 422-436.
32. RIORDAN, J. AND SCHNEIER, B. 1998. A certified e-mail protocol. In Thirteenth Annual Computer Security Applications Conference (Dec.), 100-106.
33. RIVEST, R. L., SHAMIR, A., AND ADLEMAN, L. M. 1978. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21, 2, 120-126.
34. SCHNORR, C. P. 1991. Efficient signature generation by smart-cards. Journal of Cryptology 4, 3, 161-174.
35. ZHOU, J. AND GOLLMANN, D. 1996. Certified electronic mail. In Proceedings of Computer Security - ESORICS'96. Springer-Verlag, Berlin, 55-61.