Verifiable encryption of digital signatures and applications

ABSTRACT

This paper presents a new simple schemes for verifiable encryption of digital signatures. We make use of a trusted third party (TTP) but in an optimistic sense, that is, the TTP takes part in the protocol only if one user cheats or simply crashes. Our schemes can be used as primitives to build efficient fair exchange and certified e-mail protocols.

REFERENCES

• 1: N. Asokan , Matthias Schunter , Michael Waidner, Optimistic protocols for fair exchange, Proceedings of the 4th ACM conference on Computer and communications security, p.7-17, April 01-04, 1997, Zurich, Switzerland [doi>10.1145/266420.266426]
• 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: Giuseppe Ateniese, Efficient verifiable encryption (and fair exchange) of digital signatures, Proceedings of the 6th ACM conference on Computer and communications security, p.138-146, November 01-04, 1999, Kent Ridge Digital Labs, Singapore [doi>10.1145/319709.319728]
• 5: 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).
• 6: Giuseppe Ateniese , Cristina Nita-Rotaru, Stateless-Recipient Certified E-Mail System Based on Verifiable Encryption, Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology, p.182-199, February 18-22, 2002
• 7: 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.
• 8: 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).
• 9: Mihir Bellare , Phillip Rogaway, Random oracles are practical: a paradigm for designing efficient protocols, Proceedings of the 1st ACM conference on Computer and communications security, p.62-73, November 03-05, 1993, Fairfax, Virginia, United States [doi>10.1145/168588.168596]
• 10: 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.
• 11: Dan Boneh, The Decision Diffie-Hellman Problem, Proceedings of the Third International Symposium on Algorithmic Number Theory, p.48-63, June 21-25, 1998
• 12: Jan Camenisch , Ivan Damgård, Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes, Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, p.331-345, December 03-07, 2000
• 13: Jan Camenisch , Markus Michels, A Group Signature Scheme with Improved Efficiency, Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology, p.160-174, October 18-22, 1998
• 14: 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}.
• 15: 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.
• 16: Jan Camenisch , Markus Michels, Separability and Efficiency for Generic Group Signature Schemes, Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology, p.413-430, August 15-19, 1999
• 17: 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.
• 18: David Chaum , Torben P. Pedersen, Wallet Databases with Observers, Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology, p.89-105, August 16-20, 1992
• 19: Ronald Cramer , Victor Shoup, Signature schemes based on the strong RSA assumption, Proceedings of the 6th ACM conference on Computer and communications security, p.46-51, November 01-04, 1999, Kent Ridge Digital Labs, Singapore [doi>10.1145/319709.319716]
• 20: 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.
• 21: Shimon Even , Oded Goldreich , Abraham Lempel, A randomized protocol for signing contracts, Communications of the ACM, v.28 n.6, p.637-647, June 1985 [doi>10.1145/3812.3818]
• 22: Amos Fiat , Adi Shamir, How to prove yourself: practical solutions to identification and signature problems, Proceedings on Advances in cryptology---CRYPTO '86, p.186-194, January 1987, Santa Barbara, California, United States
• 23: Eiichiro Fujisaki , Tatsuaki Okamoto, Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations, Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology, p.16-30, August 17-21, 1997
• 24: 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.
• 25: Louis C. Guillou , Jean-Jacques Quisquater, A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge, Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology, p.216-231, August 21-25, 1988
• 26: Alfred J. Menezes , Scott A. Vanstone , Paul C. Van Oorschot, Handbook of Applied Cryptography, CRC Press, Inc., Boca Raton, FL, 1996
• 27: Micali, S. 1997. Certified e-mail with invisible post offices. Presented at the 1997 RSA Security Conference.
• 28: David Naccache , Jacques Stern, A new public key cryptosystem based on higher residues, Proceedings of the 5th ACM conference on Computer and communications security, p.59-66, November 02-05, 1998, San Francisco, California, United States [doi>10.1145/288090.288106]
• 29: 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.
• 30: 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.
• 31: B. Schneier , J. Riordan, A Certified E-Mail Protocol, Proceedings of the 14th Annual Computer Security Applications Conference, p.347, December 07-11, 1998
• 32: R. L. Rivest , A. Shamir , L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, v.21 n.2, p.120-126, Feb. 1978 [doi>10.1145/359340.359342]
• 33: Schnorr, C. P. 1991. Efficient signature generation by smart-cards. Journal of Cryptology 4, 3, 161--174.
• 34: Jianying Zhou , Dieter Gollmann, Certified Electronic Mail, Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security, p.160-171, September 25-27, 1996

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.4 INFORMATION SYSTEMS APPLICATIONS
      H.4.0 General

Keywords:
Certified e-mail, contract signing, digital signatures, fair exchange, proof of knowledge, public-key cryptography